%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO238+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 04:09:01 EDT 2022
% Result : Theorem 0.22s 0.39s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 48 ( 17 ~; 16 |; 12 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 26 ( 5 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X4,X5,X2] :
( ( divides_points(X2,X1,X4)
& divides_points(X2,X1,X5) )
=> ~ divides_points(X2,X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(div_def,axiom,
! [X1,X4,X2] :
( divides_points(X2,X1,X4)
<=> ( ( left_apart_point(X1,X2)
& left_apart_point(X4,reverse_line(X2)) )
| ( left_apart_point(X1,reverse_line(X2))
& left_apart_point(X4,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',div_def) ).
fof(oag10,axiom,
! [X1,X2] :
~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag10) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X4,X5,X2] :
( ( divides_points(X2,X1,X4)
& divides_points(X2,X1,X5) )
=> ~ divides_points(X2,X4,X5) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_4,plain,
! [X11,X12,X13] :
( ( left_apart_point(X11,reverse_line(X13))
| left_apart_point(X11,X13)
| ~ divides_points(X13,X11,X12) )
& ( left_apart_point(X12,X13)
| left_apart_point(X11,X13)
| ~ divides_points(X13,X11,X12) )
& ( left_apart_point(X11,reverse_line(X13))
| left_apart_point(X12,reverse_line(X13))
| ~ divides_points(X13,X11,X12) )
& ( left_apart_point(X12,X13)
| left_apart_point(X12,reverse_line(X13))
| ~ divides_points(X13,X11,X12) )
& ( ~ left_apart_point(X11,X13)
| ~ left_apart_point(X12,reverse_line(X13))
| divides_points(X13,X11,X12) )
& ( ~ left_apart_point(X11,reverse_line(X13))
| ~ left_apart_point(X12,X13)
| divides_points(X13,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[div_def])])]) ).
fof(c_0_5,plain,
! [X40,X41] :
( ~ left_apart_point(X40,X41)
& ~ left_apart_point(X40,reverse_line(X41)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag10])]) ).
fof(c_0_6,negated_conjecture,
( divides_points(esk4_0,esk1_0,esk2_0)
& divides_points(esk4_0,esk1_0,esk3_0)
& divides_points(esk4_0,esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_7,plain,
( left_apart_point(X1,X2)
| left_apart_point(X3,X2)
| ~ divides_points(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
divides_points(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
~ divides_points(X1,X2,X3),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO238+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.03/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 18 09:33:19 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.39 # No SInE strategy applied
% 0.22/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.22/0.39 #
% 0.22/0.39 # Presaturation interreduction done
% 0.22/0.39
% 0.22/0.39 # Proof found!
% 0.22/0.39 # SZS status Theorem
% 0.22/0.39 # SZS output start CNFRefutation
% See solution above
% 0.22/0.39 # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------