%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO192+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:53:54 AM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 14 unt; 2 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 86 ( 35 ~; 33 |; 8 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 53 ( 0 sgn 47 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : ~ distinct_lines(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart2) ).
fof(f5,axiom,
! [X0,X1,X2] :
( distinct_lines(X0,X1)
=> ( distinct_lines(X0,X2)
| distinct_lines(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart5) ).
fof(f9,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(f10,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(f13,axiom,
! [X0,X1,X2] :
( apart_point_and_line(X0,X1)
=> ( distinct_lines(X1,X2)
| apart_point_and_line(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(f15,conjecture,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( apart_point_and_line(intersection_point(X0,X1),X2)
=> ( distinct_lines(X0,X2)
& distinct_lines(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( apart_point_and_line(intersection_point(X0,X1),X2)
=> ( distinct_lines(X0,X2)
& distinct_lines(X1,X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f19,plain,
! [X0,X1,X2] :
( distinct_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f20,plain,
! [X0,X1,X2] :
( distinct_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ distinct_lines(X0,X1) ),
inference(flattening,[],[f19]) ).
fof(f25,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f26,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f31,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| apart_point_and_line(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f32,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| apart_point_and_line(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(flattening,[],[f31]) ).
fof(f35,plain,
? [X0,X1,X2] :
( ( ~ distinct_lines(X0,X2)
| ~ distinct_lines(X1,X2) )
& apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f36,plain,
? [X0,X1,X2] :
( ( ~ distinct_lines(X0,X2)
| ~ distinct_lines(X1,X2) )
& apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X1) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
( ( ~ distinct_lines(sK0,sK2)
| ~ distinct_lines(sK1,sK2) )
& apart_point_and_line(intersection_point(sK0,sK1),sK2)
& convergent_lines(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f36]) ).
fof(f39,plain,
! [X0] : ~ distinct_lines(X0,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ distinct_lines(X0,X1)
| distinct_lines(X1,X2)
| distinct_lines(X0,X2) ),
inference(cnf_transformation,[],[f20]) ).
fof(f46,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f47,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ apart_point_and_line(X0,X1)
| apart_point_and_line(X0,X2)
| distinct_lines(X1,X2) ),
inference(cnf_transformation,[],[f32]) ).
fof(f52,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f37]) ).
fof(f53,plain,
apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(cnf_transformation,[],[f37]) ).
fof(f54,plain,
( ~ distinct_lines(sK0,sK2)
| ~ distinct_lines(sK1,sK2) ),
inference(cnf_transformation,[],[f37]) ).
fof(f56,definition,
( spl3_1
<=> distinct_lines(sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f58,plain,
( ~ distinct_lines(sK1,sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f60,definition,
( spl3_2
<=> distinct_lines(sK0,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f62,plain,
( ~ distinct_lines(sK0,sK2)
| spl3_2 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f63,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f54,f60,f56]) ).
fof(f68,plain,
! [X0] :
( apart_point_and_line(intersection_point(sK0,sK1),X0)
| distinct_lines(sK2,X0) ),
inference(resolution,[],[f50,f53]) ).
fof(f82,plain,
( distinct_lines(sK2,sK0)
| ~ convergent_lines(sK0,sK1) ),
inference(resolution,[],[f68,f46]) ).
fof(f83,plain,
( distinct_lines(sK2,sK1)
| ~ convergent_lines(sK0,sK1) ),
inference(resolution,[],[f68,f47]) ).
fof(f86,plain,
distinct_lines(sK2,sK1),
inference(forward_subsumption_resolution,[],[f83,f52]) ).
fof(f87,plain,
distinct_lines(sK2,sK0),
inference(forward_subsumption_resolution,[],[f82,f52]) ).
fof(f89,plain,
! [X0] :
( distinct_lines(sK2,X0)
| distinct_lines(sK1,X0) ),
inference(resolution,[],[f86,f42]) ).
fof(f91,plain,
! [X0] :
( distinct_lines(sK2,X0)
| distinct_lines(sK0,X0) ),
inference(resolution,[],[f87,f42]) ).
fof(f111,plain,
distinct_lines(sK1,sK2),
inference(resolution,[],[f89,f39]) ).
fof(f117,plain,
distinct_lines(sK0,sK2),
inference(resolution,[],[f91,f39]) ).
fof(f120,plain,
( $false
| spl3_2 ),
inference(forward_subsumption_resolution,[],[f117,f62]) ).
fof(f121,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f122,plain,
( $false
| spl3_1 ),
inference(forward_subsumption_resolution,[],[f111,f58]) ).
fof(f123,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f122]) ).
cnf(s1,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f63]) ).
cnf(s3,plain,
spl3_2,
inference(sat_conversion,[],[f121]) ).
cnf(s5,plain,
spl3_1,
inference(sat_conversion,[],[f123]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s3,s5]) ).
fof(f124,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO192+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 07:30:30 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.42 Running first-order model finding
% 0.12/0.42 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.12/0.45 % (2064897)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (2064909)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4226759447:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.45 % (2064909) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2064897-2064909"...
% 0.12/0.45 % (2064909)...printing done.
% 0.12/0.45 % (2064905)% WARNING: option uhcvi not known.
% 0.12/0.45 % (2064909)Refutation found. Thanks to Tanya!
% 0.12/0.45 % SZS status Theorem for theBenchmark
% 0.12/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45 % (2064909)------------------------------
% 0.12/0.45 % (2064909)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (2064909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (2064909)CaDiCaL version: 2.1.3
% 0.12/0.45 % (2064909)Termination reason: Refutation
% 0.12/0.45 % (2064909)Time elapsed: 0.002 s
% 0.12/0.45 % (2064909)Peak memory usage: 12 MB
% 0.12/0.45 % (2064909)Instructions burned: 3 (million)
% 0.12/0.45 % (2064897)Success in time 0.019 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------