TSTP Solution File: SWC011+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC011+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:02 EDT 2022
% Result : Theorem 7.80s 2.37s
% Output : CNFRefutation 7.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 12 unt; 0 nHn; 25 RR)
% Number of literals : 49 ( 16 equ; 27 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_201,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,cons(X3,nil)),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b6llrwbe/input.p',i_0_201) ).
cnf(i_0_205,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b6llrwbe/input.p',i_0_205) ).
cnf(i_0_206,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b6llrwbe/input.p',i_0_206) ).
cnf(i_0_204,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b6llrwbe/input.p',i_0_204) ).
cnf(i_0_193,negated_conjecture,
( app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b6llrwbe/input.p',i_0_193) ).
cnf(i_0_191,negated_conjecture,
( app(esk53_0,esk54_0) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b6llrwbe/input.p',i_0_191) ).
cnf(i_0_199,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b6llrwbe/input.p',i_0_199) ).
cnf(i_0_195,negated_conjecture,
( ssList(esk54_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b6llrwbe/input.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b6llrwbe/input.p',i_0_197) ).
cnf(c_0_216,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,cons(X3,nil)),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ neq(esk51_0,nil) ),
i_0_201 ).
cnf(c_0_217,negated_conjecture,
esk50_0 = esk48_0,
i_0_205 ).
cnf(c_0_218,negated_conjecture,
esk49_0 = esk51_0,
i_0_206 ).
cnf(c_0_219,negated_conjecture,
neq(esk49_0,nil),
i_0_204 ).
cnf(c_0_220,negated_conjecture,
( app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_221,negated_conjecture,
( app(esk53_0,esk54_0) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_222,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_199 ).
cnf(c_0_223,negated_conjecture,
( ssList(esk54_0)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_224,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_225,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk49_0
| app(X1,X3) != esk50_0
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_217]),c_0_218]),c_0_219])]) ).
cnf(c_0_226,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_218]),c_0_218]),c_0_219])]) ).
cnf(c_0_227,negated_conjecture,
app(esk53_0,esk54_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_218]),c_0_219])]) ).
cnf(c_0_228,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_218]),c_0_219])]) ).
cnf(c_0_229,negated_conjecture,
ssList(esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_218]),c_0_219])]) ).
cnf(c_0_230,negated_conjecture,
ssList(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_218]),c_0_219])]) ).
cnf(c_0_231,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_225,c_0_226]),c_0_227]),c_0_228]),c_0_229]),c_0_230])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC011+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 : n005.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 11 21:37:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.80/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.80/2.37 # Version: 2.1pre011
% 7.80/2.37 # Preprocessing time : 0.021 s
% 7.80/2.37
% 7.80/2.37 # Proof found!
% 7.80/2.37 # SZS status Theorem
% 7.80/2.37 # SZS output start CNFRefutation
% See solution above
% 7.80/2.37 # Proof object total steps : 25
% 7.80/2.37 # Proof object clause steps : 16
% 7.80/2.37 # Proof object formula steps : 9
% 7.80/2.37 # Proof object conjectures : 25
% 7.80/2.37 # Proof object clause conjectures : 16
% 7.80/2.37 # Proof object formula conjectures : 9
% 7.80/2.37 # Proof object initial clauses used : 9
% 7.80/2.37 # Proof object initial formulas used : 9
% 7.80/2.37 # Proof object generating inferences : 1
% 7.80/2.37 # Proof object simplifying inferences : 25
% 7.80/2.37 # Training examples: 0 positive, 0 negative
% 7.80/2.37 # Parsed axioms : 208
% 7.80/2.37 # Removed by relevancy pruning/SinE : 0
% 7.80/2.37 # Initial clauses : 208
% 7.80/2.37 # Removed in clause preprocessing : 0
% 7.80/2.37 # Initial clauses in saturation : 208
% 7.80/2.37 # Processed clauses : 64
% 7.80/2.37 # ...of these trivial : 8
% 7.80/2.37 # ...subsumed : 0
% 7.80/2.37 # ...remaining for further processing : 56
% 7.80/2.37 # Other redundant clauses eliminated : 2
% 7.80/2.37 # Clauses deleted for lack of memory : 0
% 7.80/2.37 # Backward-subsumed : 0
% 7.80/2.37 # Backward-rewritten : 0
% 7.80/2.37 # Generated clauses : 9
% 7.80/2.37 # ...of the previous two non-trivial : 8
% 7.80/2.37 # Contextual simplify-reflections : 0
% 7.80/2.37 # Paramodulations : 7
% 7.80/2.37 # Factorizations : 0
% 7.80/2.37 # Equation resolutions : 2
% 7.80/2.37 # Propositional unsat checks : 0
% 7.80/2.37 # Propositional unsat check successes : 0
% 7.80/2.37 # Current number of processed clauses : 54
% 7.80/2.37 # Positive orientable unit clauses : 20
% 7.80/2.37 # Positive unorientable unit clauses: 0
% 7.80/2.37 # Negative unit clauses : 2
% 7.80/2.37 # Non-unit-clauses : 32
% 7.80/2.37 # Current number of unprocessed clauses: 152
% 7.80/2.37 # ...number of literals in the above : 629
% 7.80/2.37 # Current number of archived formulas : 0
% 7.80/2.37 # Current number of archived clauses : 0
% 7.80/2.37 # Clause-clause subsumption calls (NU) : 160
% 7.80/2.37 # Rec. Clause-clause subsumption calls : 116
% 7.80/2.37 # Non-unit clause-clause subsumptions : 0
% 7.80/2.37 # Unit Clause-clause subsumption calls : 0
% 7.80/2.37 # Rewrite failures with RHS unbound : 0
% 7.80/2.37 # BW rewrite match attempts : 0
% 7.80/2.37 # BW rewrite match successes : 0
% 7.80/2.37 # Condensation attempts : 0
% 7.80/2.37 # Condensation successes : 0
% 7.80/2.37 # Termbank termtop insertions : 4969
% 7.80/2.37
% 7.80/2.37 # -------------------------------------------------
% 7.80/2.37 # User time : 0.020 s
% 7.80/2.37 # System time : 0.004 s
% 7.80/2.37 # Total time : 0.023 s
% 7.80/2.37 # ...preprocessing : 0.021 s
% 7.80/2.37 # ...main loop : 0.002 s
% 7.80/2.37 # Maximum resident set size: 7128 pages
% 7.80/2.37
%------------------------------------------------------------------------------