TSTP Solution File: GEO237+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO237+3 : TPTP v8.1.0. Released v4.0.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 : n008.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.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 42 ( 16 ~; 13 |; 7 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 30 ( 6 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a2_defns,axiom,
! [X1,X2] :
( right_apart_point(X1,X2)
<=> left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a2_defns) ).
fof(ax10_basics,axiom,
! [X3,X4] :
~ ( left_apart_point(X3,X4)
| left_apart_point(X3,reverse_line(X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax10_basics) ).
fof(con,conjecture,
! [X3,X6,X7,X4] :
( apart_point_and_line(X7,X4)
=> ( divides_points(X4,X3,X6)
=> ( divides_points(X4,X3,X7)
| divides_points(X4,X6,X7) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(a6_defns,axiom,
! [X3,X4] :
( apart_point_and_line(X3,X4)
<=> ( left_apart_point(X3,X4)
| right_apart_point(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a6_defns) ).
fof(c_0_4,plain,
! [X11,X12] :
( ( ~ right_apart_point(X11,X12)
| left_apart_point(X11,reverse_line(X12)) )
& ( ~ left_apart_point(X11,reverse_line(X12))
| right_apart_point(X11,X12) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_defns])]) ).
fof(c_0_5,plain,
! [X52,X53] :
( ~ left_apart_point(X52,X53)
& ~ left_apart_point(X52,reverse_line(X53)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10_basics])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X3,X6,X7,X4] :
( apart_point_and_line(X7,X4)
=> ( divides_points(X4,X3,X6)
=> ( divides_points(X4,X3,X7)
| divides_points(X4,X6,X7) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_7,plain,
! [X19,X20] :
( ( ~ apart_point_and_line(X19,X20)
| left_apart_point(X19,X20)
| right_apart_point(X19,X20) )
& ( ~ left_apart_point(X19,X20)
| apart_point_and_line(X19,X20) )
& ( ~ right_apart_point(X19,X20)
| apart_point_and_line(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a6_defns])])]) ).
cnf(c_0_8,plain,
( left_apart_point(X1,reverse_line(X2))
| ~ right_apart_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
( apart_point_and_line(esk3_0,esk4_0)
& 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)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( left_apart_point(X1,X2)
| right_apart_point(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
~ right_apart_point(X1,X2),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
apart_point_and_line(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
~ apart_point_and_line(X1,X2),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_11,c_0_12]),c_0_9]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_13,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO237+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 14:02:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37
% 0.12/0.37 # Proof found!
% 0.12/0.37 # SZS status Theorem
% 0.12/0.37 # SZS output start CNFRefutation
% See solution above
% 0.12/0.37 # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------