TSTP Solution File: GEO248+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO248+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 03:44:52 EDT 2022
% Result : Theorem 7.09s 2.37s
% Output : CNFRefutation 7.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 38 ( 15 ~; 11 |; 8 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 6 sgn 18 !; 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,X4] :
( ( apart_point_and_line(X3,X4)
& incident_point_and_line(X6,parallel_lines(X4,X3)) )
=> apart_point_and_line(X6,X4) ),
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,X4] :
( ( apart_point_and_line(X3,X4)
& incident_point_and_line(X6,parallel_lines(X4,X3)) )
=> apart_point_and_line(X6,X4) ),
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(esk1_0,esk3_0)
& incident_point_and_line(esk2_0,parallel_lines(esk3_0,esk1_0))
& ~ apart_point_and_line(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(esk1_0,esk3_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.08/0.14 % Problem : GEO248+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jun 17 18:11:45 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.09/2.37 # ENIGMATIC: Solved by autoschedule:
% 7.09/2.37 # No SInE strategy applied
% 7.09/2.37 # Trying AutoSched0 for 150 seconds
% 7.09/2.37 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.09/2.37 # and selection function SelectCQPrecWNTNp.
% 7.09/2.37 #
% 7.09/2.37 # Preprocessing time : 0.014 s
% 7.09/2.37
% 7.09/2.37 # Proof found!
% 7.09/2.37 # SZS status Theorem
% 7.09/2.37 # SZS output start CNFRefutation
% See solution above
% 7.09/2.37 # Training examples: 0 positive, 0 negative
% 7.09/2.37
% 7.09/2.37 # -------------------------------------------------
% 7.09/2.37 # User time : 0.015 s
% 7.09/2.37 # System time : 0.006 s
% 7.09/2.37 # Total time : 0.021 s
% 7.09/2.37 # Maximum resident set size: 7124 pages
% 7.09/2.37
%------------------------------------------------------------------------------