%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO195+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:56 AM UTC 2026
% Result : Theorem 0.05s 5.38s
% Output : Refutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 15 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 99 ( 36 ~; 38 |; 16 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 106 ( 100 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ convergent_lines(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(f5,axiom,
! [X0,X1,X2] :
( distinct_lines(X0,X1)
=> ( distinct_lines(X0,X2)
| distinct_lines(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart5) ).
fof(f6,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X0,X2)
| convergent_lines(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(f13,axiom,
! [X0,X1,X2] :
( apart_point_and_line(X0,X1)
=> ( distinct_lines(X1,X2)
| apart_point_and_line(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(f14,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( distinct_lines(X1,X2)
| convergent_lines(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq3) ).
fof(f15,axiom,
! [X0,X1] :
( distinct_lines(X0,X1)
=> convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(f16,axiom,
! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(f17,axiom,
! [X0,X1] : ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp2) ).
fof(f36,conjecture,
! [X0,X1,X2] :
( ( convergent_lines(X0,X1)
& convergent_lines(X2,X1)
& convergent_lines(X0,X2) )
=> ( apart_point_and_line(intersection_point(X0,X1),X2)
=> apart_point_and_line(intersection_point(X1,X0),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2] :
( ( convergent_lines(X0,X1)
& convergent_lines(X2,X1)
& convergent_lines(X0,X2) )
=> ( apart_point_and_line(intersection_point(X0,X1),X2)
=> apart_point_and_line(intersection_point(X1,X0),X2) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f40,plain,
! [X0,X1,X2] :
( distinct_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f41,plain,
! [X0,X1,X2] :
( distinct_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ distinct_lines(X0,X1) ),
inference(flattening,[],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f43,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f42]) ).
fof(f52,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| apart_point_and_line(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f53,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| apart_point_and_line(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f55,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
| ~ distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f76,plain,
? [X0,X1,X2] :
( ~ apart_point_and_line(intersection_point(X1,X0),X2)
& apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X1)
& convergent_lines(X2,X1)
& convergent_lines(X0,X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f77,plain,
? [X0,X1,X2] :
( ~ apart_point_and_line(intersection_point(X1,X0),X2)
& apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X1)
& convergent_lines(X2,X1)
& convergent_lines(X0,X2) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
( ~ apart_point_and_line(intersection_point(sK1,sK0),sK2)
& apart_point_and_line(intersection_point(sK0,sK1),sK2)
& convergent_lines(sK0,sK1)
& convergent_lines(sK2,sK1)
& convergent_lines(sK0,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f77]) ).
fof(f81,plain,
! [X0] : ~ convergent_lines(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f83,plain,
! [X2,X0,X1] :
( distinct_lines(X1,X2)
| distinct_lines(X0,X2)
| ~ distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f84,plain,
! [X2,X0,X1] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f91,plain,
! [X2,X0,X1] :
( distinct_lines(X1,X2)
| apart_point_and_line(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f92,plain,
! [X2,X0,X1] :
( convergent_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f93,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
| ~ distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f94,plain,
! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
inference(cnf_transformation,[],[f16]) ).
fof(f95,plain,
! [X0,X1] : ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
inference(cnf_transformation,[],[f17]) ).
fof(f118,plain,
apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(cnf_transformation,[],[f78]) ).
fof(f126,plain,
! [X2,X0,X1] :
( apart_point_and_line(X0,X1)
| ~ apart_point_and_line(X0,X2)
| distinct_lines(X1,X2) ),
inference(consistent_polarity_flipping,[],[f91]) ).
fof(f127,plain,
! [X0,X1] : apart_point_and_line(X0,parallel_through_point(X1,X0)),
inference(consistent_polarity_flipping,[],[f95]) ).
fof(f132,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(consistent_polarity_flipping,[],[f118]) ).
fof(f134,plain,
! [X0,X1] : ~ distinct_lines(parallel_through_point(X0,X1),X0),
inference(resolution,[],[f93,f94]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,parallel_through_point(X1,X2))
| convergent_lines(X0,X1) ),
inference(resolution,[],[f84,f94]) ).
fof(f143,plain,
! [X2,X0,X1] :
( convergent_lines(X0,X1)
| ~ distinct_lines(X0,parallel_through_point(X1,X2)) ),
inference(resolution,[],[f141,f93]) ).
fof(f146,plain,
! [X0,X1] : ~ distinct_lines(X0,parallel_through_point(X0,X1)),
inference(resolution,[],[f143,f81]) ).
fof(f149,plain,
! [X2,X0,X1] :
( distinct_lines(X0,parallel_through_point(X1,X2))
| ~ distinct_lines(X0,X1) ),
inference(resolution,[],[f146,f83]) ).
fof(f155,plain,
! [X2,X0,X1] : ~ distinct_lines(parallel_through_point(parallel_through_point(X0,X1),X2),X0),
inference(resolution,[],[f149,f134]) ).
fof(f158,plain,
! [X0,X1] :
( ~ convergent_lines(X1,X0)
| distinct_lines(X0,X1) ),
inference(resolution,[],[f92,f81]) ).
fof(f164,plain,
! [X0,X1] :
( distinct_lines(X0,X1)
| ~ distinct_lines(X1,X0) ),
inference(resolution,[],[f158,f93]) ).
fof(f173,plain,
! [X2,X0,X1] : ~ distinct_lines(X0,parallel_through_point(parallel_through_point(X0,X1),X2)),
inference(resolution,[],[f164,f155]) ).
fof(f204,plain,
! [X0] :
( ~ apart_point_and_line(intersection_point(sK0,sK1),X0)
| distinct_lines(sK2,X0) ),
inference(resolution,[],[f126,f132]) ).
fof(f212,plain,
! [X0] : distinct_lines(sK2,parallel_through_point(X0,intersection_point(sK0,sK1))),
inference(resolution,[],[f204,f127]) ).
fof(f231,plain,
$false,
inference(resolution,[],[f212,f173]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GEO195+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/5.32 % Computer : n012.cluster.edu
% 0.05/5.32 % Model : x86_64 x86_64
% 0.05/5.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/5.32 % Memory : 8046.5625MB
% 0.05/5.32 % OS : Linux 6.8.0-71-generic
% 0.05/5.32 % CPULimit : 300
% 0.05/5.32 % WCLimit : 300
% 0.05/5.32 % DateTime : Sun Sep 27 07:32:30 UTC 2026
% 0.05/5.32 % CPUTime :
% 0.05/5.32 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/5.34 Running first-order model finding
% 0.05/5.34 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.05/5.38 % (2036602)Will run a generic schedule for satisfiability detection.
% 0.05/5.38 % (2036608)% WARNING: option uhcvi not known.
% 0.05/5.38 % (2036609)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3464456728:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.05/5.38 % (2036607)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=676110393_2999 on theBenchmark for (2999ds/0Mi)
% 0.05/5.38 % (2036608)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3445872894:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.05/5.38 % (2036610)dis+10_1_sil=32000:sp=arity:random_seed=3068151347:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.05/5.38 % (2036611)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1540585368:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.05/5.38 % (2036612)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1685346286:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.05/5.38 % (2036613)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3449246247:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.05/5.38 % TRYING [1]
% 0.05/5.38 % TRYING [2]
% 0.05/5.38 % TRYING [3]
% 0.05/5.38 % TRYING [4]
% 0.05/5.38 % (2036613) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2036602-2036613"...
% 0.05/5.38 % (2036613)...printing done.
% 0.05/5.38 % TRYING [5]
% 0.05/5.38 % (2036613)Refutation found. Thanks to Tanya!
% 0.05/5.38 % SZS status Theorem for theBenchmark
% 0.05/5.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.05/5.38 % (2036613)------------------------------
% 0.05/5.38 % (2036613)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.05/5.38 % (2036613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.05/5.38 % (2036613)CaDiCaL version: 2.1.3
% 0.05/5.38 % (2036613)Termination reason: Refutation
% 0.05/5.38 % (2036613)Time elapsed: 0.002 s
% 0.05/5.38 % (2036613)Peak memory usage: 11 MB
% 0.05/5.38 % (2036613)Instructions burned: 5 (million)
% 0.05/5.38 % (2036602)Success in time 0.033 s
% 0.05/5.38 % Vampire exiting
%------------------------------------------------------------------------------