TSTP Solution File: GEO255+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO255+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:44:56 EDT 2022
% Result : Theorem 7.31s 2.39s
% Output : CNFRefutation 7.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 16 unt; 11 nHn; 28 RR)
% Number of literals : 70 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 55 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_51,plain,
( distinct_points(X1,X2)
| ~ before_on_line(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_51) ).
cnf(i_0_68,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_68) ).
cnf(i_0_55,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X3,X2)
| ~ unequally_directed_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_55) ).
cnf(i_0_63,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_63) ).
cnf(i_0_8,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ equally_directed_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_8) ).
cnf(i_0_66,plain,
( equally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1)))
| ~ distinct_points(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_66) ).
cnf(i_0_48,plain,
( equally_directed_lines(X1,line_connecting(X2,X3))
| ~ before_on_line(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_48) ).
cnf(i_0_67,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_67) ).
cnf(i_0_65,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_65) ).
cnf(i_0_33,plain,
~ left_convergent_lines(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_33) ).
cnf(i_0_52,plain,
equally_directed_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f11_6aoq/lgb.p',i_0_52) ).
cnf(c_0_80,plain,
( distinct_points(X1,X2)
| ~ before_on_line(X3,X1,X2) ),
i_0_51 ).
cnf(c_0_81,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
i_0_68 ).
cnf(c_0_82,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X3,X2)
| ~ unequally_directed_lines(X3,X1) ),
i_0_55 ).
cnf(c_0_83,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
i_0_63 ).
cnf(c_0_84,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ equally_directed_lines(X1,X2) ),
i_0_8 ).
cnf(c_0_85,plain,
( equally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1)))
| ~ distinct_points(X1,X2) ),
i_0_66 ).
cnf(c_0_86,negated_conjecture,
distinct_points(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_87,plain,
( unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(X3,X1)
| unequally_directed_lines(X3,X2) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_88,plain,
( equally_directed_lines(X1,line_connecting(X2,X3))
| ~ before_on_line(X1,X2,X3) ),
i_0_48 ).
cnf(c_0_89,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk2_0),
i_0_67 ).
cnf(c_0_90,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
i_0_65 ).
cnf(c_0_91,plain,
~ left_convergent_lines(X1,X2),
i_0_33 ).
cnf(c_0_92,plain,
( unequally_directed_lines(X1,X2)
| ~ equally_directed_lines(X1,reverse_line(X2)) ),
inference(spm,[status(thm)],[c_0_84,c_0_83]) ).
cnf(c_0_93,plain,
equally_directed_lines(line_connecting(esk2_0,esk3_0),reverse_line(line_connecting(esk3_0,esk2_0))),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_94,plain,
( unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(X3,X1)
| ~ equally_directed_lines(X3,X2) ),
inference(spm,[status(thm)],[c_0_84,c_0_87]) ).
cnf(c_0_95,negated_conjecture,
equally_directed_lines(esk1_0,line_connecting(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_96,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_90,c_0_91]),c_0_91]) ).
cnf(c_0_97,plain,
unequally_directed_lines(line_connecting(esk2_0,esk3_0),line_connecting(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_98,negated_conjecture,
( unequally_directed_lines(reverse_line(X1),line_connecting(esk3_0,esk2_0))
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_99,plain,
~ unequally_directed_lines(line_connecting(esk2_0,esk3_0),reverse_line(line_connecting(esk3_0,esk2_0))),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_100,plain,
( unequally_directed_lines(esk1_0,X1)
| ~ unequally_directed_lines(reverse_line(X1),reverse_line(line_connecting(esk3_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_96,c_0_98]) ).
cnf(c_0_101,plain,
( unequally_directed_lines(reverse_line(X1),reverse_line(line_connecting(esk3_0,esk2_0)))
| unequally_directed_lines(line_connecting(esk2_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_87]) ).
cnf(c_0_102,plain,
( unequally_directed_lines(line_connecting(esk2_0,esk3_0),X1)
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_103,plain,
( unequally_directed_lines(esk1_0,X1)
| ~ equally_directed_lines(line_connecting(esk2_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_102]) ).
cnf(c_0_104,plain,
equally_directed_lines(X1,X1),
i_0_52 ).
cnf(c_0_105,plain,
unequally_directed_lines(esk1_0,line_connecting(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_106,negated_conjecture,
equally_directed_lines(esk1_0,line_connecting(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_88,c_0_81]) ).
cnf(c_0_107,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_105]),c_0_106])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO255+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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 14:41:20 EDT 2022
% 0.13/0.34 % 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
% 7.31/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.31/2.39 # No SInE strategy applied
% 7.31/2.39 # Trying AutoSched0 for 150 seconds
% 7.31/2.39 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.31/2.39 # and selection function SelectCQPrecWNTNp.
% 7.31/2.39 #
% 7.31/2.39 # Preprocessing time : 0.013 s
% 7.31/2.39
% 7.31/2.39 # Proof found!
% 7.31/2.39 # SZS status Theorem
% 7.31/2.39 # SZS output start CNFRefutation
% See solution above
% 7.31/2.39 # Training examples: 0 positive, 0 negative
% 7.31/2.39
% 7.31/2.39 # -------------------------------------------------
% 7.31/2.39 # User time : 0.018 s
% 7.31/2.39 # System time : 0.004 s
% 7.31/2.39 # Total time : 0.022 s
% 7.31/2.39 # Maximum resident set size: 7124 pages
% 7.31/2.39
%------------------------------------------------------------------------------