%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO219+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 : n011.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:05 AM UTC 2026
% Result : Theorem 0.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 10 unt; 2 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 96 ( 42 ~; 34 |; 14 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 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(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(f15,axiom,
! [X0,X1] :
~ ( ~ convergent_lines(X0,X1)
& ~ unorthogonal_lines(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+4.ax',coipo1) ).
fof(f16,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+4.ax',cotno1) ).
fof(f18,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(f19,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ~ unorthogonal_lines(X0,X1)
& ~ convergent_lines(X0,X2) )
=> ~ unorthogonal_lines(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f24,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f25,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f24]) ).
fof(f38,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
| unorthogonal_lines(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ~ convergent_lines(X1,X2)
| ~ unorthogonal_lines(X1,X2)
| ( convergent_lines(X0,X1)
& unorthogonal_lines(X0,X1) )
| ( convergent_lines(X0,X2)
& unorthogonal_lines(X0,X2) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ~ convergent_lines(X1,X2)
| ~ unorthogonal_lines(X1,X2)
| ( convergent_lines(X0,X1)
& unorthogonal_lines(X0,X1) )
| ( convergent_lines(X0,X2)
& unorthogonal_lines(X0,X2) ) ),
inference(flattening,[],[f39]) ).
fof(f43,plain,
? [X0,X1,X2] :
( unorthogonal_lines(X1,X2)
& ~ unorthogonal_lines(X0,X1)
& ~ convergent_lines(X0,X2) ),
inference(ennf_transformation,[],[f19]) ).
fof(f44,plain,
? [X0,X1,X2] :
( unorthogonal_lines(X1,X2)
& ~ unorthogonal_lines(X0,X1)
& ~ convergent_lines(X0,X2) ),
inference(flattening,[],[f43]) ).
fof(f45,plain,
( unorthogonal_lines(sK1,sK2)
& ~ unorthogonal_lines(sK0,sK1)
& ~ convergent_lines(sK0,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f44]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X1,X2)
| convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f60,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f62,plain,
! [X2,X0,X1] :
( ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2)
| unorthogonal_lines(X0,X1)
| convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f40]) ).
fof(f66,plain,
~ convergent_lines(sK0,sK2),
inference(cnf_transformation,[],[f45]) ).
fof(f67,plain,
~ unorthogonal_lines(sK0,sK1),
inference(cnf_transformation,[],[f45]) ).
fof(f68,plain,
unorthogonal_lines(sK1,sK2),
inference(cnf_transformation,[],[f45]) ).
fof(f69,plain,
convergent_lines(sK0,sK1),
inference(resolution,[],[f60,f67]) ).
fof(f70,plain,
! [X0] :
( convergent_lines(sK1,X0)
| convergent_lines(sK0,X0) ),
inference(resolution,[],[f51,f69]) ).
fof(f92,plain,
! [X0] :
( ~ convergent_lines(sK1,sK2)
| unorthogonal_lines(X0,sK1)
| convergent_lines(X0,sK2) ),
inference(resolution,[],[f62,f68]) ).
fof(f95,definition,
( spl3_1
<=> ! [X0] :
( unorthogonal_lines(X0,sK1)
| convergent_lines(X0,sK2) ) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f96,plain,
( ! [X0] :
( unorthogonal_lines(X0,sK1)
| convergent_lines(X0,sK2) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f95]) ).
fof(f98,definition,
( spl3_2
<=> convergent_lines(sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f100,plain,
( ~ convergent_lines(sK1,sK2)
| spl3_2 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f101,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f92,f98,f95]) ).
fof(f103,plain,
( convergent_lines(sK0,sK2)
| spl3_2 ),
inference(resolution,[],[f100,f70]) ).
fof(f104,plain,
( $false
| spl3_2 ),
inference(forward_subsumption_resolution,[],[f103,f66]) ).
fof(f105,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f104]) ).
fof(f118,plain,
( convergent_lines(sK0,sK2)
| ~ spl3_1 ),
inference(resolution,[],[f96,f67]) ).
fof(f125,plain,
( $false
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f118,f66]) ).
fof(f126,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f125]) ).
cnf(s1,plain,
( spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f101]) ).
cnf(s2,plain,
spl3_2,
inference(sat_conversion,[],[f105]) ).
cnf(s3,plain,
~ spl3_1,
inference(sat_conversion,[],[f126]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f127,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO219+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.40 % Computer : n011.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Sun Sep 27 07:42:01 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/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.16/0.48 % (2069967)Will run a generic schedule for satisfiability detection.
% 0.16/0.48 % (2069977)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2653334536:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.48 % (2069977) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2069967-2069977"...
% 0.16/0.48 % (2069973)% WARNING: option uhcvi not known.
% 0.16/0.48 % (2069977)...printing done.
% 0.16/0.48 % (2069977)Refutation found. Thanks to Tanya!
% 0.16/0.48 % SZS status Theorem for theBenchmark
% 0.16/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (2069977)------------------------------
% 0.16/0.48 % (2069977)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48 % (2069977)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48 % (2069977)CaDiCaL version: 2.1.3
% 0.16/0.48 % (2069977)Termination reason: Refutation
% 0.16/0.48 % (2069977)Time elapsed: 0.002 s
% 0.16/0.48 % (2069977)Peak memory usage: 12 MB
% 0.16/0.48 % (2069977)Instructions burned: 3 (million)
% 0.16/0.48 % (2069967)Success in time 0.034 s
% 0.16/0.48 % Vampire exiting
%------------------------------------------------------------------------------