TSTP Solution File: GEO170+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO170+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 03:43:52 EDT 2022
% Result : Theorem 9.07s 2.68s
% Output : CNFRefutation 9.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 14 unt; 11 nHn; 26 RR)
% Number of literals : 64 ( 0 equ; 23 neg)
% Maximal clause size : 6 ( 2 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 : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
~ equal_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_26) ).
cnf(i_0_14,plain,
( distinct_lines(X1,X2)
| equal_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_14) ).
cnf(i_0_10,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_10) ).
cnf(i_0_29,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_29) ).
cnf(i_0_37,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X4,X2)
| apart_point_and_line(X4,X3)
| ~ distinct_points(X4,X1)
| ~ distinct_lines(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_37) ).
cnf(i_0_7,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_7) ).
cnf(i_0_20,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_20) ).
cnf(i_0_21,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_21) ).
cnf(i_0_4,plain,
( ~ incident_point_and_line(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_4) ).
cnf(i_0_28,negated_conjecture,
incident_point_and_line(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_28) ).
cnf(i_0_27,negated_conjecture,
incident_point_and_line(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yg0bppu/lgb.p',i_0_27) ).
cnf(c_0_49,negated_conjecture,
~ equal_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
i_0_26 ).
cnf(c_0_50,plain,
( distinct_lines(X1,X2)
| equal_lines(X1,X2) ),
i_0_14 ).
cnf(c_0_51,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
i_0_10 ).
cnf(c_0_52,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_29 ).
cnf(c_0_53,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X4,X2)
| apart_point_and_line(X4,X3)
| ~ distinct_points(X4,X1)
| ~ distinct_lines(X3,X2) ),
i_0_37 ).
cnf(c_0_54,negated_conjecture,
distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
~ distinct_points(X1,X1),
i_0_7 ).
cnf(c_0_56,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
( apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X2,esk3_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
i_0_20 ).
cnf(c_0_60,plain,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
i_0_21 ).
cnf(c_0_62,plain,
( apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,esk3_0)
| apart_point_and_line(esk1_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_52])]) ).
cnf(c_0_63,plain,
( ~ incident_point_and_line(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
i_0_4 ).
cnf(c_0_64,plain,
( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_52])]) ).
cnf(c_0_65,negated_conjecture,
incident_point_and_line(esk1_0,esk3_0),
i_0_28 ).
cnf(c_0_66,plain,
apart_point_and_line(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_67,negated_conjecture,
incident_point_and_line(esk2_0,esk3_0),
i_0_27 ).
cnf(c_0_68,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_66]),c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO170+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 15:49:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.07/2.68 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.07/2.68 # No SInE strategy applied
% 9.07/2.68 # Trying AutoSched0 for 150 seconds
% 9.07/2.68 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_S5PRR_SE_Q4_CS_SP_S4S
% 9.07/2.68 # and selection function SelectNewComplexAHPNS.
% 9.07/2.68 #
% 9.07/2.68 # Preprocessing time : 0.012 s
% 9.07/2.68
% 9.07/2.68 # Proof found!
% 9.07/2.68 # SZS status Theorem
% 9.07/2.68 # SZS output start CNFRefutation
% See solution above
% 9.07/2.68 # Training examples: 0 positive, 0 negative
% 9.07/2.68
% 9.07/2.68 # -------------------------------------------------
% 9.07/2.68 # User time : 0.017 s
% 9.07/2.68 # System time : 0.002 s
% 9.07/2.68 # Total time : 0.019 s
% 9.07/2.68 # Maximum resident set size: 7128 pages
% 9.07/2.68
%------------------------------------------------------------------------------