TSTP Solution File: GEO085+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : GEO085+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n009.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 : Wed Aug 31 16:11:46 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 81 ( 21 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 88 ( 38 ~; 23 |; 16 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 54 ( 37 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f231,plain,
$false,
inference(subsumption_resolution,[],[f230,f128]) ).
fof(f128,plain,
open(sK8),
inference(cnf_transformation,[],[f85]) ).
fof(f85,plain,
( ! [X1,X2] :
( ~ end_point(X2,sK8)
| X1 = X2
| ~ end_point(X1,sK8) )
& open(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f52,f84]) ).
fof(f84,plain,
( ? [X0] :
( ! [X1,X2] :
( ~ end_point(X2,X0)
| X1 = X2
| ~ end_point(X1,X0) )
& open(X0) )
=> ( ! [X2,X1] :
( ~ end_point(X2,sK8)
| X1 = X2
| ~ end_point(X1,sK8) )
& open(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
? [X0] :
( ! [X1,X2] :
( ~ end_point(X2,X0)
| X1 = X2
| ~ end_point(X1,X0) )
& open(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,plain,
~ ! [X0] :
( open(X0)
=> ? [X1,X2] :
( end_point(X1,X0)
& X1 != X2
& end_point(X2,X0) ) ),
inference(rectify,[],[f18]) ).
fof(f18,negated_conjecture,
~ ! [X0] :
( open(X0)
=> ? [X2,X4] :
( X2 != X4
& end_point(X4,X0)
& end_point(X2,X0) ) ),
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
! [X0] :
( open(X0)
=> ? [X2,X4] :
( X2 != X4
& end_point(X4,X0)
& end_point(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_7_1) ).
fof(f230,plain,
~ open(sK8),
inference(resolution,[],[f229,f144]) ).
fof(f144,plain,
! [X0] :
( end_point(sK13(X0),X0)
| ~ open(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( end_point(sK13(X0),X0)
| ~ open(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f45,f100]) ).
fof(f100,plain,
! [X0] :
( ? [X1] : end_point(X1,X0)
=> end_point(sK13(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
! [X0] :
( ? [X1] : end_point(X1,X0)
| ~ open(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0] :
( open(X0)
=> ? [X1] : end_point(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f19]) ).
fof(f19,plain,
! [X0] :
( open(X0)
<=> ? [X1] : end_point(X1,X0) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ? [X2] : end_point(X2,X0)
<=> open(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',open_defn) ).
fof(f229,plain,
~ end_point(sK13(sK8),sK8),
inference(trivial_inequality_removal,[],[f228]) ).
fof(f228,plain,
( ~ end_point(sK13(sK8),sK8)
| sK13(sK8) != sK13(sK8) ),
inference(superposition,[],[f118,f217]) ).
fof(f217,plain,
sK5(sK13(sK8),sK8) = sK13(sK8),
inference(subsumption_resolution,[],[f214,f128]) ).
fof(f214,plain,
( ~ open(sK8)
| sK5(sK13(sK8),sK8) = sK13(sK8) ),
inference(resolution,[],[f173,f144]) ).
fof(f173,plain,
! [X0] :
( ~ end_point(X0,sK8)
| sK5(X0,sK8) = sK13(sK8) ),
inference(resolution,[],[f162,f119]) ).
fof(f119,plain,
! [X0,X1] :
( end_point(sK5(X0,X1),X1)
| ~ end_point(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0,X1] :
( ( end_point(sK5(X0,X1),X1)
& sK5(X0,X1) != X0 )
| ~ end_point(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f46,f77]) ).
fof(f77,plain,
! [X0,X1] :
( ? [X2] :
( end_point(X2,X1)
& X0 != X2 )
=> ( end_point(sK5(X0,X1),X1)
& sK5(X0,X1) != X0 ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
! [X0,X1] :
( ? [X2] :
( end_point(X2,X1)
& X0 != X2 )
| ~ end_point(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,plain,
! [X1,X0] :
( end_point(X0,X1)
=> ? [X2] :
( end_point(X2,X1)
& X0 != X2 ) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X2,X0] :
( end_point(X2,X0)
=> ? [X4] :
( end_point(X4,X0)
& X2 != X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c6) ).
fof(f162,plain,
! [X1] :
( ~ end_point(X1,sK8)
| sK13(sK8) = X1 ),
inference(subsumption_resolution,[],[f160,f128]) ).
fof(f160,plain,
! [X1] :
( ~ end_point(X1,sK8)
| sK13(sK8) = X1
| ~ open(sK8) ),
inference(resolution,[],[f129,f144]) ).
fof(f129,plain,
! [X2,X1] :
( ~ end_point(X2,sK8)
| ~ end_point(X1,sK8)
| X1 = X2 ),
inference(cnf_transformation,[],[f85]) ).
fof(f118,plain,
! [X0,X1] :
( sK5(X0,X1) != X0
| ~ end_point(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO085+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n009.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 : Mon Aug 29 21:09:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.50 % (8665)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.50 % (8656)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.50 % (8651)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.50 % (8665)First to succeed.
% 0.19/0.51 % (8641)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.51 % (8648)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (8667)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.19/0.51 % (8668)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.51 % (8640)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (8660)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.51 % (8648)Also succeeded, but the first one will report.
% 0.19/0.51 % (8642)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (8665)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (8665)------------------------------
% 0.19/0.52 % (8665)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (8665)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (8665)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (8665)Memory used [KB]: 5500
% 0.19/0.52 % (8665)Time elapsed: 0.109 s
% 0.19/0.52 % (8665)Instructions burned: 5 (million)
% 0.19/0.52 % (8665)------------------------------
% 0.19/0.52 % (8665)------------------------------
% 0.19/0.52 % (8636)Success in time 0.168 s
%------------------------------------------------------------------------------