%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO087+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 09:53:32 AM UTC 2026
% Result : Theorem 0.16s 0.51s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 61 ( 23 ~; 16 |; 12 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 48 ( 42 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( part_of(X1,X0)
<=> ! [X2] :
( incident_c(X2,X1)
=> incident_c(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',part_of_defn) ).
fof(f4,axiom,
! [X0,X1] :
( inner_point(X0,X1)
<=> ( incident_c(X0,X1)
& ~ end_point(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',inner_point_defn) ).
fof(f5,axiom,
! [X0,X1,X2] :
( meet(X0,X1,X2)
<=> ( incident_c(X0,X1)
& incident_c(X0,X2)
& ! [X3] :
( ( incident_c(X3,X1)
& incident_c(X3,X2) )
=> ( end_point(X3,X1)
& end_point(X3,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',meet_defn) ).
fof(f10,axiom,
! [X0] :
? [X1] : inner_point(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',c3) ).
fof(f17,conjecture,
! [X0,X1] :
( part_of(X0,X1)
=> ~ ? [X2] : meet(X2,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_2_9) ).
fof(f18,negated_conjecture,
~ ! [X0,X1] :
( part_of(X0,X1)
=> ~ ? [X2] : meet(X2,X0,X1) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f21,plain,
! [X0,X1] :
( part_of(X1,X0)
<=> ! [X2] :
( incident_c(X2,X0)
| ~ incident_c(X2,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f24,plain,
! [X0,X1,X2] :
( meet(X0,X1,X2)
<=> ( incident_c(X0,X1)
& incident_c(X0,X2)
& ! [X3] :
( ( end_point(X3,X1)
& end_point(X3,X2) )
| ~ incident_c(X3,X1)
| ~ incident_c(X3,X2) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f25,plain,
! [X0,X1,X2] :
( meet(X0,X1,X2)
<=> ( incident_c(X0,X1)
& incident_c(X0,X2)
& ! [X3] :
( ( end_point(X3,X1)
& end_point(X3,X2) )
| ~ incident_c(X3,X1)
| ~ incident_c(X3,X2) ) ) ),
inference(flattening,[],[f24]) ).
fof(f40,plain,
? [X0,X1] :
( ? [X2] : meet(X2,X0,X1)
& part_of(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ part_of(X1,X0)
| incident_c(X2,X0)
| ~ incident_c(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f58,plain,
! [X0,X1] :
( ~ inner_point(X0,X1)
| ~ end_point(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f59,plain,
! [X0,X1] :
( ~ inner_point(X0,X1)
| incident_c(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( ~ meet(X0,X1,X2)
| ~ incident_c(X3,X1)
| end_point(X3,X1)
| ~ incident_c(X3,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f72,plain,
! [X0] : inner_point(sK7(X0),X0),
inference(cnf_transformation,[],[f10]) ).
fof(f82,plain,
part_of(sK13,sK14),
inference(cnf_transformation,[],[f40]) ).
fof(f83,plain,
meet(sK15,sK13,sK14),
inference(cnf_transformation,[],[f40]) ).
fof(f88,plain,
! [X0] : ~ end_point(sK7(X0),X0),
inference(resolution,[],[f58,f72]) ).
fof(f89,plain,
! [X0] : incident_c(sK7(X0),X0),
inference(resolution,[],[f59,f72]) ).
fof(f95,plain,
! [X0] :
( incident_c(X0,sK14)
| ~ incident_c(X0,sK13) ),
inference(resolution,[],[f41,f82]) ).
fof(f187,plain,
! [X0] :
( ~ incident_c(X0,sK13)
| end_point(X0,sK13)
| ~ incident_c(X0,sK14) ),
inference(resolution,[],[f62,f83]) ).
fof(f188,plain,
! [X0] :
( end_point(X0,sK13)
| ~ incident_c(X0,sK13) ),
inference(forward_subsumption_resolution,[],[f187,f95]) ).
fof(f230,plain,
~ incident_c(sK7(sK13),sK13),
inference(resolution,[],[f188,f88]) ).
fof(f231,plain,
$false,
inference(forward_subsumption_resolution,[],[f230,f89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO087+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 % Computer : n015.cluster.edu
% 0.12/0.43 % Model : x86_64 x86_64
% 0.12/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.43 % Memory : 8046.5625MB
% 0.12/0.43 % OS : Linux 6.8.0-71-generic
% 0.12/0.43 % CPULimit : 300
% 0.12/0.43 % WCLimit : 300
% 0.12/0.43 % DateTime : Sun Sep 27 06:57:30 UTC 2026
% 0.12/0.43 % CPUTime :
% 0.12/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.46 Running first-order model finding
% 0.16/0.46 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.51 % (1301097)Will run a generic schedule for satisfiability detection.
% 0.16/0.51 % (1301107)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2886052110:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.51 % (1301103)% WARNING: option uhcvi not known.
% 0.16/0.51 % (1301102)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2922138711_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.51 % (1301108)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1029758243:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.51 % (1301103)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2895905287:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.51 % (1301104)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2887432323:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.51 % (1301105)dis+10_1_sil=32000:sp=arity:random_seed=2838487023:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.51 % (1301106)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3433365400:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.51 % TRYING [1]
% 0.16/0.51 % TRYING [2]
% 0.16/0.51 % TRYING [3]
% 0.16/0.51 % (1301105) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1301097-1301105"...
% 0.16/0.51 % (1301106) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1301097-1301106"...
% 0.16/0.51 % (1301106)...printing done.
% 0.16/0.51 % (1301105)...printing done.
% 0.16/0.51 % TRYING [4]
% 0.16/0.51 % (1301106)Refutation found. Thanks to Tanya!
% 0.16/0.51 % SZS status Theorem for theBenchmark
% 0.16/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.51 % (1301106)------------------------------
% 0.16/0.51 % (1301106)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.51 % (1301106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.51 % (1301106)CaDiCaL version: 2.1.3
% 0.16/0.51 % (1301106)Termination reason: Refutation
% 0.16/0.51 % (1301106)Time elapsed: 0.007 s
% 0.16/0.51 % (1301106)Peak memory usage: 12 MB
% 0.16/0.51 % (1301106)Instructions burned: 10 (million)
% 0.16/0.51 % (1301097)Success in time 0.041 s
% 0.16/0.51 % Vampire exiting
%------------------------------------------------------------------------------