TSTP Solution File: GEO182+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO182+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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 7.18s 2.38s
% Output : CNFRefutation 7.18s
% 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_18,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtlgzwad/input.p',i_0_18) ).
cnf(i_0_27,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtlgzwad/input.p',i_0_27) ).
cnf(i_0_36,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-rtlgzwad/input.p',i_0_36) ).
cnf(i_0_28,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtlgzwad/input.p',i_0_28) ).
cnf(i_0_26,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtlgzwad/input.p',i_0_26) ).
cnf(i_0_10,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtlgzwad/input.p',i_0_10) ).
cnf(i_0_20,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtlgzwad/input.p',i_0_20) ).
cnf(i_0_7,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtlgzwad/input.p',i_0_7) ).
cnf(i_0_21,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtlgzwad/input.p',i_0_21) ).
cnf(c_0_46,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
i_0_18 ).
cnf(c_0_47,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
i_0_27 ).
cnf(c_0_48,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_36 ).
cnf(c_0_49,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk2_0),X1)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,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(X1,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_28 ).
cnf(c_0_52,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)),
i_0_26 ).
cnf(c_0_53,negated_conjecture,
( 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_50,c_0_51]) ).
cnf(c_0_54,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
i_0_10 ).
cnf(c_0_55,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
i_0_20 ).
cnf(c_0_56,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_52,c_0_53]) ).
cnf(c_0_57,plain,
~ distinct_points(X1,X1),
i_0_7 ).
cnf(c_0_58,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_51]) ).
cnf(c_0_59,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
i_0_21 ).
cnf(c_0_60,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_55,c_0_56]),c_0_51])]) ).
cnf(c_0_61,plain,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,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_59,c_0_60]),c_0_61])]) ).
cnf(c_0_63,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_59,c_0_62]),c_0_51])]) ).
cnf(c_0_64,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_63]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GEO182+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 03:39:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.18/2.38 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.18/2.38 # Version: 2.1pre011
% 7.18/2.38 # Preprocessing time : 0.014 s
% 7.18/2.38
% 7.18/2.38 # Proof found!
% 7.18/2.38 # SZS status Theorem
% 7.18/2.38 # SZS output start CNFRefutation
% See solution above
% 7.18/2.38 # Proof object total steps : 28
% 7.18/2.38 # Proof object clause steps : 19
% 7.18/2.38 # Proof object formula steps : 9
% 7.18/2.38 # Proof object conjectures : 10
% 7.18/2.38 # Proof object clause conjectures : 7
% 7.18/2.38 # Proof object formula conjectures : 3
% 7.18/2.38 # Proof object initial clauses used : 9
% 7.18/2.38 # Proof object initial formulas used : 9
% 7.18/2.38 # Proof object generating inferences : 10
% 7.18/2.38 # Proof object simplifying inferences : 8
% 7.18/2.38 # Training examples: 0 positive, 0 negative
% 7.18/2.38 # Parsed axioms : 49
% 7.18/2.38 # Removed by relevancy pruning/SinE : 0
% 7.18/2.38 # Initial clauses : 49
% 7.18/2.38 # Removed in clause preprocessing : 0
% 7.18/2.38 # Initial clauses in saturation : 49
% 7.18/2.38 # Processed clauses : 87
% 7.18/2.38 # ...of these trivial : 0
% 7.18/2.38 # ...subsumed : 9
% 7.18/2.38 # ...remaining for further processing : 78
% 7.18/2.38 # Other redundant clauses eliminated : 0
% 7.18/2.38 # Clauses deleted for lack of memory : 0
% 7.18/2.38 # Backward-subsumed : 2
% 7.18/2.38 # Backward-rewritten : 1
% 7.18/2.38 # Generated clauses : 287
% 7.18/2.38 # ...of the previous two non-trivial : 218
% 7.18/2.38 # Contextual simplify-reflections : 4
% 7.18/2.38 # Paramodulations : 257
% 7.18/2.38 # Factorizations : 30
% 7.18/2.38 # Equation resolutions : 0
% 7.18/2.38 # Propositional unsat checks : 0
% 7.18/2.38 # Propositional unsat check successes : 0
% 7.18/2.38 # Current number of processed clauses : 75
% 7.18/2.38 # Positive orientable unit clauses : 9
% 7.18/2.38 # Positive unorientable unit clauses: 0
% 7.18/2.38 # Negative unit clauses : 8
% 7.18/2.38 # Non-unit-clauses : 58
% 7.18/2.38 # Current number of unprocessed clauses: 172
% 7.18/2.38 # ...number of literals in the above : 870
% 7.18/2.38 # Current number of archived formulas : 0
% 7.18/2.38 # Current number of archived clauses : 3
% 7.18/2.38 # Clause-clause subsumption calls (NU) : 589
% 7.18/2.38 # Rec. Clause-clause subsumption calls : 256
% 7.18/2.38 # Non-unit clause-clause subsumptions : 15
% 7.18/2.38 # Unit Clause-clause subsumption calls : 46
% 7.18/2.38 # Rewrite failures with RHS unbound : 0
% 7.18/2.38 # BW rewrite match attempts : 1
% 7.18/2.38 # BW rewrite match successes : 1
% 7.18/2.38 # Condensation attempts : 0
% 7.18/2.38 # Condensation successes : 0
% 7.18/2.38 # Termbank termtop insertions : 4934
% 7.18/2.38
% 7.18/2.38 # -------------------------------------------------
% 7.18/2.38 # User time : 0.011 s
% 7.18/2.38 # System time : 0.007 s
% 7.18/2.38 # Total time : 0.018 s
% 7.18/2.38 # ...preprocessing : 0.014 s
% 7.18/2.38 # ...main loop : 0.005 s
% 7.18/2.38 # Maximum resident set size: 7128 pages
% 7.18/2.38
%------------------------------------------------------------------------------