%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO176+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 : n002.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:48 AM UTC 2026
% Result : Theorem 0.15s 0.47s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 9 unt; 2 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 83 ( 34 ~; 32 |; 10 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 38 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(f10,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(f12,axiom,
! [X0,X1,X2] :
( apart_point_and_line(X0,X1)
=> ( distinct_points(X0,X2)
| apart_point_and_line(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq1) ).
fof(f36,conjecture,
! [X0,X1,X2,X3] :
( ( distinct_points(X0,X1)
& convergent_lines(X2,X3)
& ( apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X3) ) )
=> distinct_points(X0,intersection_point(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( distinct_points(X0,X1)
& convergent_lines(X2,X3)
& ( apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X3) ) )
=> distinct_points(X0,intersection_point(X2,X3)) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f46,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f47,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f50,plain,
! [X0,X1,X2] :
( distinct_points(X0,X2)
| apart_point_and_line(X2,X1)
| ~ apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f51,plain,
! [X0,X1,X2] :
( distinct_points(X0,X2)
| apart_point_and_line(X2,X1)
| ~ apart_point_and_line(X0,X1) ),
inference(flattening,[],[f50]) ).
fof(f76,plain,
? [X0,X1,X2,X3] :
( ~ distinct_points(X0,intersection_point(X2,X3))
& distinct_points(X0,X1)
& convergent_lines(X2,X3)
& ( apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X3) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f77,plain,
? [X0,X1,X2,X3] :
( ~ distinct_points(X0,intersection_point(X2,X3))
& distinct_points(X0,X1)
& convergent_lines(X2,X3)
& ( apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X3) ) ),
inference(flattening,[],[f76]) ).
fof(f86,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f87,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ apart_point_and_line(X0,X1)
| apart_point_and_line(X2,X1)
| distinct_points(X0,X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f114,plain,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f77]) ).
fof(f115,plain,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f77]) ).
fof(f117,plain,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f77]) ).
fof(f120,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| convergent_lines(X0,X1) ),
inference(consistent_polarity_flipping,[],[f86]) ).
fof(f121,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| convergent_lines(X0,X1) ),
inference(consistent_polarity_flipping,[],[f87]) ).
fof(f141,plain,
~ convergent_lines(sK2,sK3),
inference(consistent_polarity_flipping,[],[f115]) ).
fof(f143,definition,
( spl4_1
<=> apart_point_and_line(sK0,sK2) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f145,plain,
( apart_point_and_line(sK0,sK2)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f147,definition,
( spl4_2
<=> apart_point_and_line(sK0,sK3) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f149,plain,
( apart_point_and_line(sK0,sK3)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f147]) ).
fof(f150,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f114,f147,f143]) ).
fof(f158,plain,
( ! [X0] :
( distinct_points(sK0,X0)
| apart_point_and_line(X0,sK3) )
| ~ spl4_2 ),
inference(resolution,[],[f89,f149]) ).
fof(f164,plain,
( apart_point_and_line(intersection_point(sK2,sK3),sK3)
| ~ spl4_2 ),
inference(resolution,[],[f158,f117]) ).
fof(f167,plain,
( convergent_lines(sK2,sK3)
| ~ spl4_2 ),
inference(resolution,[],[f164,f121]) ).
fof(f170,plain,
( $false
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f167,f141]) ).
fof(f171,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f170]) ).
fof(f173,plain,
( ! [X0] :
( distinct_points(sK0,X0)
| apart_point_and_line(X0,sK2) )
| ~ spl4_1 ),
inference(resolution,[],[f145,f89]) ).
fof(f186,plain,
( apart_point_and_line(intersection_point(sK2,sK3),sK2)
| ~ spl4_1 ),
inference(resolution,[],[f173,f117]) ).
fof(f189,plain,
( convergent_lines(sK2,sK3)
| ~ spl4_1 ),
inference(resolution,[],[f186,f120]) ).
fof(f192,plain,
( $false
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f189,f141]) ).
fof(f193,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f192]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f150]) ).
cnf(s2,plain,
~ spl4_2,
inference(sat_conversion,[],[f171]) ).
cnf(s3,plain,
~ spl4_1,
inference(sat_conversion,[],[f193]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f194,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO176+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 07:27:07 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/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.15/0.47 % (3204175)Will run a generic schedule for satisfiability detection.
% 0.15/0.47 % (3204182)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1438082181:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.47 % (3204181)% WARNING: option uhcvi not known.
% 0.15/0.47 % (3204180)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=688890321_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.47 % (3204181)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3825444511:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.47 % (3204184)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=262307107:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.47 % (3204183)dis+10_1_sil=32000:sp=arity:random_seed=1450888302:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.47 % (3204185)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1842024085:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.47 % (3204186)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=88947321:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.47 % TRYING [1]
% 0.15/0.47 % TRYING [2]
% 0.15/0.47 % TRYING [3]
% 0.15/0.47 % (3204181) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3204175-3204181"...
% 0.15/0.47 % TRYING [4]
% 0.15/0.47 % (3204184) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3204175-3204184"...
% 0.15/0.47 % (3204181)...printing done.
% 0.15/0.47 % (3204183) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3204175-3204183"...
% 0.15/0.47 % (3204181)Refutation found. Thanks to Tanya!
% 0.15/0.47 % SZS status Theorem for theBenchmark
% 0.15/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47 % (3204181)------------------------------
% 0.15/0.47 % (3204181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.47 % (3204181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.47 % (3204181)CaDiCaL version: 2.1.3
% 0.15/0.47 % (3204181)Termination reason: Refutation
% 0.15/0.47 % (3204181)Time elapsed: 0.003 s
% 0.15/0.47 % (3204181)Peak memory usage: 12 MB
% 0.15/0.47 % (3204181)Instructions burned: 3 (million)
% 0.15/0.47 % (3204175)Success in time 0.041 s
% 0.15/0.47 % Vampire exiting
%------------------------------------------------------------------------------