TSTP Solution File: GEO172+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO172+3 : TPTP v8.1.0. Released v4.0.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:43:54 EDT 2022
% Result : Theorem 8.48s 2.40s
% Output : CNFRefutation 8.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 41 ( 17 unt; 18 nHn; 28 RR)
% Number of literals : 85 ( 0 equ; 27 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_16) ).
cnf(i_0_29,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_29) ).
cnf(i_0_9,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_9) ).
cnf(i_0_35,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_35) ).
cnf(i_0_26,negated_conjecture,
~ equal_points(esk3_0,intersection_point(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_26) ).
cnf(i_0_12,plain,
( distinct_points(X1,X2)
| equal_points(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_12) ).
cnf(i_0_19,plain,
( convergent_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_19) ).
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-8d4rmwli/lgb.p',i_0_37) ).
cnf(i_0_22,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_22) ).
cnf(i_0_23,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_23) ).
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-8d4rmwli/lgb.p',i_0_4) ).
cnf(i_0_28,negated_conjecture,
incident_point_and_line(esk3_0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_28) ).
cnf(i_0_27,negated_conjecture,
incident_point_and_line(esk3_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8d4rmwli/lgb.p',i_0_27) ).
cnf(c_0_51,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_16 ).
cnf(c_0_52,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_29 ).
cnf(c_0_53,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
~ convergent_lines(X1,X1),
i_0_9 ).
cnf(c_0_55,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_53]) ).
cnf(c_0_56,plain,
( convergent_lines(X1,esk1_0)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
( convergent_lines(X1,esk1_0)
| convergent_lines(esk2_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_56]) ).
cnf(c_0_58,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
i_0_35 ).
cnf(c_0_59,plain,
( convergent_lines(X1,esk2_0)
| convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
~ equal_points(esk3_0,intersection_point(esk1_0,esk2_0)),
i_0_26 ).
cnf(c_0_61,plain,
( distinct_points(X1,X2)
| equal_points(X1,X2) ),
i_0_12 ).
cnf(c_0_62,plain,
( convergent_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
i_0_19 ).
cnf(c_0_63,plain,
convergent_lines(parallel_through_point(esk1_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,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_65,negated_conjecture,
distinct_points(esk3_0,intersection_point(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,plain,
( distinct_lines(esk2_0,X1)
| convergent_lines(parallel_through_point(esk1_0,X2),X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X2)
| apart_point_and_line(esk3_0,X1)
| apart_point_and_line(esk3_0,X2)
| ~ distinct_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,plain,
distinct_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_58,c_0_66]) ).
cnf(c_0_69,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_22 ).
cnf(c_0_70,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(esk3_0,esk1_0)
| apart_point_and_line(esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_23 ).
cnf(c_0_72,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(esk3_0,esk2_0)
| apart_point_and_line(esk3_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_52])]) ).
cnf(c_0_73,plain,
( ~ incident_point_and_line(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
i_0_4 ).
cnf(c_0_74,plain,
( apart_point_and_line(esk3_0,esk1_0)
| apart_point_and_line(esk3_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_52])]) ).
cnf(c_0_75,negated_conjecture,
incident_point_and_line(esk3_0,esk1_0),
i_0_28 ).
cnf(c_0_76,plain,
apart_point_and_line(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]) ).
cnf(c_0_77,negated_conjecture,
incident_point_and_line(esk3_0,esk2_0),
i_0_27 ).
cnf(c_0_78,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_76]),c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO172+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 00:57:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.48/2.40 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.48/2.40 # No SInE strategy applied
% 8.48/2.40 # Trying AutoSched0 for 150 seconds
% 8.48/2.40 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_S5PRR_SE_Q4_CS_SP_S4S
% 8.48/2.40 # and selection function SelectNewComplexAHPNS.
% 8.48/2.40 #
% 8.48/2.40 # Preprocessing time : 0.022 s
% 8.48/2.40
% 8.48/2.40 # Proof found!
% 8.48/2.40 # SZS status Theorem
% 8.48/2.40 # SZS output start CNFRefutation
% See solution above
% 8.48/2.40 # Training examples: 0 positive, 0 negative
% 8.48/2.40
% 8.48/2.40 # -------------------------------------------------
% 8.48/2.40 # User time : 0.026 s
% 8.48/2.40 # System time : 0.006 s
% 8.48/2.40 # Total time : 0.032 s
% 8.48/2.40 # Maximum resident set size: 7128 pages
% 8.48/2.40
%------------------------------------------------------------------------------