TSTP Solution File: GEO182+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO182+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:02 EDT 2022
% Result : Theorem 8.19s 2.42s
% Output : CNFRefutation 8.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 11 unt; 13 nHn; 20 RR)
% Number of literals : 67 ( 0 equ; 21 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-masphaj1/lgb.p',i_0_8) ).
cnf(i_0_15,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-masphaj1/lgb.p',i_0_15) ).
cnf(i_0_4,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-masphaj1/lgb.p',i_0_4) ).
cnf(i_0_16,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-masphaj1/lgb.p',i_0_16) ).
cnf(i_0_17,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/sandbox2/tmp/enigma-theBenchmark.p-masphaj1/lgb.p',i_0_17) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-masphaj1/lgb.p',i_0_1) ).
cnf(i_0_14,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-masphaj1/lgb.p',i_0_14) ).
cnf(i_0_10,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-masphaj1/lgb.p',i_0_10) ).
cnf(i_0_11,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-masphaj1/lgb.p',i_0_11) ).
cnf(c_0_27,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
i_0_8 ).
cnf(c_0_28,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
i_0_15 ).
cnf(c_0_29,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
i_0_4 ).
cnf(c_0_30,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_31,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_17 ).
cnf(c_0_32,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk2_0),X1)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_34,negated_conjecture,
( distinct_points(esk2_0,X1)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,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(esk3_0,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| ~ distinct_points(X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)),
i_0_14 ).
cnf(c_0_38,plain,
( apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,X1)
| apart_point_and_line(esk1_0,X1)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
i_0_10 ).
cnf(c_0_40,negated_conjecture,
( apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
i_0_11 ).
cnf(c_0_42,plain,
( apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_30])]) ).
cnf(c_0_43,plain,
( apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_36])]) ).
cnf(c_0_44,plain,
apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_43]),c_0_30])]) ).
cnf(c_0_45,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_44]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO182+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 02:34:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.19/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.19/2.42 # No SInE strategy applied
% 8.19/2.42 # Trying AutoSched0 for 150 seconds
% 8.19/2.42 # AutoSched0-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 8.19/2.42 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.19/2.42 #
% 8.19/2.42 # Preprocessing time : 0.012 s
% 8.19/2.42 # Presaturation interreduction done
% 8.19/2.42
% 8.19/2.42 # Proof found!
% 8.19/2.42 # SZS status Theorem
% 8.19/2.42 # SZS output start CNFRefutation
% See solution above
% 8.19/2.42 # Training examples: 0 positive, 0 negative
% 8.19/2.42
% 8.19/2.42 # -------------------------------------------------
% 8.19/2.42 # User time : 0.017 s
% 8.19/2.42 # System time : 0.004 s
% 8.19/2.42 # Total time : 0.021 s
% 8.19/2.42 # Maximum resident set size: 7120 pages
% 8.19/2.42
%------------------------------------------------------------------------------