%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO238+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:11 AM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 52 ( 16 ~; 13 |; 18 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 51 ( 43 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( right_apart_point(X0,X1)
<=> left_apart_point(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a2_defns) ).
fof(f8,axiom,
! [X0,X1,X2] :
( divides_points(X2,X0,X1)
<=> ( ( left_apart_point(X0,X2)
& right_apart_point(X1,X2) )
| ( right_apart_point(X0,X2)
& left_apart_point(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a8_defns) ).
fof(f20,axiom,
! [X0,X1] :
~ ( left_apart_point(X0,X1)
| left_apart_point(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax10_basics) ).
fof(f37,conjecture,
! [X0,X1,X2,X3] :
( ( divides_points(X3,X0,X1)
& divides_points(X3,X0,X2) )
=> ~ divides_points(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( divides_points(X3,X0,X1)
& divides_points(X3,X0,X2) )
=> ~ divides_points(X3,X1,X2) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f40,plain,
! [X0,X1,X2] :
( divides_points(X2,X0,X1)
=> ( ( left_apart_point(X0,X2)
& right_apart_point(X1,X2) )
| ( right_apart_point(X0,X2)
& left_apart_point(X1,X2) ) ) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( left_apart_point(X0,X2)
& right_apart_point(X1,X2) )
| ( right_apart_point(X0,X2)
& left_apart_point(X1,X2) )
| ~ divides_points(X2,X0,X1) ),
inference(ennf_transformation,[],[f40]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( left_apart_point(X0,X2)
& right_apart_point(X1,X2) )
| ( right_apart_point(X0,X2)
& left_apart_point(X1,X2) )
| ~ divides_points(X2,X0,X1) ),
inference(flattening,[],[f44]) ).
fof(f56,plain,
! [X0,X1] :
( ~ left_apart_point(X0,X1)
& ~ left_apart_point(X0,reverse_line(X1)) ),
inference(ennf_transformation,[],[f20]) ).
fof(f79,plain,
? [X0,X1,X2,X3] :
( divides_points(X3,X1,X2)
& divides_points(X3,X0,X1)
& divides_points(X3,X0,X2) ),
inference(ennf_transformation,[],[f38]) ).
fof(f80,plain,
? [X0,X1,X2,X3] :
( divides_points(X3,X1,X2)
& divides_points(X3,X0,X1)
& divides_points(X3,X0,X2) ),
inference(flattening,[],[f79]) ).
fof(f81,plain,
! [X0,X1] :
( ( right_apart_point(X0,X1)
| ~ left_apart_point(X0,reverse_line(X1)) )
& ( left_apart_point(X0,reverse_line(X1))
| ~ right_apart_point(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f82,plain,
( divides_points(sK3,sK1,sK2)
& divides_points(sK3,sK0,sK1)
& divides_points(sK3,sK0,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f80]) ).
fof(f83,plain,
! [X0,X1] :
( left_apart_point(X0,reverse_line(X1))
| ~ right_apart_point(X0,X1) ),
inference(cnf_transformation,[],[f81]) ).
fof(f88,plain,
! [X2,X0,X1] :
( right_apart_point(X1,X2)
| left_apart_point(X1,X2)
| ~ divides_points(X2,X0,X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f105,plain,
! [X0,X1] : ~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f56]) ).
fof(f127,plain,
divides_points(sK3,sK1,sK2),
inference(cnf_transformation,[],[f82]) ).
fof(f130,plain,
! [X0,X1] : ~ right_apart_point(X0,X1),
inference(forward_subsumption_resolution,[],[f83,f105]) ).
fof(f139,plain,
! [X2,X0,X1] :
( left_apart_point(X1,X2)
| ~ divides_points(X2,X0,X1) ),
inference(forward_subsumption_resolution,[],[f88,f130]) ).
fof(f140,plain,
! [X2,X0,X1] : ~ divides_points(X2,X0,X1),
inference(forward_subsumption_resolution,[],[f139,f105]) ).
fof(f143,plain,
$false,
inference(resolution,[],[f140,f127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO238+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/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:48:45 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.45 % (2074963)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (2074971)dis+10_1_sil=32000:sp=arity:random_seed=2591655885:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.45 % (2074971) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2074963-2074971"...
% 0.12/0.45 % (2074971)...printing done.
% 0.12/0.45 % (2074971)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 % (2074971)------------------------------
% 0.12/0.45 % (2074971)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (2074971)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (2074971)CaDiCaL version: 2.1.3
% 0.12/0.45 % (2074971)Termination reason: Refutation
% 0.12/0.45 % (2074971)Time elapsed: 0.001 s
% 0.12/0.45 % (2074971)Peak memory usage: 11 MB
% 0.12/0.45 % (2074971)Instructions burned: 2 (million)
% 0.12/0.45 % (2074963)Success in time 0.035 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------