%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GEO253+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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 : Thu Sep 24 08:40:08 AM UTC 2026
% Result : Theorem 0.21s 0.51s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 77 ( 36 ~; 15 |; 23 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 2 sgn 26 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apt_def,axiom,
! [A,L] :
( apart_point_and_line(A,L)
<=> ( left_apart_point(A,reverse_line(L))
| left_apart_point(A,L) ) ),
file('GEO007+0.ax',apt_def) ).
fof(oag10,axiom,
! [A,L] :
~ ( left_apart_point(A,reverse_line(L))
| left_apart_point(A,L) ),
file('GEO007+0.ax',oag10) ).
fof(con,conjecture,
! [A,B,L] :
( ( ~ apart_point_and_line(B,parallel_through_point(L,A))
& apart_point_and_line(A,L) )
=> apart_point_and_line(B,L) ),
file('theBenchmark.p',con) ).
fof(f_1_1,plain,
! [A,L] :
( ( apart_point_and_line(A,L)
| ( ~ left_apart_point(A,reverse_line(L))
& ~ left_apart_point(A,L) ) )
& ( left_apart_point(A,reverse_line(L))
| left_apart_point(A,L)
| ~ apart_point_and_line(A,L) ) ),
inference(fof_nnf,[status(thm)],[apt_def]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( ( apart_point_and_line(U_1,U_0)
| ( ~ left_apart_point(U_1,reverse_line(U_0))
& ~ left_apart_point(U_1,U_0) ) )
& ( left_apart_point(U_1,reverse_line(U_0))
| left_apart_point(U_1,U_0)
| ~ apart_point_and_line(U_1,U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_5,U_3] :
( apart_point_and_line(U_5,U_3)
| ( ~ left_apart_point(U_5,reverse_line(U_3))
& ~ left_apart_point(U_5,U_3) ) )
& ! [U_4,U_2] :
( left_apart_point(U_4,reverse_line(U_2))
| left_apart_point(U_4,U_2)
| ~ apart_point_and_line(U_4,U_2) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( left_apart_point(U_4,reverse_line(U_2))
| left_apart_point(U_4,U_2)
| ~ apart_point_and_line(U_4,U_2) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_15_1,plain,
! [A,L] :
( ~ left_apart_point(A,reverse_line(L))
& ~ left_apart_point(A,L) ),
inference(fof_nnf,[status(thm)],[oag10]) ).
fof(f_15_2,plain,
! [U_62,U_61] :
( ~ left_apart_point(U_62,reverse_line(U_61))
& ~ left_apart_point(U_62,U_61) ),
inference(variable_rename,[status(thm)],[f_15_1]) ).
fof(f_15_3,plain,
( ! [U_66,U_64] : ~ left_apart_point(U_66,reverse_line(U_64))
& ! [U_65,U_63] : ~ left_apart_point(U_65,U_63) ),
inference(miniscope,[status(thm)],[f_15_2]) ).
cnf(f_15_4,plain,
~ left_apart_point(U_65,U_63),
inference(clausify,[status(thm)],[f_15_3]) ).
fof(f_32_1,negated_conjecture,
~ ! [A,B,L] :
( ( ~ apart_point_and_line(B,parallel_through_point(L,A))
& apart_point_and_line(A,L) )
=> apart_point_and_line(B,L) ),
inference(negate,[status(cth)],[con]) ).
fof(f_32_2,negated_conjecture,
? [A,B,L] :
( ~ apart_point_and_line(B,L)
& ~ apart_point_and_line(B,parallel_through_point(L,A))
& apart_point_and_line(A,L) ),
inference(fof_nnf,[status(thm)],[f_32_1]) ).
fof(f_32_3,negated_conjecture,
? [U_109,U_108,U_107] :
( ~ apart_point_and_line(U_108,U_107)
& ~ apart_point_and_line(U_108,parallel_through_point(U_107,U_109))
& apart_point_and_line(U_109,U_107) ),
inference(variable_rename,[status(thm)],[f_32_2]) ).
fof(f_32_4,negated_conjecture,
? [U_108,U_107] :
( ~ apart_point_and_line(U_108,U_107)
& ~ apart_point_and_line(U_108,parallel_through_point(U_107,sK1))
& apart_point_and_line(sK1,U_107) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_109,sK1)],[f_32_3]) ).
fof(f_32_5,negated_conjecture,
? [U_107] :
( ~ apart_point_and_line(sK2,U_107)
& ~ apart_point_and_line(sK2,parallel_through_point(U_107,sK1))
& apart_point_and_line(sK1,U_107) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_108,sK2)],[f_32_4]) ).
fof(f_32_6,negated_conjecture,
( ~ apart_point_and_line(sK2,sK3)
& ~ apart_point_and_line(sK2,parallel_through_point(sK3,sK1))
& apart_point_and_line(sK1,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_107,sK3)],[f_32_5]) ).
fof(f_32_7,negated_conjecture,
( ~ apart_point_and_line(sK2,sK3)
& ~ apart_point_and_line(sK2,parallel_through_point(sK3,sK1))
& apart_point_and_line(sK1,sK3) ),
inference(definitional_conversion,[status(esa)],[f_32_6]) ).
cnf(f_32_8,negated_conjecture,
apart_point_and_line(sK1,sK3),
inference(clausify,[status(thm)],[f_32_7]) ).
cnf(t1,plain,
~ left_apart_point(sK1,reverse_line(sK3)),
inference(start,[status(thm),parent(0:0)],[f_15_4]) ).
cnf(t2,plain,
( left_apart_point(sK1,sK3)
| ~ apart_point_and_line(sK1,sK3)
| left_apart_point(sK1,reverse_line(sK3)) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
apart_point_and_line(sK1,sK3),
inference(extension,[status(thm),parent(t2:2)],[f_32_8]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
~ left_apart_point(sK1,sK3),
inference(extension,[status(thm),parent(t2:3)],[f_15_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO253+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n018.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 19 07:44:40 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------