TSTP Solution File: SWC258+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC258+1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 20:14:35 EDT 2022
% Result : Theorem 7.79s 2.36s
% Output : CNFRefutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 9 unt; 4 nHn; 15 RR)
% Number of literals : 21 ( 9 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_199,negated_conjecture,
~ totalorderedP(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gih1fm00/input.p',i_0_199) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gih1fm00/input.p',i_0_200) ).
cnf(i_0_121,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gih1fm00/input.p',i_0_121) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| cons(esk52_0,nil) = esk50_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gih1fm00/input.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
( esk50_0 = nil
| ssItem(esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gih1fm00/input.p',i_0_197) ).
cnf(i_0_122,plain,
totalorderedP(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gih1fm00/input.p',i_0_122) ).
cnf(c_0_207,negated_conjecture,
~ totalorderedP(esk48_0),
i_0_199 ).
cnf(c_0_208,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_209,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_121 ).
cnf(c_0_210,negated_conjecture,
( esk50_0 = nil
| cons(esk52_0,nil) = esk50_0 ),
i_0_195 ).
cnf(c_0_211,negated_conjecture,
~ totalorderedP(esk50_0),
inference(rw,[status(thm)],[c_0_207,c_0_208]) ).
cnf(c_0_212,negated_conjecture,
( esk50_0 = nil
| ssItem(esk52_0) ),
i_0_197 ).
cnf(c_0_213,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_209,c_0_210]),c_0_211]),c_0_212]) ).
cnf(c_0_214,plain,
totalorderedP(nil),
i_0_122 ).
cnf(c_0_215,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_211,c_0_213]),c_0_214])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC258+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 : Sun Jun 12 11:00:37 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.79/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.79/2.36 # Version: 2.1pre011
% 7.79/2.36 # Preprocessing time : 0.014 s
% 7.79/2.36
% 7.79/2.36 # Proof found!
% 7.79/2.36 # SZS status Theorem
% 7.79/2.36 # SZS output start CNFRefutation
% See solution above
% 7.79/2.36 # Proof object total steps : 15
% 7.79/2.36 # Proof object clause steps : 9
% 7.79/2.36 # Proof object formula steps : 6
% 7.79/2.36 # Proof object conjectures : 11
% 7.79/2.36 # Proof object clause conjectures : 7
% 7.79/2.36 # Proof object formula conjectures : 4
% 7.79/2.36 # Proof object initial clauses used : 6
% 7.79/2.36 # Proof object initial formulas used : 6
% 7.79/2.36 # Proof object generating inferences : 1
% 7.79/2.36 # Proof object simplifying inferences : 6
% 7.79/2.36 # Training examples: 0 positive, 0 negative
% 7.79/2.36 # Parsed axioms : 203
% 7.79/2.36 # Removed by relevancy pruning/SinE : 0
% 7.79/2.36 # Initial clauses : 203
% 7.79/2.36 # Removed in clause preprocessing : 0
% 7.79/2.36 # Initial clauses in saturation : 203
% 7.79/2.36 # Processed clauses : 212
% 7.79/2.36 # ...of these trivial : 2
% 7.79/2.36 # ...subsumed : 4
% 7.79/2.36 # ...remaining for further processing : 206
% 7.79/2.36 # Other redundant clauses eliminated : 82
% 7.79/2.36 # Clauses deleted for lack of memory : 0
% 7.79/2.36 # Backward-subsumed : 0
% 7.79/2.36 # Backward-rewritten : 12
% 7.79/2.36 # Generated clauses : 901
% 7.79/2.36 # ...of the previous two non-trivial : 749
% 7.79/2.36 # Contextual simplify-reflections : 7
% 7.79/2.36 # Paramodulations : 802
% 7.79/2.36 # Factorizations : 0
% 7.79/2.36 # Equation resolutions : 99
% 7.79/2.36 # Propositional unsat checks : 0
% 7.79/2.36 # Propositional unsat check successes : 0
% 7.79/2.36 # Current number of processed clauses : 188
% 7.79/2.36 # Positive orientable unit clauses : 13
% 7.79/2.36 # Positive unorientable unit clauses: 0
% 7.79/2.36 # Negative unit clauses : 2
% 7.79/2.36 # Non-unit-clauses : 173
% 7.79/2.36 # Current number of unprocessed clauses: 667
% 7.79/2.36 # ...number of literals in the above : 5051
% 7.79/2.36 # Current number of archived formulas : 0
% 7.79/2.36 # Current number of archived clauses : 12
% 7.79/2.36 # Clause-clause subsumption calls (NU) : 5495
% 7.79/2.36 # Rec. Clause-clause subsumption calls : 1350
% 7.79/2.36 # Non-unit clause-clause subsumptions : 11
% 7.79/2.36 # Unit Clause-clause subsumption calls : 188
% 7.79/2.36 # Rewrite failures with RHS unbound : 0
% 7.79/2.36 # BW rewrite match attempts : 2
% 7.79/2.36 # BW rewrite match successes : 2
% 7.79/2.36 # Condensation attempts : 0
% 7.79/2.36 # Condensation successes : 0
% 7.79/2.36 # Termbank termtop insertions : 23365
% 7.79/2.36
% 7.79/2.36 # -------------------------------------------------
% 7.79/2.36 # User time : 0.029 s
% 7.79/2.36 # System time : 0.005 s
% 7.79/2.36 # Total time : 0.034 s
% 7.79/2.36 # ...preprocessing : 0.014 s
% 7.79/2.36 # ...main loop : 0.020 s
% 7.79/2.36 # Maximum resident set size: 7136 pages
% 7.79/2.36
%------------------------------------------------------------------------------