TSTP Solution File: GEO255+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO255+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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.32s 2.41s
% Output : CNFRefutation 7.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 44 ( 20 unt; 17 nHn; 33 RR)
% Number of literals : 95 ( 0 equ; 35 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_44,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2))
| ~ line(X2)
| ~ line(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_44) ).
cnf(i_0_20,negated_conjecture,
line(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_20) ).
cnf(i_0_10,plain,
( left_apart_point(X1,X2)
| left_apart_point(X3,X2)
| before_on_line(X2,X3,X1)
| left_apart_point(X1,reverse_line(X2))
| left_apart_point(X3,reverse_line(X2))
| unequally_directed_lines(X2,line_connecting(X3,X1))
| ~ distinct_points(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_10) ).
cnf(i_0_31,plain,
~ left_apart_point(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_31) ).
cnf(i_0_38,plain,
~ unequally_directed_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_38) ).
cnf(i_0_39,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X3,X2)
| ~ unequally_directed_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_39) ).
cnf(i_0_16,plain,
( distinct_points(X1,X2)
| ~ before_on_line(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_16) ).
cnf(i_0_17,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_17) ).
cnf(i_0_45,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-d0i_w_o2/input.p',i_0_45) ).
cnf(i_0_33,plain,
~ left_convergent_lines(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_33) ).
cnf(i_0_19,negated_conjecture,
distinct_points(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_19) ).
cnf(i_0_11,plain,
( ~ before_on_line(X1,X2,X3)
| ~ unequally_directed_lines(X1,line_connecting(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_11) ).
cnf(i_0_57,plain,
~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_57) ).
cnf(i_0_18,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0i_w_o2/input.p',i_0_18) ).
cnf(c_0_72,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2))
| ~ line(X2)
| ~ line(X1) ),
i_0_44 ).
cnf(c_0_73,negated_conjecture,
line(esk1_0),
i_0_20 ).
cnf(c_0_74,plain,
( left_apart_point(X1,X2)
| left_apart_point(X3,X2)
| before_on_line(X2,X3,X1)
| left_apart_point(X1,reverse_line(X2))
| left_apart_point(X3,reverse_line(X2))
| unequally_directed_lines(X2,line_connecting(X3,X1))
| ~ distinct_points(X3,X1) ),
i_0_10 ).
cnf(c_0_75,plain,
~ left_apart_point(X1,X2),
i_0_31 ).
cnf(c_0_76,negated_conjecture,
( unequally_directed_lines(X1,reverse_line(esk1_0))
| unequally_directed_lines(X1,esk1_0)
| ~ line(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,plain,
~ unequally_directed_lines(X1,X1),
i_0_38 ).
cnf(c_0_78,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X3,X2)
| ~ unequally_directed_lines(X3,X1) ),
i_0_39 ).
cnf(c_0_79,plain,
( unequally_directed_lines(X1,line_connecting(X2,X3))
| before_on_line(X1,X2,X3)
| ~ distinct_points(X2,X3) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_74,c_0_75]),c_0_75]),c_0_75]),c_0_75]) ).
cnf(c_0_80,plain,
( distinct_points(X1,X2)
| ~ before_on_line(X3,X1,X2) ),
i_0_16 ).
cnf(c_0_81,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk2_0),
i_0_17 ).
cnf(c_0_82,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_73]),c_0_77]) ).
cnf(c_0_83,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_45 ).
cnf(c_0_84,plain,
~ left_convergent_lines(X1,X2),
i_0_33 ).
cnf(c_0_85,plain,
( unequally_directed_lines(line_connecting(X1,X2),X3)
| unequally_directed_lines(X4,X3)
| before_on_line(X4,X1,X2)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_86,negated_conjecture,
distinct_points(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_87,negated_conjecture,
distinct_points(esk2_0,esk3_0),
i_0_19 ).
cnf(c_0_88,plain,
( ~ before_on_line(X1,X2,X3)
| ~ unequally_directed_lines(X1,line_connecting(X2,X3)) ),
i_0_11 ).
cnf(c_0_89,plain,
( unequally_directed_lines(reverse_line(esk1_0),X1)
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_82]) ).
cnf(c_0_90,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_83,c_0_84]),c_0_84]) ).
cnf(c_0_91,negated_conjecture,
( unequally_directed_lines(line_connecting(esk3_0,esk2_0),X1)
| unequally_directed_lines(X2,X1)
| before_on_line(X2,esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_92,negated_conjecture,
( unequally_directed_lines(line_connecting(esk2_0,esk3_0),X1)
| unequally_directed_lines(X2,X1)
| before_on_line(X2,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_85,c_0_87]) ).
cnf(c_0_93,plain,
( unequally_directed_lines(esk1_0,line_connecting(X1,X2))
| ~ before_on_line(reverse_line(esk1_0),X1,X2) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_94,plain,
( unequally_directed_lines(line_connecting(esk3_0,esk2_0),reverse_line(X1))
| before_on_line(X2,esk3_0,esk2_0)
| ~ unequally_directed_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_95,plain,
( unequally_directed_lines(X1,line_connecting(esk2_0,esk3_0))
| before_on_line(X1,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_77,c_0_92]) ).
cnf(c_0_96,plain,
~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
i_0_57 ).
cnf(c_0_97,plain,
( ~ before_on_line(reverse_line(esk1_0),X1,X2)
| ~ before_on_line(esk1_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_88,c_0_93]) ).
cnf(c_0_98,plain,
( before_on_line(X1,esk2_0,esk3_0)
| before_on_line(X1,esk3_0,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]) ).
cnf(c_0_99,plain,
before_on_line(reverse_line(esk1_0),esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_81])]) ).
cnf(c_0_100,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
i_0_18 ).
cnf(c_0_101,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_99]),c_0_100])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO255+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n025.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 16:13:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.32/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.32/2.41 # Version: 2.1pre011
% 7.32/2.41 # Preprocessing time : 0.011 s
% 7.32/2.41
% 7.32/2.41 # Proof found!
% 7.32/2.41 # SZS status Theorem
% 7.32/2.41 # SZS output start CNFRefutation
% See solution above
% 7.32/2.41 # Proof object total steps : 44
% 7.32/2.41 # Proof object clause steps : 30
% 7.32/2.41 # Proof object formula steps : 14
% 7.32/2.41 # Proof object conjectures : 13
% 7.32/2.41 # Proof object clause conjectures : 9
% 7.32/2.41 # Proof object formula conjectures : 4
% 7.32/2.41 # Proof object initial clauses used : 14
% 7.32/2.41 # Proof object initial formulas used : 14
% 7.32/2.41 # Proof object generating inferences : 14
% 7.32/2.41 # Proof object simplifying inferences : 12
% 7.32/2.41 # Training examples: 0 positive, 0 negative
% 7.32/2.41 # Parsed axioms : 62
% 7.32/2.41 # Removed by relevancy pruning/SinE : 0
% 7.32/2.41 # Initial clauses : 62
% 7.32/2.41 # Removed in clause preprocessing : 0
% 7.32/2.41 # Initial clauses in saturation : 62
% 7.32/2.41 # Processed clauses : 253
% 7.32/2.41 # ...of these trivial : 4
% 7.32/2.41 # ...subsumed : 104
% 7.32/2.41 # ...remaining for further processing : 145
% 7.32/2.41 # Other redundant clauses eliminated : 0
% 7.32/2.41 # Clauses deleted for lack of memory : 0
% 7.32/2.41 # Backward-subsumed : 8
% 7.32/2.41 # Backward-rewritten : 0
% 7.32/2.41 # Generated clauses : 965
% 7.32/2.41 # ...of the previous two non-trivial : 827
% 7.32/2.41 # Contextual simplify-reflections : 35
% 7.32/2.41 # Paramodulations : 797
% 7.32/2.41 # Factorizations : 168
% 7.32/2.41 # Equation resolutions : 0
% 7.32/2.41 # Propositional unsat checks : 0
% 7.32/2.41 # Propositional unsat check successes : 0
% 7.32/2.41 # Current number of processed clauses : 137
% 7.32/2.41 # Positive orientable unit clauses : 13
% 7.32/2.41 # Positive unorientable unit clauses: 0
% 7.32/2.41 # Negative unit clauses : 11
% 7.32/2.41 # Non-unit-clauses : 113
% 7.32/2.41 # Current number of unprocessed clauses: 630
% 7.32/2.41 # ...number of literals in the above : 3475
% 7.32/2.41 # Current number of archived formulas : 0
% 7.32/2.41 # Current number of archived clauses : 8
% 7.32/2.41 # Clause-clause subsumption calls (NU) : 4156
% 7.32/2.41 # Rec. Clause-clause subsumption calls : 2067
% 7.32/2.41 # Non-unit clause-clause subsumptions : 127
% 7.32/2.41 # Unit Clause-clause subsumption calls : 175
% 7.32/2.41 # Rewrite failures with RHS unbound : 0
% 7.32/2.41 # BW rewrite match attempts : 2
% 7.32/2.41 # BW rewrite match successes : 1
% 7.32/2.41 # Condensation attempts : 0
% 7.32/2.41 # Condensation successes : 0
% 7.32/2.41 # Termbank termtop insertions : 14000
% 7.32/2.41
% 7.32/2.41 # -------------------------------------------------
% 7.32/2.41 # User time : 0.023 s
% 7.32/2.41 # System time : 0.004 s
% 7.32/2.41 # Total time : 0.027 s
% 7.32/2.41 # ...preprocessing : 0.011 s
% 7.32/2.41 # ...main loop : 0.016 s
% 7.32/2.41 # Maximum resident set size: 7124 pages
% 7.32/2.41
%------------------------------------------------------------------------------