%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO210+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:02 AM UTC 2026
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 13 unt; 2 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 75 ( 32 ~; 30 |; 8 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 36 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f20,axiom,
! [X0,X1] : ~ unorthogonal_lines(orthogonal_through_point(X1,X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc1) ).
fof(f21,axiom,
! [X0,X1] : ~ apart_point_and_line(X0,orthogonal_through_point(X1,X0)),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc2) ).
fof(f22,axiom,
! [X0,X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( apart_point_and_line(X0,X1)
| apart_point_and_line(X0,X2)
| unorthogonal_lines(X1,X3)
| unorthogonal_lines(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ouo1) ).
fof(f23,conjecture,
! [X0,X1,X2] :
( ( ~ apart_point_and_line(X0,X1)
& ~ unorthogonal_lines(X1,X2) )
=> ~ distinct_lines(X1,orthogonal_through_point(X2,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f24,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ~ apart_point_and_line(X0,X1)
& ~ unorthogonal_lines(X1,X2) )
=> ~ distinct_lines(X1,orthogonal_through_point(X2,X0)) ),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f47,plain,
! [X0,X1,X2,X3] :
( apart_point_and_line(X0,X1)
| apart_point_and_line(X0,X2)
| unorthogonal_lines(X1,X3)
| unorthogonal_lines(X2,X3)
| ~ distinct_lines(X1,X2) ),
inference(ennf_transformation,[],[f22]) ).
fof(f48,plain,
! [X0,X1,X2,X3] :
( apart_point_and_line(X0,X1)
| apart_point_and_line(X0,X2)
| unorthogonal_lines(X1,X3)
| unorthogonal_lines(X2,X3)
| ~ distinct_lines(X1,X2) ),
inference(flattening,[],[f47]) ).
fof(f49,plain,
? [X0,X1,X2] :
( distinct_lines(X1,orthogonal_through_point(X2,X0))
& ~ apart_point_and_line(X0,X1)
& ~ unorthogonal_lines(X1,X2) ),
inference(ennf_transformation,[],[f24]) ).
fof(f50,plain,
? [X0,X1,X2] :
( distinct_lines(X1,orthogonal_through_point(X2,X0))
& ~ apart_point_and_line(X0,X1)
& ~ unorthogonal_lines(X1,X2) ),
inference(flattening,[],[f49]) ).
fof(f51,plain,
( distinct_lines(sK1,orthogonal_through_point(sK2,sK0))
& ~ apart_point_and_line(sK0,sK1)
& ~ unorthogonal_lines(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f50]) ).
fof(f74,plain,
! [X0,X1] : ~ unorthogonal_lines(orthogonal_through_point(X1,X0),X1),
inference(cnf_transformation,[],[f20]) ).
fof(f75,plain,
! [X0,X1] : ~ apart_point_and_line(X0,orthogonal_through_point(X1,X0)),
inference(cnf_transformation,[],[f21]) ).
fof(f76,plain,
! [X2,X3,X0,X1] :
( ~ distinct_lines(X1,X2)
| apart_point_and_line(X0,X2)
| unorthogonal_lines(X1,X3)
| unorthogonal_lines(X2,X3)
| apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
fof(f77,plain,
~ unorthogonal_lines(sK1,sK2),
inference(cnf_transformation,[],[f51]) ).
fof(f78,plain,
~ apart_point_and_line(sK0,sK1),
inference(cnf_transformation,[],[f51]) ).
fof(f79,plain,
distinct_lines(sK1,orthogonal_through_point(sK2,sK0)),
inference(cnf_transformation,[],[f51]) ).
fof(f112,definition,
( spl3_2
<=> ! [X0] :
( apart_point_and_line(X0,orthogonal_through_point(sK2,sK0))
| apart_point_and_line(X0,sK1) ) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f113,plain,
( ! [X0] :
( apart_point_and_line(X0,orthogonal_through_point(sK2,sK0))
| apart_point_and_line(X0,sK1) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f141,plain,
! [X0,X1] :
( apart_point_and_line(X0,orthogonal_through_point(sK2,sK0))
| unorthogonal_lines(sK1,X1)
| unorthogonal_lines(orthogonal_through_point(sK2,sK0),X1)
| apart_point_and_line(X0,sK1) ),
inference(resolution,[],[f76,f79]) ).
fof(f150,definition,
( spl3_6
<=> ! [X1] :
( unorthogonal_lines(sK1,X1)
| unorthogonal_lines(orthogonal_through_point(sK2,sK0),X1) ) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
fof(f151,plain,
( ! [X1] :
( unorthogonal_lines(orthogonal_through_point(sK2,sK0),X1)
| unorthogonal_lines(sK1,X1) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f150]) ).
fof(f152,plain,
( spl3_6
| spl3_2 ),
inference(avatar_split_clause,[],[f141,f112,f150]) ).
fof(f166,plain,
( apart_point_and_line(sK0,sK1)
| ~ spl3_2 ),
inference(resolution,[],[f113,f75]) ).
fof(f171,plain,
( $false
| ~ spl3_2 ),
inference(forward_subsumption_resolution,[],[f166,f78]) ).
fof(f172,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f171]) ).
fof(f175,plain,
( unorthogonal_lines(sK1,sK2)
| ~ spl3_6 ),
inference(resolution,[],[f151,f74]) ).
fof(f179,plain,
( $false
| ~ spl3_6 ),
inference(forward_subsumption_resolution,[],[f175,f77]) ).
fof(f180,plain,
~ spl3_6,
inference(avatar_contradiction_clause,[],[f179]) ).
cnf(s4,plain,
( spl3_2
| spl3_6 ),
inference(sat_conversion,[],[f152]) ).
cnf(s6,plain,
~ spl3_2,
inference(sat_conversion,[],[f172]) ).
cnf(s7,plain,
~ spl3_6,
inference(sat_conversion,[],[f180]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s4,s7,s6]) ).
fof(f181,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO210+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.12/0.39 % Computer : n015.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 07:42:00 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/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.48 % (1322705)Will run a generic schedule for satisfiability detection.
% 0.19/0.48 % (1322712)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2006763931:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.48 % (1322711)% WARNING: option uhcvi not known.
% 0.19/0.48 % (1322710)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3017113444_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.48 % (1322711)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2001936631:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.48 % (1322715)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1691435255:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.48 % (1322713)dis+10_1_sil=32000:sp=arity:random_seed=167231694:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.48 % (1322714)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=241697955:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.48 % (1322716)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3426224509:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.48 % TRYING [1]
% 0.19/0.48 % TRYING [2]
% 0.19/0.48 % TRYING [3]
% 0.19/0.48 % TRYING [4]
% 0.19/0.48 % (1322713) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1322705-1322713"...
% 0.19/0.48 % (1322715) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1322705-1322715"...
% 0.19/0.48 % TRYING [5]
% 0.19/0.48 % (1322713)...printing done.
% 0.19/0.48 % (1322715)...printing done.
% 0.19/0.48 % (1322711) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1322705-1322711"...
% 0.19/0.48 % (1322714) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1322705-1322714"...
% 0.19/0.48 % (1322711)...printing done.
% 0.19/0.48 % (1322713)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (1322713)------------------------------
% 0.19/0.48 % (1322713)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.48 % (1322713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.48 % (1322713)CaDiCaL version: 2.1.3
% 0.19/0.48 % (1322713)Termination reason: Refutation
% 0.19/0.48 % (1322713)Time elapsed: 0.004 s
% 0.19/0.48 % (1322713)Peak memory usage: 12 MB
% 0.19/0.48 % (1322713)Instructions burned: 4 (million)
% 0.19/0.48 % (1322705)Success in time 0.04 s
% 0.19/0.48 % Vampire exiting
%------------------------------------------------------------------------------