%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO176+1 : 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 : 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.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 8 unt; 2 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 80 ( 33 ~; 30 |; 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 : 42 ( 0 sgn 34 !; 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(f15,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(f16,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)],[f15]) ).
fof(f25,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f26,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f29,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(f30,plain,
! [X0,X1,X2] :
( distinct_points(X0,X2)
| apart_point_and_line(X2,X1)
| ~ apart_point_and_line(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f35,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,[],[f16]) ).
fof(f36,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,[],[f35]) ).
fof(f45,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ apart_point_and_line(X0,X1)
| apart_point_and_line(X2,X1)
| distinct_points(X0,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f51,plain,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f36]) ).
fof(f52,plain,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f36]) ).
fof(f54,plain,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f36]) ).
fof(f56,definition,
( spl4_1
<=> apart_point_and_line(sK0,sK2) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f58,plain,
( apart_point_and_line(sK0,sK2)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f60,definition,
( spl4_2
<=> apart_point_and_line(sK0,sK3) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f62,plain,
( apart_point_and_line(sK0,sK3)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f63,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f51,f60,f56]) ).
fof(f68,plain,
( ! [X0] :
( distinct_points(sK0,X0)
| apart_point_and_line(X0,sK3) )
| ~ spl4_2 ),
inference(resolution,[],[f48,f62]) ).
fof(f74,plain,
( apart_point_and_line(intersection_point(sK2,sK3),sK3)
| ~ spl4_2 ),
inference(resolution,[],[f68,f54]) ).
fof(f77,plain,
( ~ convergent_lines(sK2,sK3)
| ~ spl4_2 ),
inference(resolution,[],[f74,f46]) ).
fof(f80,plain,
( $false
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f77,f52]) ).
fof(f81,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f80]) ).
fof(f83,plain,
( ! [X0] :
( distinct_points(sK0,X0)
| apart_point_and_line(X0,sK2) )
| ~ spl4_1 ),
inference(resolution,[],[f58,f48]) ).
fof(f90,plain,
( apart_point_and_line(intersection_point(sK2,sK3),sK2)
| ~ spl4_1 ),
inference(resolution,[],[f83,f54]) ).
fof(f93,plain,
( ~ convergent_lines(sK2,sK3)
| ~ spl4_1 ),
inference(resolution,[],[f90,f45]) ).
fof(f96,plain,
( $false
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f93,f52]) ).
fof(f97,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f96]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f63]) ).
cnf(s2,plain,
~ spl4_2,
inference(sat_conversion,[],[f81]) ).
cnf(s3,plain,
~ spl4_1,
inference(sat_conversion,[],[f97]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f98,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO176+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n002.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 07:26:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.44 % (3203726)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (3203732)% WARNING: option uhcvi not known.
% 0.10/0.44 % (3203732)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2419485118:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.44 % (3203732) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3203726-3203732"...
% 0.10/0.44 % (3203732)...printing done.
% 0.10/0.44 % (3203732)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Theorem for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44 % (3203732)------------------------------
% 0.10/0.44 % (3203732)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (3203732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (3203732)CaDiCaL version: 2.1.3
% 0.10/0.44 % (3203732)Termination reason: Refutation
% 0.10/0.44 % (3203732)Time elapsed: 0.002 s
% 0.10/0.44 % (3203732)Peak memory usage: 12 MB
% 0.10/0.44 % (3203732)Instructions burned: 2 (million)
% 0.10/0.44 % (3203726)Success in time 0.03 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------