%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO172+2 : TPTP v9.3.1. Released v3.3.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:46 AM UTC 2026
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 13 unt; 2 def)
% Number of atoms : 119 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 125 ( 52 ~; 49 |; 16 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 51 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ distinct_points(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart1) ).
fof(f8,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( ( apart_point_and_line(X2,X0)
| apart_point_and_line(X2,X1) )
=> distinct_points(X2,intersection_point(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',con2) ).
fof(f9,axiom,
! [X0,X1,X2,X3] :
( ( distinct_points(X0,X1)
& distinct_lines(X2,X3) )
=> ( apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',cu1) ).
fof(f12,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> distinct_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',ceq3) ).
fof(f13,conjecture,
! [X0,X1,X2] :
( ( convergent_lines(X0,X1)
& ~ apart_point_and_line(X2,X0)
& ~ apart_point_and_line(X2,X1) )
=> ~ distinct_points(X2,intersection_point(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] :
( ( convergent_lines(X0,X1)
& ~ apart_point_and_line(X2,X0)
& ~ apart_point_and_line(X2,X1) )
=> ~ distinct_points(X2,intersection_point(X0,X1)) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f23,plain,
! [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
| ( ~ apart_point_and_line(X2,X0)
& ~ apart_point_and_line(X2,X1) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f24,plain,
! [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
| ( ~ apart_point_and_line(X2,X0)
& ~ apart_point_and_line(X2,X1) )
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| ~ distinct_points(X0,X1)
| ~ distinct_lines(X2,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f26,plain,
! [X0,X1,X2,X3] :
( apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| ~ distinct_points(X0,X1)
| ~ distinct_lines(X2,X3) ),
inference(flattening,[],[f25]) ).
fof(f31,plain,
! [X0,X1] :
( distinct_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f32,plain,
? [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
& convergent_lines(X0,X1)
& ~ apart_point_and_line(X2,X0)
& ~ apart_point_and_line(X2,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f33,plain,
? [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
& convergent_lines(X0,X1)
& ~ apart_point_and_line(X2,X0)
& ~ apart_point_and_line(X2,X1) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
( distinct_points(sK2,intersection_point(sK0,sK1))
& convergent_lines(sK0,sK1)
& ~ apart_point_and_line(sK2,sK0)
& ~ apart_point_and_line(sK2,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f33]) ).
fof(f35,plain,
! [X0] : ~ distinct_points(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f43,plain,
! [X2,X0,X1] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f44,plain,
! [X2,X0,X1] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
! [X2,X3,X0,X1] :
( ~ distinct_lines(X2,X3)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| ~ distinct_points(X0,X1)
| apart_point_and_line(X0,X2) ),
inference(cnf_transformation,[],[f26]) ).
fof(f48,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f49,plain,
~ apart_point_and_line(sK2,sK1),
inference(cnf_transformation,[],[f34]) ).
fof(f50,plain,
~ apart_point_and_line(sK2,sK0),
inference(cnf_transformation,[],[f34]) ).
fof(f51,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f34]) ).
fof(f52,plain,
distinct_points(sK2,intersection_point(sK0,sK1)),
inference(cnf_transformation,[],[f34]) ).
fof(f53,plain,
distinct_lines(sK0,sK1),
inference(resolution,[],[f48,f51]) ).
fof(f82,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(resolution,[],[f43,f35]) ).
fof(f87,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(resolution,[],[f44,f35]) ).
fof(f92,plain,
! [X0,X1] :
( ~ distinct_points(X0,X1)
| apart_point_and_line(X1,sK0)
| apart_point_and_line(X1,sK1)
| apart_point_and_line(X0,sK1)
| apart_point_and_line(X0,sK0) ),
inference(resolution,[],[f45,f53]) ).
fof(f130,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK0)
| apart_point_and_line(intersection_point(sK0,sK1),sK1)
| apart_point_and_line(sK2,sK1)
| apart_point_and_line(sK2,sK0) ),
inference(resolution,[],[f92,f52]) ).
fof(f145,definition,
( spl3_3
<=> apart_point_and_line(intersection_point(sK0,sK1),sK0) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f147,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK0)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f149,definition,
( spl3_4
<=> apart_point_and_line(intersection_point(sK0,sK1),sK1) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
fof(f151,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK1)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f149]) ).
fof(f158,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK0)
| apart_point_and_line(intersection_point(sK0,sK1),sK1)
| apart_point_and_line(sK2,sK0) ),
inference(forward_subsumption_resolution,[],[f130,f49]) ).
fof(f160,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK0)
| apart_point_and_line(intersection_point(sK0,sK1),sK1) ),
inference(forward_subsumption_resolution,[],[f158,f50]) ).
fof(f161,plain,
( spl3_4
| spl3_3 ),
inference(avatar_split_clause,[],[f160,f145,f149]) ).
fof(f162,plain,
( ~ convergent_lines(sK0,sK1)
| ~ spl3_3 ),
inference(resolution,[],[f147,f87]) ).
fof(f167,plain,
( $false
| ~ spl3_3 ),
inference(forward_subsumption_resolution,[],[f162,f51]) ).
fof(f168,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f167]) ).
fof(f169,plain,
( ~ convergent_lines(sK0,sK1)
| ~ spl3_4 ),
inference(resolution,[],[f151,f82]) ).
fof(f174,plain,
( $false
| ~ spl3_4 ),
inference(forward_subsumption_resolution,[],[f169,f51]) ).
fof(f175,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f174]) ).
cnf(s4,plain,
( spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f161]) ).
cnf(s5,plain,
~ spl3_3,
inference(sat_conversion,[],[f168]) ).
cnf(s6,plain,
~ spl3_4,
inference(sat_conversion,[],[f175]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s4,s6,s5]) ).
fof(f176,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO172+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 07:25:45 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.19/0.48 % (1315451)Will run a generic schedule for satisfiability detection.
% 0.19/0.48 % (1315456)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=291564522_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.48 % TRYING [1]
% 0.19/0.48 % TRYING [2]
% 0.19/0.48 % TRYING [3]
% 0.19/0.48 % TRYING [4]
% 0.19/0.48 % TRYING [5]
% 0.19/0.48 % (1315457)% WARNING: option uhcvi not known.
% 0.19/0.48 % TRYING [6]
% 0.19/0.48 % TRYING [7]
% 0.19/0.48 % (1315457)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3606547065:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.48 % (1315458)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1965479488:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.48 % (1315459)dis+10_1_sil=32000:sp=arity:random_seed=162172455:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.48 % (1315460)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4063611907:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.48 % (1315461)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2315076087:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.48 % (1315462)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=648328832:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.48 % (1315459) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1315451-1315459"...
% 0.19/0.48 % TRYING [8]
% 0.19/0.48 % (1315459)...printing done.
% 0.19/0.48 % (1315459)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (1315459)------------------------------
% 0.19/0.48 % (1315459)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.48 % (1315459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.48 % (1315459)CaDiCaL version: 2.1.3
% 0.19/0.48 % (1315459)Termination reason: Refutation
% 0.19/0.48 % (1315459)Time elapsed: 0.004 s
% 0.19/0.48 % (1315459)Peak memory usage: 12 MB
% 0.19/0.48 % (1315459)Instructions burned: 5 (million)
% 0.19/0.48 % (1315451)Success in time 0.049 s
% 0.19/0.48 % Vampire exiting
%------------------------------------------------------------------------------