TSTP Solution File: GEO193+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO193+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:11 EDT 2022
% Result : Theorem 7.45s 2.40s
% Output : CNFRefutation 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 16 unt; 18 nHn; 23 RR)
% Number of literals : 85 ( 0 equ; 28 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_6) ).
cnf(i_0_18,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_18) ).
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-4m1zwgc0/lgb.p',i_0_8) ).
cnf(i_0_15,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_15) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_3) ).
cnf(i_0_7,plain,
( distinct_points(X1,X2)
| apart_point_and_line(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_7) ).
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_9) ).
cnf(i_0_12,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_12) ).
cnf(i_0_19,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-4m1zwgc0/lgb.p',i_0_19) ).
cnf(i_0_17,negated_conjecture,
convergent_lines(esk3_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_17) ).
cnf(i_0_2,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_2) ).
cnf(i_0_14,negated_conjecture,
~ apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_14) ).
cnf(i_0_13,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m1zwgc0/lgb.p',i_0_13) ).
cnf(c_0_33,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_34,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_18 ).
cnf(c_0_35,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
i_0_8 ).
cnf(c_0_36,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
i_0_15 ).
cnf(c_0_37,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_38,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( distinct_points(X1,X2)
| apart_point_and_line(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_7 ).
cnf(c_0_40,negated_conjecture,
( distinct_lines(esk3_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( distinct_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_9 ).
cnf(c_0_42,plain,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_44,negated_conjecture,
( distinct_lines(esk3_0,X1)
| distinct_points(intersection_point(esk1_0,esk2_0),X2)
| apart_point_and_line(X2,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,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_19 ).
cnf(c_0_46,plain,
( convergent_lines(esk2_0,X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( distinct_lines(esk3_0,X1)
| distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(X1,X2))
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
convergent_lines(esk3_0,esk2_0),
i_0_17 ).
cnf(c_0_49,plain,
~ distinct_lines(X1,X1),
i_0_2 ).
cnf(c_0_50,plain,
( convergent_lines(esk2_0,X1)
| apart_point_and_line(X2,esk1_0)
| apart_point_and_line(X3,esk1_0)
| apart_point_and_line(X2,X1)
| apart_point_and_line(X3,X1)
| ~ distinct_points(X3,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk3_0,esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
~ apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
i_0_14 ).
cnf(c_0_53,negated_conjecture,
( convergent_lines(esk2_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk3_0,esk2_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_54,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_55,plain,
( convergent_lines(esk2_0,X1)
| apart_point_and_line(intersection_point(esk3_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_53]),c_0_34])]) ).
cnf(c_0_56,plain,
apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_34])]),c_0_37]) ).
cnf(c_0_57,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_56]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO193+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 : Fri Jun 17 19:32:19 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
% 7.45/2.40 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.45/2.40 # No SInE strategy applied
% 7.45/2.40 # Trying AutoSched0 for 150 seconds
% 7.45/2.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.45/2.40 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.45/2.40 #
% 7.45/2.40 # Preprocessing time : 0.020 s
% 7.45/2.40 # Presaturation interreduction done
% 7.45/2.40
% 7.45/2.40 # Proof found!
% 7.45/2.40 # SZS status Theorem
% 7.45/2.40 # SZS output start CNFRefutation
% See solution above
% 7.45/2.40 # Training examples: 0 positive, 0 negative
% 7.45/2.40
% 7.45/2.40 # -------------------------------------------------
% 7.45/2.40 # User time : 0.035 s
% 7.45/2.40 # System time : 0.003 s
% 7.45/2.40 # Total time : 0.038 s
% 7.45/2.40 # Maximum resident set size: 7120 pages
% 7.45/2.40
%------------------------------------------------------------------------------