%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO212+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:54:03 AM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 14 unt; 1 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 82 ( 32 ~; 34 |; 11 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 46 ( 0 sgn 40 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ convergent_lines(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(f6,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X0,X2)
| convergent_lines(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(f18,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
| unorthogonal_lines(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',occu1) ).
fof(f19,axiom,
! [X0,X1,X2] :
( ( convergent_lines(X0,X1)
& unorthogonal_lines(X0,X1) )
=> ( ( convergent_lines(X0,X2)
& unorthogonal_lines(X0,X2) )
| ( convergent_lines(X1,X2)
& unorthogonal_lines(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',oac1) ).
fof(f23,conjecture,
! [X0,X1,X2] :
( unorthogonal_lines(X0,X1)
=> ( convergent_lines(X0,X2)
| unorthogonal_lines(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f24,negated_conjecture,
~ ! [X0,X1,X2] :
( unorthogonal_lines(X0,X1)
=> ( convergent_lines(X0,X2)
| unorthogonal_lines(X1,X2) ) ),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f29,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f30,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( convergent_lines(X0,X2)
& unorthogonal_lines(X0,X2) )
| ( convergent_lines(X1,X2)
& unorthogonal_lines(X1,X2) )
| ~ convergent_lines(X0,X1)
| ~ unorthogonal_lines(X0,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( convergent_lines(X0,X2)
& unorthogonal_lines(X0,X2) )
| ( convergent_lines(X1,X2)
& unorthogonal_lines(X1,X2) )
| ~ convergent_lines(X0,X1)
| ~ unorthogonal_lines(X0,X1) ),
inference(flattening,[],[f45]) ).
fof(f49,plain,
? [X0,X1,X2] :
( ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X1,X2)
& unorthogonal_lines(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f50,plain,
? [X0,X1,X2] :
( ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X1,X2)
& unorthogonal_lines(X0,X1) ),
inference(flattening,[],[f49]) ).
fof(f53,plain,
! [X0] : ~ convergent_lines(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X1,X2)
| convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f68,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f72,plain,
! [X2,X0,X1] :
( ~ unorthogonal_lines(X0,X1)
| unorthogonal_lines(X1,X2)
| ~ convergent_lines(X0,X1)
| convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f46]) ).
fof(f76,plain,
unorthogonal_lines(sK0,sK1),
inference(cnf_transformation,[],[f50]) ).
fof(f77,plain,
~ unorthogonal_lines(sK1,sK2),
inference(cnf_transformation,[],[f50]) ).
fof(f78,plain,
~ convergent_lines(sK0,sK2),
inference(cnf_transformation,[],[f50]) ).
fof(f79,plain,
convergent_lines(sK1,sK2),
inference(resolution,[],[f68,f77]) ).
fof(f116,plain,
! [X0] :
( convergent_lines(X0,sK2)
| ~ convergent_lines(X0,sK0) ),
inference(resolution,[],[f56,f78]) ).
fof(f126,plain,
~ convergent_lines(sK2,sK0),
inference(resolution,[],[f116,f53]) ).
fof(f135,plain,
! [X0] :
( ~ convergent_lines(X0,sK2)
| convergent_lines(X0,sK0) ),
inference(resolution,[],[f126,f56]) ).
fof(f166,definition,
( spl3_1
<=> convergent_lines(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f167,plain,
( convergent_lines(sK0,sK1)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f166]) ).
fof(f168,plain,
( ~ convergent_lines(sK0,sK1)
| spl3_1 ),
inference(avatar_component_clause,[],[f166]) ).
fof(f174,plain,
( ! [X0] :
( convergent_lines(X0,sK1)
| ~ convergent_lines(X0,sK0) )
| spl3_1 ),
inference(resolution,[],[f168,f56]) ).
fof(f216,plain,
! [X0] :
( ~ unorthogonal_lines(X0,sK1)
| ~ convergent_lines(X0,sK1)
| convergent_lines(X0,sK2) ),
inference(resolution,[],[f72,f77]) ).
fof(f230,plain,
( ~ convergent_lines(sK1,sK0)
| spl3_1 ),
inference(resolution,[],[f174,f53]) ).
fof(f303,plain,
( ~ convergent_lines(sK0,sK1)
| convergent_lines(sK0,sK2) ),
inference(resolution,[],[f216,f76]) ).
fof(f384,plain,
convergent_lines(sK1,sK0),
inference(resolution,[],[f135,f79]) ).
fof(f387,plain,
( $false
| spl3_1 ),
inference(forward_subsumption_resolution,[],[f384,f230]) ).
fof(f388,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f387]) ).
fof(f389,plain,
( convergent_lines(sK0,sK2)
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f303,f167]) ).
fof(f390,plain,
( $false
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f389,f78]) ).
fof(f391,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f390]) ).
cnf(s2,plain,
spl3_1,
inference(sat_conversion,[],[f388]) ).
cnf(s3,plain,
~ spl3_1,
inference(sat_conversion,[],[f391]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s2,s3]) ).
fof(f392,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO212+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 07:42:30 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.11/0.45 % (1323541)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (1323550)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=247323465:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (1323550) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1323541-1323550"...
% 0.11/0.45 % (1323550)...printing done.
% 0.11/0.45 % (1323551)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2269476401:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (1323546)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1108646470_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % (1323552)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1968134926:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % (1323548)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1121613320:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (1323549)dis+10_1_sil=32000:sp=arity:random_seed=3107301819:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (1323550)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (1323550)------------------------------
% 0.11/0.45 % (1323550)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (1323550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (1323550)CaDiCaL version: 2.1.3
% 0.11/0.45 % (1323550)Termination reason: Refutation
% 0.11/0.45 % (1323550)Time elapsed: 0.006 s
% 0.11/0.45 % (1323550)Peak memory usage: 12 MB
% 0.11/0.45 % (1323550)Instructions burned: 15 (million)
% 0.11/0.45 % (1323541)Success in time 0.032 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------