%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO209+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 : n017.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:54:02 AM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 60 ( 20 ~; 14 |; 18 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 51 ( 43 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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(f15,axiom,
! [X0,X1] :
( distinct_lines(X0,X1)
=> convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(f32,axiom,
! [X0,X1] :
( equal_lines(X0,X1)
<=> ~ distinct_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',ax2) ).
fof(f33,axiom,
! [X0,X1] :
( parallel_lines(X0,X1)
<=> ~ convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a3) ).
fof(f36,conjecture,
! [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X1)
& incident_point_and_line(X0,X2)
& incident_point_and_line(X0,X3)
& parallel_lines(X2,X1)
& parallel_lines(X3,X1) )
=> equal_lines(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X1)
& incident_point_and_line(X0,X2)
& incident_point_and_line(X0,X3)
& parallel_lines(X2,X1)
& parallel_lines(X3,X1) )
=> equal_lines(X2,X3) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f39,plain,
! [X0,X1] :
( parallel_lines(X0,X1)
=> ~ convergent_lines(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f33]) ).
fof(f40,plain,
! [X0,X1] :
( ~ distinct_lines(X0,X1)
=> equal_lines(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f32]) ).
fof(f45,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f46,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f45]) ).
fof(f59,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
| ~ distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f79,plain,
! [X0,X1] :
( equal_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f40]) ).
fof(f80,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ parallel_lines(X0,X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f82,plain,
? [X0,X1,X2,X3] :
( ~ equal_lines(X2,X3)
& apart_point_and_line(X0,X1)
& incident_point_and_line(X0,X2)
& incident_point_and_line(X0,X3)
& parallel_lines(X2,X1)
& parallel_lines(X3,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f83,plain,
? [X0,X1,X2,X3] :
( ~ equal_lines(X2,X3)
& apart_point_and_line(X0,X1)
& incident_point_and_line(X0,X2)
& incident_point_and_line(X0,X3)
& parallel_lines(X2,X1)
& parallel_lines(X3,X1) ),
inference(flattening,[],[f82]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X1,X2)
| convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f46]) ).
fof(f98,plain,
! [X0,X1] :
( ~ distinct_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f120,plain,
! [X0,X1] :
( equal_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f121,plain,
! [X0,X1] :
( ~ parallel_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f80]) ).
fof(f123,plain,
parallel_lines(sK3,sK1),
inference(cnf_transformation,[],[f83]) ).
fof(f124,plain,
parallel_lines(sK2,sK1),
inference(cnf_transformation,[],[f83]) ).
fof(f128,plain,
~ equal_lines(sK2,sK3),
inference(cnf_transformation,[],[f83]) ).
fof(f130,plain,
distinct_lines(sK2,sK3),
inference(resolution,[],[f120,f128]) ).
fof(f131,plain,
convergent_lines(sK2,sK3),
inference(resolution,[],[f130,f98]) ).
fof(f132,plain,
~ convergent_lines(sK3,sK1),
inference(resolution,[],[f121,f123]) ).
fof(f133,plain,
~ convergent_lines(sK2,sK1),
inference(resolution,[],[f121,f124]) ).
fof(f176,plain,
! [X0] :
( ~ convergent_lines(X0,sK3)
| convergent_lines(X0,sK1) ),
inference(resolution,[],[f89,f132]) ).
fof(f185,plain,
convergent_lines(sK2,sK1),
inference(resolution,[],[f176,f131]) ).
fof(f189,plain,
$false,
inference(forward_subsumption_resolution,[],[f185,f133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO209+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 : n017.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:33:35 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.11/0.46 % (2215307)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (2215316)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2431639977:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (2215316) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2215307-2215316"...
% 0.11/0.46 % (2215313)% WARNING: option uhcvi not known.
% 0.11/0.46 % (2215316)...printing done.
% 0.11/0.46 % (2215316)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (2215316)------------------------------
% 0.11/0.46 % (2215316)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (2215316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (2215316)CaDiCaL version: 2.1.3
% 0.11/0.46 % (2215316)Termination reason: Refutation
% 0.11/0.46 % (2215316)Time elapsed: 0.002 s
% 0.11/0.46 % (2215316)Peak memory usage: 12 MB
% 0.11/0.46 % (2215316)Instructions burned: 6 (million)
% 0.11/0.46 % (2215307)Success in time 0.034 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------