TSTP Solution File: HAL003+3 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : HAL003+3 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 07:26:14 EDT 2024
% Result : Theorem 0.23s 0.45s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 109 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 123 ( 51 ~; 39 |; 23 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 78 ( 65 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f239,plain,
$false,
inference(subsumption_resolution,[],[f238,f119]) ).
fof(f119,plain,
morphism(g,b,e),
inference(cnf_transformation,[],[f19]) ).
fof(f19,axiom,
morphism(g,b,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f238,plain,
~ morphism(g,b,e),
inference(resolution,[],[f237,f182]) ).
fof(f182,plain,
! [X0,X1] :
( element(sK8(g,X0,X1),X1)
| ~ morphism(g,X0,X1) ),
inference(resolution,[],[f145,f104]) ).
fof(f104,plain,
~ surjection(g),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
~ surjection(g),
inference(flattening,[],[f35]) ).
fof(f35,negated_conjecture,
~ surjection(g),
inference(negated_conjecture,[],[f34]) ).
fof(f34,conjecture,
surjection(g),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f145,plain,
! [X2,X0,X1] :
( surjection(X0)
| element(sK8(X0,X1,X2),X2)
| ~ morphism(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
! [X0,X1,X2] :
( surjection(X0)
| ( ! [X4] :
( apply(X0,X4) != sK8(X0,X1,X2)
| ~ element(X4,X1) )
& element(sK8(X0,X1,X2),X2) )
| ~ morphism(X0,X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f68,f87]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ? [X3] :
( ! [X4] :
( apply(X0,X4) != X3
| ~ element(X4,X1) )
& element(X3,X2) )
=> ( ! [X4] :
( apply(X0,X4) != sK8(X0,X1,X2)
| ~ element(X4,X1) )
& element(sK8(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
! [X0,X1,X2] :
( surjection(X0)
| ? [X3] :
( ! [X4] :
( apply(X0,X4) != X3
| ~ element(X4,X1) )
& element(X3,X2) )
| ~ morphism(X0,X1,X2) ),
inference(flattening,[],[f67]) ).
fof(f67,plain,
! [X0,X1,X2] :
( surjection(X0)
| ? [X3] :
( ! [X4] :
( apply(X0,X4) != X3
| ~ element(X4,X1) )
& element(X3,X2) )
| ~ morphism(X0,X1,X2) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( element(X3,X2)
=> ? [X4] :
( apply(X0,X4) = X3
& element(X4,X1) ) )
& morphism(X0,X1,X2) )
=> surjection(X0) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( ! [X6] :
( element(X6,X2)
=> ? [X7] :
( apply(X0,X7) = X6
& element(X7,X1) ) )
& morphism(X0,X1,X2) )
=> surjection(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f237,plain,
~ element(sK8(g,b,e),e),
inference(equality_resolution,[],[f234]) ).
fof(f234,plain,
! [X0] :
( sK8(g,b,e) != X0
| ~ element(X0,e) ),
inference(subsumption_resolution,[],[f233,f127]) ).
fof(f127,plain,
! [X0] :
( element(sK2(X0),b)
| ~ element(X0,e) ),
inference(cnf_transformation,[],[f82]) ).
fof(f82,plain,
! [X0] :
( ( apply(g,subtract(b,sK2(X0),sK3(X0))) = X0
& element(sK3(X0),b)
& element(sK2(X0),b) )
| ~ element(X0,e) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f53,f81]) ).
fof(f81,plain,
! [X0] :
( ? [X1,X2] :
( apply(g,subtract(b,X1,X2)) = X0
& element(X2,b)
& element(X1,b) )
=> ( apply(g,subtract(b,sK2(X0),sK3(X0))) = X0
& element(sK3(X0),b)
& element(sK2(X0),b) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
! [X0] :
( ? [X1,X2] :
( apply(g,subtract(b,X1,X2)) = X0
& element(X2,b)
& element(X1,b) )
| ~ element(X0,e) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0] :
( element(X0,e)
=> ? [X1,X2] :
( apply(g,subtract(b,X1,X2)) = X0
& element(X2,b)
& element(X1,b) ) ),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X18] :
( element(X18,e)
=> ? [X20,X23] :
( apply(g,subtract(b,X20,X23)) = X18
& element(X23,b)
& element(X20,b) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f233,plain,
! [X0] :
( sK8(g,b,e) != X0
| ~ element(X0,e)
| ~ element(sK2(X0),b) ),
inference(subsumption_resolution,[],[f232,f128]) ).
fof(f128,plain,
! [X0] :
( element(sK3(X0),b)
| ~ element(X0,e) ),
inference(cnf_transformation,[],[f82]) ).
fof(f232,plain,
! [X0] :
( sK8(g,b,e) != X0
| ~ element(X0,e)
| ~ element(sK3(X0),b)
| ~ element(sK2(X0),b) ),
inference(resolution,[],[f217,f143]) ).
fof(f143,plain,
! [X2,X0,X1] :
( element(subtract(X0,X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0,X1,X2] :
( element(subtract(X0,X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0) ),
inference(flattening,[],[f63]) ).
fof(f63,plain,
! [X0,X1,X2] :
( element(subtract(X0,X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( element(X2,X0)
& element(X1,X0) )
=> element(subtract(X0,X1,X2),X0) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X1,X4,X5] :
( ( element(X5,X1)
& element(X4,X1) )
=> element(subtract(X1,X4,X5),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f217,plain,
! [X0] :
( ~ element(subtract(b,sK2(X0),sK3(X0)),b)
| sK8(g,b,e) != X0
| ~ element(X0,e) ),
inference(superposition,[],[f210,f129]) ).
fof(f129,plain,
! [X0] :
( apply(g,subtract(b,sK2(X0),sK3(X0))) = X0
| ~ element(X0,e) ),
inference(cnf_transformation,[],[f82]) ).
fof(f210,plain,
! [X0] :
( sK8(g,b,e) != apply(g,X0)
| ~ element(X0,b) ),
inference(resolution,[],[f208,f119]) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ morphism(g,X1,X2)
| ~ element(X0,X1)
| apply(g,X0) != sK8(g,X1,X2) ),
inference(resolution,[],[f146,f104]) ).
fof(f146,plain,
! [X2,X0,X1,X4] :
( surjection(X0)
| apply(X0,X4) != sK8(X0,X1,X2)
| ~ element(X4,X1)
| ~ morphism(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : HAL003+3 : TPTP v8.2.0. Released v2.6.0.
% 0.12/0.12 % Command : run_vampire %s %d THM
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jun 19 14:37:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.36 Running first-order theorem proving
% 0.12/0.36 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.43 % (11444)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.43 % (11446)lrs+1002_74:59_drc=off:tgt=full:sos=all:cond=fast:i=124987:kws=inv_frequency:afp=300:afq=2.0744697298148953:rawr=on:urr=full:sil=128000:si=on:rtra=on:random_seed=3250543_0 on theBenchmark for (2999ds/124987Mi)
% 0.23/0.44 % (11444)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44 % (11450)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=113:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2999ds/113Mi)
% 0.23/0.44 % (11444)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44 % (11449)lrs+1011_1:1_sil=32000:rnwc=on:nwc=10.0:lwlo=on:i=121:bd=off:av=off_0 on theBenchmark for (2999ds/121Mi)
% 0.23/0.44 % (11444)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44 % (11448)lrs+1011_1:1_sil=2000:i=103:ep=RS:nm=32:ss=axioms:sos=on_0 on theBenchmark for (2999ds/103Mi)
% 0.23/0.44 % (11444)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44 % (11451)lrs+1010_1:1_to=lpo:sil=2000:plsq=on:plsqr=32,1:sp=reverse_arity:sos=on:spb=goal_then_units:i=128:ss=axioms:sgt=50:bd=off:sd=3_0 on theBenchmark for (2999ds/128Mi)
% 0.23/0.44 % (11448)Refutation not found, incomplete strategy% (11448)------------------------------
% 0.23/0.44 % (11448)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.44 % (11448)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.44 % (11448)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.44
% 0.23/0.44 % (11448)Memory used [KB]: 1068
% 0.23/0.44 % (11448)Time elapsed: 0.002 s
% 0.23/0.44 % (11448)Instructions burned: 2 (million)
% 0.23/0.44 % (11448)------------------------------
% 0.23/0.44 % (11448)------------------------------
% 0.23/0.44 % (11450)Refutation not found, incomplete strategy% (11450)------------------------------
% 0.23/0.44 % (11450)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.44 % (11450)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.44 % (11450)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.44
% 0.23/0.44 % (11450)Memory used [KB]: 1174
% 0.23/0.44 % (11450)Time elapsed: 0.003 s
% 0.23/0.44 % (11450)Instructions burned: 3 (million)
% 0.23/0.44 % (11444)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44 % (11447)lrs+11_1:16_to=lpo:drc=off:bsd=on:sp=frequency:i=172350:bs=on:av=off:fsd=on:sil=256000:fdi=50_0 on theBenchmark for (2999ds/172350Mi)
% 0.23/0.44 % (11450)------------------------------
% 0.23/0.44 % (11450)------------------------------
% 0.23/0.44 % (11451)Refutation not found, incomplete strategy% (11451)------------------------------
% 0.23/0.44 % (11451)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.44 % (11451)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.44 % (11451)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.44
% 0.23/0.44 % (11451)Memory used [KB]: 1163
% 0.23/0.44 % (11451)Time elapsed: 0.005 s
% 0.23/0.44 % (11451)Instructions burned: 6 (million)
% 0.23/0.44 % (11451)------------------------------
% 0.23/0.44 % (11451)------------------------------
% 0.23/0.44 % (11444)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44 % (11445)lrs+2_5:39_bsr=unit_only:to=lpo:drc=off:sil=128000:plsq=on:plsqr=2,19:sp=frequency:lcm=reverse:fd=preordered:s2a=on:i=38749:s2at=-1.0:fsr=off:uhcvi=on:rawr=on:aer=off:lwlo=on:add=off:bce=on:acc=model:afr=on_0 on theBenchmark for (2999ds/38749Mi)
% 0.23/0.45 % (11449)First to succeed.
% 0.23/0.45 % (11449)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11444"
% 0.23/0.45 % (11444)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.45 % (11449)Refutation found. Thanks to Tanya!
% 0.23/0.45 % SZS status Theorem for theBenchmark
% 0.23/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.45 % (11449)------------------------------
% 0.23/0.45 % (11449)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.45 % (11449)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.45 % (11449)Termination reason: Refutation
% 0.23/0.45
% 0.23/0.45 % (11449)Memory used [KB]: 1283
% 0.23/0.45 % (11449)Time elapsed: 0.012 s
% 0.23/0.45 % (11449)Instructions burned: 14 (million)
% 0.23/0.45 % (11449)------------------------------
% 0.23/0.45 % (11449)------------------------------
% 0.23/0.45 % (11444)Success in time 0.078 s
%------------------------------------------------------------------------------