TSTP Solution File: GEO204+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO204+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:22 EDT 2022
% Result : Theorem 7.39s 2.30s
% Output : CNFRefutation 7.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 11 unt; 0 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 98 ( 38 ~; 42 |; 9 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& equal_points(X2,X3) )
=> ( distinct_points(X1,X3)
& equal_lines(line_connecting(X1,X2),line_connecting(X1,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(ax1,axiom,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',ax1) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart4) ).
fof(ax2,axiom,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',ax2) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& distinct_lines(X4,X5) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',cu1) ).
fof(ci2,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci2) ).
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci1) ).
fof(ceq1,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_points(X1,X3)
| apart_point_and_line(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& equal_points(X2,X3) )
=> ( distinct_points(X1,X3)
& equal_lines(line_connecting(X1,X2),line_connecting(X1,X3)) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,plain,
! [X82,X83] :
( ( ~ equal_points(X82,X83)
| ~ distinct_points(X82,X83) )
& ( distinct_points(X82,X83)
| equal_points(X82,X83) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax1])])]) ).
fof(c_0_10,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& equal_points(esk2_0,esk3_0)
& ( ~ distinct_points(esk1_0,esk3_0)
| ~ equal_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X14,X15,X16] :
( ~ distinct_points(X14,X15)
| distinct_points(X14,X16)
| distinct_points(X15,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
fof(c_0_12,plain,
! [X84,X85] :
( ( ~ equal_lines(X84,X85)
| ~ distinct_lines(X84,X85) )
& ( distinct_lines(X84,X85)
| equal_lines(X84,X85) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax2])])]) ).
cnf(c_0_13,plain,
( ~ equal_points(X1,X2)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
equal_points(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X31,X32,X33,X34] :
( ~ distinct_points(X31,X32)
| ~ distinct_lines(X33,X34)
| apart_point_and_line(X31,X33)
| apart_point_and_line(X31,X34)
| apart_point_and_line(X32,X33)
| apart_point_and_line(X32,X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_18,negated_conjecture,
( ~ distinct_points(esk1_0,esk3_0)
| ~ equal_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( distinct_lines(X1,X2)
| equal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
~ distinct_points(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( distinct_points(esk2_0,X1)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_22,plain,
! [X25,X26] :
( ~ distinct_points(X25,X26)
| ~ apart_point_and_line(X26,line_connecting(X25,X26)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci2])])]) ).
fof(c_0_23,plain,
! [X23,X24] :
( ~ distinct_points(X23,X24)
| ~ apart_point_and_line(X23,line_connecting(X23,X24)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci1])])]) ).
cnf(c_0_24,plain,
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X2,X4)
| ~ distinct_points(X1,X2)
| ~ distinct_lines(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))
| ~ distinct_points(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
distinct_points(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_29,plain,
! [X35,X36,X37] :
( ~ apart_point_and_line(X35,X36)
| distinct_points(X35,X37)
| apart_point_and_line(X37,X36) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq1])]) ).
cnf(c_0_30,negated_conjecture,
( apart_point_and_line(esk2_0,X1)
| apart_point_and_line(esk2_0,X2)
| apart_point_and_line(esk1_0,X1)
| apart_point_and_line(esk1_0,X2)
| ~ distinct_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_31,negated_conjecture,
distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_32,negated_conjecture,
~ apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_33,negated_conjecture,
~ apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0)),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
~ apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_28,c_0_16]) ).
cnf(c_0_35,plain,
( distinct_points(X1,X3)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
apart_point_and_line(esk2_0,line_connecting(esk1_0,esk3_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk1_0,esk3_0)),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_38,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk1_0,esk3_0))
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO204+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 14:27:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.39/2.30 # ENIGMATIC: Solved by autoschedule:
% 7.39/2.30 # No SInE strategy applied
% 7.39/2.30 # Trying AutoSched0 for 150 seconds
% 7.39/2.30 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 7.39/2.30 # and selection function SelectCQIPrecWNTNp.
% 7.39/2.30 #
% 7.39/2.30 # Preprocessing time : 0.015 s
% 7.39/2.30
% 7.39/2.30 # Proof found!
% 7.39/2.30 # SZS status Theorem
% 7.39/2.30 # SZS output start CNFRefutation
% See solution above
% 7.39/2.30 # Training examples: 0 positive, 0 negative
% 7.39/2.30
% 7.39/2.30 # -------------------------------------------------
% 7.39/2.30 # User time : 0.017 s
% 7.39/2.30 # System time : 0.004 s
% 7.39/2.30 # Total time : 0.021 s
% 7.39/2.30 # Maximum resident set size: 7120 pages
% 7.39/2.30
%------------------------------------------------------------------------------