%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO263+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:18 AM UTC 2026
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 70 ( 23 ~; 17 |; 23 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 62 ( 50 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
<=> unequally_directed_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a1_defns) ).
fof(f7,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
<=> ( unequally_directed_lines(X0,X1)
& unequally_directed_opposite_lines(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a7_defns) ).
fof(f19,axiom,
! [X0,X1] :
( ( unequally_directed_lines(X0,X1)
& unequally_directed_lines(X0,reverse_line(X1)) )
=> ( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax9_basics) ).
fof(f21,axiom,
! [X0,X1] :
~ ( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).
fof(f37,conjecture,
! [X0,X1,X2,X3,X4,X5] :
( ( between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2) )
=> between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),intersection_point(X1,parallel_through_point(X2,X4)),intersection_point(X1,parallel_through_point(X2,X5))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2) )
=> between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),intersection_point(X1,parallel_through_point(X2,X4)),intersection_point(X1,parallel_through_point(X2,X5))) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f39,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ( unequally_directed_lines(X0,X1)
& unequally_directed_opposite_lines(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f42,plain,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
=> unequally_directed_lines(X0,reverse_line(X1)) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f43,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_opposite_lines(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f46,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,X1)
& unequally_directed_opposite_lines(X0,X1) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f55,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(ennf_transformation,[],[f19]) ).
fof(f56,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(flattening,[],[f55]) ).
fof(f58,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,X1)
& ~ left_convergent_lines(X0,reverse_line(X1)) ),
inference(ennf_transformation,[],[f21]) ).
fof(f80,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),intersection_point(X1,parallel_through_point(X2,X4)),intersection_point(X1,parallel_through_point(X2,X5)))
& between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2) ),
inference(ennf_transformation,[],[f38]) ).
fof(f81,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),intersection_point(X1,parallel_through_point(X2,X4)),intersection_point(X1,parallel_through_point(X2,X5)))
& between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2) ),
inference(flattening,[],[f80]) ).
fof(f87,plain,
( ~ between_on_line(sK1,intersection_point(sK1,parallel_through_point(sK2,sK3)),intersection_point(sK1,parallel_through_point(sK2,sK4)),intersection_point(sK1,parallel_through_point(sK2,sK5)))
& between_on_line(sK0,sK3,sK4,sK5)
& convergent_lines(sK0,sK1)
& convergent_lines(sK0,sK2)
& convergent_lines(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f81]) ).
fof(f88,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_opposite_lines(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f94,plain,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f95,plain,
! [X0,X1] :
( unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f118,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f56]) ).
fof(f121,plain,
! [X0,X1] : ~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f58]) ).
fof(f122,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f58]) ).
fof(f142,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f87]) ).
fof(f145,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(global_subsumption,[],[f118,f122,f121]) ).
fof(f185,plain,
! [X0,X1] : ~ convergent_lines(X0,X1),
inference(global_subsumption,[],[f94,f145,f88,f95]) ).
fof(f188,plain,
$false,
inference(resolution,[],[f185,f142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO263+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n008.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 07:56:09 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 % (901727)Will run a generic schedule for satisfiability detection.
% 0.19/0.49 % (901732)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4110761696_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.49 % TRYING [1]
% 0.19/0.49 % TRYING [2]
% 0.19/0.49 % TRYING [3]
% 0.19/0.49 % (901733)% WARNING: option uhcvi not known.
% 0.19/0.49 % TRYING [4]
% 0.19/0.49 % (901733)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4147430625:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.49 % (901734)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3230998002:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.49 % (901735)dis+10_1_sil=32000:sp=arity:random_seed=2032089879:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.49 % (901737)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2064529863:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.49 % (901736)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1756678148:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.49 % (901738)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4142734758:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.49 % TRYING [5]
% 0.19/0.49 % (901737) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-901727-901737"...
% 0.19/0.49 % (901734) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-901727-901734"...
% 0.19/0.49 % (901736) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-901727-901736"...
% 0.19/0.49 % (901737)...printing done.
% 0.19/0.49 % (901735) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-901727-901735"...
% 0.19/0.49 % (901734)...printing done.
% 0.19/0.49 % (901736)...printing done.
% 0.19/0.49 % (901734)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (901734)------------------------------
% 0.19/0.49 % (901734)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.49 % (901734)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.49 % (901734)CaDiCaL version: 2.1.3
% 0.19/0.49 % (901734)Termination reason: Refutation
% 0.19/0.49 % (901734)Time elapsed: 0.003 s
% 0.19/0.49 % (901734)Peak memory usage: 12 MB
% 0.19/0.49 % (901734)Instructions burned: 4 (million)
% 0.19/0.49 % (901727)Success in time 0.05 s
% 0.19/0.49 % Vampire exiting
%------------------------------------------------------------------------------