TSTP Solution File: SWC006+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC006+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:13:00 EDT 2022
% Result : Theorem 7.77s 2.45s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 15 unt; 0 nHn; 18 RR)
% Number of literals : 30 ( 14 equ; 15 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_196,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-umqt6eq6/input.p',i_0_196) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-umqt6eq6/input.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-umqt6eq6/input.p',i_0_198) ).
cnf(i_0_192,negated_conjecture,
app(app(esk52_0,esk53_0),esk54_0) = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-umqt6eq6/input.p',i_0_192) ).
cnf(i_0_191,negated_conjecture,
app(esk52_0,esk54_0) = esk50_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-umqt6eq6/input.p',i_0_191) ).
cnf(i_0_194,negated_conjecture,
ssList(esk53_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-umqt6eq6/input.p',i_0_194) ).
cnf(i_0_193,negated_conjecture,
ssList(esk54_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-umqt6eq6/input.p',i_0_193) ).
cnf(i_0_195,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-umqt6eq6/input.p',i_0_195) ).
cnf(c_0_207,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
i_0_196 ).
cnf(c_0_208,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_209,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_210,negated_conjecture,
( app(app(X1,X2),X3) != esk51_0
| app(X1,X3) != esk50_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_207,c_0_208]),c_0_209]) ).
cnf(c_0_211,negated_conjecture,
app(app(esk52_0,esk53_0),esk54_0) = esk51_0,
i_0_192 ).
cnf(c_0_212,negated_conjecture,
app(esk52_0,esk54_0) = esk50_0,
i_0_191 ).
cnf(c_0_213,negated_conjecture,
ssList(esk53_0),
i_0_194 ).
cnf(c_0_214,negated_conjecture,
ssList(esk54_0),
i_0_193 ).
cnf(c_0_215,negated_conjecture,
ssList(esk52_0),
i_0_195 ).
cnf(c_0_216,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_211]),c_0_212]),c_0_213]),c_0_214]),c_0_215])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC006+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n005.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 : Sun Jun 12 19:29:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.77/2.45 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.77/2.45 # Version: 2.1pre011
% 7.77/2.45 # Preprocessing time : 0.015 s
% 7.77/2.45
% 7.77/2.45 # Proof found!
% 7.77/2.45 # SZS status Theorem
% 7.77/2.45 # SZS output start CNFRefutation
% See solution above
% 7.77/2.45 # Proof object total steps : 18
% 7.77/2.45 # Proof object clause steps : 10
% 7.77/2.45 # Proof object formula steps : 8
% 7.77/2.45 # Proof object conjectures : 18
% 7.77/2.45 # Proof object clause conjectures : 10
% 7.77/2.45 # Proof object formula conjectures : 8
% 7.77/2.45 # Proof object initial clauses used : 8
% 7.77/2.45 # Proof object initial formulas used : 8
% 7.77/2.45 # Proof object generating inferences : 1
% 7.77/2.45 # Proof object simplifying inferences : 7
% 7.77/2.45 # Training examples: 0 positive, 0 negative
% 7.77/2.45 # Parsed axioms : 200
% 7.77/2.45 # Removed by relevancy pruning/SinE : 0
% 7.77/2.45 # Initial clauses : 200
% 7.77/2.45 # Removed in clause preprocessing : 0
% 7.77/2.45 # Initial clauses in saturation : 200
% 7.77/2.45 # Processed clauses : 25
% 7.77/2.45 # ...of these trivial : 2
% 7.77/2.45 # ...subsumed : 0
% 7.77/2.45 # ...remaining for further processing : 23
% 7.77/2.45 # Other redundant clauses eliminated : 0
% 7.77/2.45 # Clauses deleted for lack of memory : 0
% 7.77/2.45 # Backward-subsumed : 0
% 7.77/2.45 # Backward-rewritten : 0
% 7.77/2.45 # Generated clauses : 3
% 7.77/2.45 # ...of the previous two non-trivial : 2
% 7.77/2.45 # Contextual simplify-reflections : 0
% 7.77/2.45 # Paramodulations : 3
% 7.77/2.45 # Factorizations : 0
% 7.77/2.45 # Equation resolutions : 0
% 7.77/2.45 # Propositional unsat checks : 0
% 7.77/2.45 # Propositional unsat check successes : 0
% 7.77/2.45 # Current number of processed clauses : 23
% 7.77/2.45 # Positive orientable unit clauses : 17
% 7.77/2.45 # Positive unorientable unit clauses: 0
% 7.77/2.45 # Negative unit clauses : 2
% 7.77/2.45 # Non-unit-clauses : 4
% 7.77/2.45 # Current number of unprocessed clauses: 175
% 7.77/2.45 # ...number of literals in the above : 688
% 7.77/2.45 # Current number of archived formulas : 0
% 7.77/2.45 # Current number of archived clauses : 0
% 7.77/2.45 # Clause-clause subsumption calls (NU) : 8
% 7.77/2.45 # Rec. Clause-clause subsumption calls : 2
% 7.77/2.45 # Non-unit clause-clause subsumptions : 0
% 7.77/2.45 # Unit Clause-clause subsumption calls : 0
% 7.77/2.45 # Rewrite failures with RHS unbound : 0
% 7.77/2.45 # BW rewrite match attempts : 0
% 7.77/2.45 # BW rewrite match successes : 0
% 7.77/2.45 # Condensation attempts : 0
% 7.77/2.45 # Condensation successes : 0
% 7.77/2.45 # Termbank termtop insertions : 4409
% 7.77/2.45
% 7.77/2.45 # -------------------------------------------------
% 7.77/2.45 # User time : 0.011 s
% 7.77/2.45 # System time : 0.005 s
% 7.77/2.45 # Total time : 0.016 s
% 7.77/2.45 # ...preprocessing : 0.015 s
% 7.77/2.45 # ...main loop : 0.001 s
% 7.77/2.45 # Maximum resident set size: 7132 pages
% 7.77/2.45
%------------------------------------------------------------------------------