TSTP Solution File: GEO498+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO498+1 : TPTP v8.1.0. Released v7.0.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:46:00 EDT 2022
% Result : Theorem 7.20s 2.31s
% Output : CNFRefutation 7.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 8 RR)
% Number of literals : 10 ( 9 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_109,plain,
s(X1,s(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4c8l42n/input.p',i_0_109) ).
cnf(i_0_111,negated_conjecture,
s(esk1_0,esk4_0) = esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4c8l42n/input.p',i_0_111) ).
cnf(i_0_112,negated_conjecture,
s(esk1_0,esk2_0) = esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4c8l42n/input.p',i_0_112) ).
cnf(i_0_110,negated_conjecture,
esk4_0 != esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t4c8l42n/input.p',i_0_110) ).
cnf(c_0_117,plain,
s(X1,s(X1,X2)) = X2,
i_0_109 ).
cnf(c_0_118,negated_conjecture,
s(esk1_0,esk4_0) = esk3_0,
i_0_111 ).
cnf(c_0_119,negated_conjecture,
s(esk1_0,esk2_0) = esk3_0,
i_0_112 ).
cnf(c_0_120,negated_conjecture,
s(esk1_0,esk3_0) = esk4_0,
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_121,negated_conjecture,
esk4_0 != esk2_0,
i_0_110 ).
cnf(c_0_122,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_119]),c_0_120]),c_0_121]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GEO498+1 : TPTP v8.1.0. Released v7.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 13:20:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.20/2.31 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.20/2.31 # Version: 2.1pre011
% 7.20/2.31 # Preprocessing time : 0.013 s
% 7.20/2.31
% 7.20/2.31 # Proof found!
% 7.20/2.31 # SZS status Theorem
% 7.20/2.31 # SZS output start CNFRefutation
% See solution above
% 7.20/2.31 # Proof object total steps : 10
% 7.20/2.31 # Proof object clause steps : 6
% 7.20/2.31 # Proof object formula steps : 4
% 7.20/2.31 # Proof object conjectures : 8
% 7.20/2.31 # Proof object clause conjectures : 5
% 7.20/2.31 # Proof object formula conjectures : 3
% 7.20/2.31 # Proof object initial clauses used : 4
% 7.20/2.31 # Proof object initial formulas used : 4
% 7.20/2.31 # Proof object generating inferences : 2
% 7.20/2.31 # Proof object simplifying inferences : 2
% 7.20/2.31 # Training examples: 0 positive, 0 negative
% 7.20/2.31 # Parsed axioms : 150
% 7.20/2.31 # Removed by relevancy pruning/SinE : 0
% 7.20/2.31 # Initial clauses : 150
% 7.20/2.31 # Removed in clause preprocessing : 0
% 7.20/2.31 # Initial clauses in saturation : 150
% 7.20/2.31 # Processed clauses : 156
% 7.20/2.31 # ...of these trivial : 2
% 7.20/2.31 # ...subsumed : 5
% 7.20/2.31 # ...remaining for further processing : 148
% 7.20/2.31 # Other redundant clauses eliminated : 6
% 7.20/2.31 # Clauses deleted for lack of memory : 0
% 7.20/2.31 # Backward-subsumed : 0
% 7.20/2.31 # Backward-rewritten : 1
% 7.20/2.31 # Generated clauses : 399
% 7.20/2.31 # ...of the previous two non-trivial : 305
% 7.20/2.31 # Contextual simplify-reflections : 7
% 7.20/2.31 # Paramodulations : 391
% 7.20/2.31 # Factorizations : 2
% 7.20/2.31 # Equation resolutions : 6
% 7.20/2.31 # Propositional unsat checks : 0
% 7.20/2.31 # Propositional unsat check successes : 0
% 7.20/2.31 # Current number of processed clauses : 141
% 7.20/2.31 # Positive orientable unit clauses : 19
% 7.20/2.31 # Positive unorientable unit clauses: 0
% 7.20/2.31 # Negative unit clauses : 9
% 7.20/2.31 # Non-unit-clauses : 113
% 7.20/2.31 # Current number of unprocessed clauses: 293
% 7.20/2.31 # ...number of literals in the above : 1027
% 7.20/2.31 # Current number of archived formulas : 0
% 7.20/2.31 # Current number of archived clauses : 1
% 7.20/2.31 # Clause-clause subsumption calls (NU) : 3149
% 7.20/2.31 # Rec. Clause-clause subsumption calls : 1543
% 7.20/2.31 # Non-unit clause-clause subsumptions : 12
% 7.20/2.31 # Unit Clause-clause subsumption calls : 243
% 7.20/2.31 # Rewrite failures with RHS unbound : 0
% 7.20/2.31 # BW rewrite match attempts : 55
% 7.20/2.31 # BW rewrite match successes : 1
% 7.20/2.31 # Condensation attempts : 0
% 7.20/2.31 # Condensation successes : 0
% 7.20/2.31 # Termbank termtop insertions : 6733
% 7.20/2.31
% 7.20/2.31 # -------------------------------------------------
% 7.20/2.31 # User time : 0.016 s
% 7.20/2.31 # System time : 0.004 s
% 7.20/2.31 # Total time : 0.020 s
% 7.20/2.31 # ...preprocessing : 0.013 s
% 7.20/2.31 # ...main loop : 0.007 s
% 7.20/2.31 # Maximum resident set size: 7124 pages
% 7.20/2.31
%------------------------------------------------------------------------------