TSTP Solution File: GEO178+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO178+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:59 EDT 2022
% Result : Theorem 4.50s 2.25s
% Output : CNFRefutation 4.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 13 RR)
% Number of literals : 23 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0wsvqls3/input.p',i_0_10) ).
cnf(i_0_15,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0wsvqls3/input.p',i_0_15) ).
cnf(i_0_16,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0wsvqls3/input.p',i_0_16) ).
cnf(i_0_14,negated_conjecture,
( ~ distinct_points(esk3_0,esk1_0)
| ~ distinct_points(esk3_0,esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0wsvqls3/input.p',i_0_14) ).
cnf(i_0_11,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0wsvqls3/input.p',i_0_11) ).
cnf(c_0_22,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
i_0_10 ).
cnf(c_0_23,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
i_0_15 ).
cnf(c_0_24,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_25,negated_conjecture,
( ~ distinct_points(esk3_0,esk1_0)
| ~ distinct_points(esk3_0,esk2_0) ),
i_0_14 ).
cnf(c_0_26,negated_conjecture,
distinct_points(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
i_0_11 ).
cnf(c_0_28,negated_conjecture,
~ distinct_points(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_24])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GEO178+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jun 18 10:37:30 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.50/2.25 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 4.50/2.25 # Version: 2.1pre011
% 4.50/2.25 # Preprocessing time : 0.017 s
% 4.50/2.25
% 4.50/2.25 # Proof found!
% 4.50/2.25 # SZS status Theorem
% 4.50/2.25 # SZS output start CNFRefutation
% See solution above
% 4.50/2.25 # Proof object total steps : 13
% 4.50/2.25 # Proof object clause steps : 8
% 4.50/2.25 # Proof object formula steps : 5
% 4.50/2.25 # Proof object conjectures : 9
% 4.50/2.25 # Proof object clause conjectures : 6
% 4.50/2.25 # Proof object formula conjectures : 3
% 4.50/2.25 # Proof object initial clauses used : 5
% 4.50/2.25 # Proof object initial formulas used : 5
% 4.50/2.25 # Proof object generating inferences : 2
% 4.50/2.25 # Proof object simplifying inferences : 7
% 4.50/2.25 # Training examples: 0 positive, 0 negative
% 4.50/2.25 # Parsed axioms : 17
% 4.50/2.25 # Removed by relevancy pruning/SinE : 0
% 4.50/2.25 # Initial clauses : 17
% 4.50/2.25 # Removed in clause preprocessing : 0
% 4.50/2.25 # Initial clauses in saturation : 17
% 4.50/2.25 # Processed clauses : 22
% 4.50/2.25 # ...of these trivial : 0
% 4.50/2.25 # ...subsumed : 0
% 4.50/2.25 # ...remaining for further processing : 21
% 4.50/2.25 # Other redundant clauses eliminated : 0
% 4.50/2.25 # Clauses deleted for lack of memory : 0
% 4.50/2.25 # Backward-subsumed : 0
% 4.50/2.25 # Backward-rewritten : 1
% 4.50/2.25 # Generated clauses : 10
% 4.50/2.25 # ...of the previous two non-trivial : 11
% 4.50/2.25 # Contextual simplify-reflections : 0
% 4.50/2.25 # Paramodulations : 10
% 4.50/2.25 # Factorizations : 0
% 4.50/2.25 # Equation resolutions : 0
% 4.50/2.25 # Propositional unsat checks : 0
% 4.50/2.25 # Propositional unsat check successes : 0
% 4.50/2.25 # Current number of processed clauses : 20
% 4.50/2.25 # Positive orientable unit clauses : 3
% 4.50/2.25 # Positive unorientable unit clauses: 0
% 4.50/2.25 # Negative unit clauses : 4
% 4.50/2.25 # Non-unit-clauses : 13
% 4.50/2.25 # Current number of unprocessed clauses: 6
% 4.50/2.25 # ...number of literals in the above : 16
% 4.50/2.25 # Current number of archived formulas : 0
% 4.50/2.25 # Current number of archived clauses : 1
% 4.50/2.25 # Clause-clause subsumption calls (NU) : 10
% 4.50/2.25 # Rec. Clause-clause subsumption calls : 10
% 4.50/2.25 # Non-unit clause-clause subsumptions : 0
% 4.50/2.25 # Unit Clause-clause subsumption calls : 1
% 4.50/2.25 # Rewrite failures with RHS unbound : 0
% 4.50/2.25 # BW rewrite match attempts : 1
% 4.50/2.25 # BW rewrite match successes : 1
% 4.50/2.25 # Condensation attempts : 0
% 4.50/2.25 # Condensation successes : 0
% 4.50/2.25 # Termbank termtop insertions : 470
% 4.50/2.25
% 4.50/2.25 # -------------------------------------------------
% 4.50/2.25 # User time : 0.015 s
% 4.50/2.25 # System time : 0.003 s
% 4.50/2.25 # Total time : 0.018 s
% 4.50/2.25 # ...preprocessing : 0.017 s
% 4.50/2.25 # ...main loop : 0.001 s
% 4.50/2.25 # Maximum resident set size: 7132 pages
% 4.50/2.25
%------------------------------------------------------------------------------