TSTP Solution File: GEO085+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GEO085+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n029.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 : Sun May 5 05:15:25 EDT 2024
% Result : Theorem 0.11s 0.34s
% Output : Refutation 0.11s
% 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(f174,plain,
$false,
inference(resolution,[],[f173,f103]) ).
fof(f103,plain,
open(sK3),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
( ! [X1,X2] :
( ~ end_point(X2,sK3)
| ~ end_point(X1,sK3)
| X1 = X2 )
& open(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f35,f61]) ).
fof(f61,plain,
( ? [X0] :
( ! [X1,X2] :
( ~ end_point(X2,X0)
| ~ end_point(X1,X0)
| X1 = X2 )
& open(X0) )
=> ( ! [X2,X1] :
( ~ end_point(X2,sK3)
| ~ end_point(X1,sK3)
| X1 = X2 )
& open(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
? [X0] :
( ! [X1,X2] :
( ~ end_point(X2,X0)
| ~ end_point(X1,X0)
| X1 = X2 )
& open(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
~ ! [X0] :
( open(X0)
=> ? [X1,X2] :
( end_point(X2,X0)
& end_point(X1,X0)
& X1 != X2 ) ),
inference(rectify,[],[f18]) ).
fof(f18,negated_conjecture,
~ ! [X0] :
( open(X0)
=> ? [X2,X4] :
( end_point(X4,X0)
& end_point(X2,X0)
& X2 != X4 ) ),
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
! [X0] :
( open(X0)
=> ? [X2,X4] :
( end_point(X4,X0)
& end_point(X2,X0)
& X2 != X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_7_1) ).
fof(f173,plain,
~ open(sK3),
inference(resolution,[],[f172,f106]) ).
fof(f106,plain,
! [X0] :
( end_point(sK5(X0),X0)
| ~ open(X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0] :
( end_point(sK5(X0),X0)
| ~ open(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f37,f65]) ).
fof(f65,plain,
! [X0] :
( ? [X1] : end_point(X1,X0)
=> end_point(sK5(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
! [X0] :
( ? [X1] : end_point(X1,X0)
| ~ open(X0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0] :
( open(X0)
=> ? [X1] : end_point(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f21]) ).
fof(f21,plain,
! [X0] :
( open(X0)
<=> ? [X1] : end_point(X1,X0) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( open(X0)
<=> ? [X2] : end_point(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',open_defn) ).
fof(f172,plain,
~ end_point(sK5(sK3),sK3),
inference(trivial_inequality_removal,[],[f170]) ).
fof(f170,plain,
( sK5(sK3) != sK5(sK3)
| ~ end_point(sK5(sK3),sK3) ),
inference(superposition,[],[f111,f169]) ).
fof(f169,plain,
sK5(sK3) = sK9(sK3,sK5(sK3)),
inference(resolution,[],[f167,f103]) ).
fof(f167,plain,
( ~ open(sK3)
| sK5(sK3) = sK9(sK3,sK5(sK3)) ),
inference(resolution,[],[f163,f106]) ).
fof(f163,plain,
! [X0] :
( ~ end_point(X0,sK3)
| sK5(sK3) = sK9(sK3,X0) ),
inference(resolution,[],[f110,f159]) ).
fof(f159,plain,
! [X0] :
( ~ end_point(X0,sK3)
| sK5(sK3) = X0 ),
inference(resolution,[],[f157,f103]) ).
fof(f157,plain,
! [X0] :
( ~ open(sK3)
| ~ end_point(X0,sK3)
| sK5(sK3) = X0 ),
inference(resolution,[],[f106,f104]) ).
fof(f104,plain,
! [X2,X1] :
( ~ end_point(X2,sK3)
| ~ end_point(X1,sK3)
| X1 = X2 ),
inference(cnf_transformation,[],[f62]) ).
fof(f110,plain,
! [X0,X1] :
( end_point(sK9(X0,X1),X0)
| ~ end_point(X1,X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0,X1] :
( ( sK9(X0,X1) != X1
& end_point(sK9(X0,X1),X0) )
| ~ end_point(X1,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f39,f71]) ).
fof(f71,plain,
! [X0,X1] :
( ? [X2] :
( X1 != X2
& end_point(X2,X0) )
=> ( sK9(X0,X1) != X1
& end_point(sK9(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
! [X0,X1] :
( ? [X2] :
( X1 != X2
& end_point(X2,X0) )
| ~ end_point(X1,X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( end_point(X1,X0)
=> ? [X2] :
( X1 != X2
& end_point(X2,X0) ) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X0,X2] :
( end_point(X2,X0)
=> ? [X4] :
( X2 != X4
& end_point(X4,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c6) ).
fof(f111,plain,
! [X0,X1] :
( sK9(X0,X1) != X1
| ~ end_point(X1,X0) ),
inference(cnf_transformation,[],[f72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GEO085+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 22:02:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 % (17283)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.33 % (17286)WARNING: value z3 for option sas not known
% 0.11/0.33 % (17288)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.11/0.33 % (17285)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.11/0.33 % (17284)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.11/0.33 % (17287)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.11/0.33 % (17290)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.11/0.33 % (17289)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.11/0.33 % (17286)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.34 TRYING [1]
% 0.11/0.34 % (17289)First to succeed.
% 0.11/0.34 TRYING [2]
% 0.11/0.34 % (17289)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17283"
% 0.11/0.34 % (17290)Also succeeded, but the first one will report.
% 0.11/0.34 % (17289)Refutation found. Thanks to Tanya!
% 0.11/0.34 % SZS status Theorem for theBenchmark
% 0.11/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.34 % (17289)------------------------------
% 0.11/0.34 % (17289)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.34 % (17289)Termination reason: Refutation
% 0.11/0.34
% 0.11/0.34 % (17289)Memory used [KB]: 932
% 0.11/0.34 % (17289)Time elapsed: 0.005 s
% 0.11/0.34 % (17289)Instructions burned: 7 (million)
% 0.11/0.34 % (17283)Success in time 0.02 s
%------------------------------------------------------------------------------