TSTP Solution File: SWC013+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC013+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:03 EDT 2022
% Result : Theorem 7.73s 2.42s
% Output : CNFRefutation 7.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 13 unt; 4 nHn; 32 RR)
% Number of literals : 96 ( 36 equ; 67 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( esk48_0 != X1
| hd(esk49_0) != X2
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk49_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_191) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_198) ).
cnf(i_0_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_196) ).
cnf(i_0_193,negated_conjecture,
( esk50_0 = X1
| hd(esk51_0) != X2
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_193) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_41) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_201) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_44) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_43) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_54) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-du6i9rvk/input.p',i_0_42) ).
cnf(c_0_213,negated_conjecture,
( esk48_0 != X1
| hd(esk49_0) != X2
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk49_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_214,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_215,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_216,negated_conjecture,
neq(esk49_0,nil),
i_0_196 ).
cnf(c_0_217,negated_conjecture,
( esk50_0 = X1
| hd(esk51_0) != X2
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_218,negated_conjecture,
( cons(X1,nil) != X2
| hd(esk49_0) != X1
| esk50_0 != X2
| ~ neq(nil,esk49_0)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_214]),c_0_215]),c_0_216])]) ).
cnf(c_0_219,negated_conjecture,
( cons(X1,nil) != X2
| hd(esk49_0) != X1
| ~ neq(nil,esk49_0)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_215]),c_0_215]),c_0_216]),c_0_215])]),c_0_218]) ).
cnf(c_0_220,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_221,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_222,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_223,plain,
( esk49_0 = nil
| cons(X1,nil) != X2
| hd(esk49_0) != X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221]),c_0_222])]) ).
cnf(c_0_224,plain,
( esk49_0 = nil
| hd(esk49_0) != X1
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_223]) ).
cnf(c_0_225,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_226,plain,
( esk49_0 = nil
| hd(esk49_0) != X1
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_222])]) ).
cnf(c_0_227,plain,
( esk49_0 = nil
| ~ ssItem(hd(esk49_0)) ),
inference(er,[status(thm)],[c_0_226]) ).
cnf(c_0_228,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_229,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_230,plain,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_221])]) ).
cnf(c_0_231,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_229]) ).
cnf(c_0_232,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_216,c_0_230]) ).
cnf(c_0_233,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_222])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC013+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 16:23:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.73/2.42 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.73/2.42 # Version: 2.1pre011
% 7.73/2.42 # Preprocessing time : 0.013 s
% 7.73/2.42
% 7.73/2.42 # Proof found!
% 7.73/2.42 # SZS status Theorem
% 7.73/2.42 # SZS output start CNFRefutation
% See solution above
% 7.73/2.42 # Proof object total steps : 32
% 7.73/2.42 # Proof object clause steps : 21
% 7.73/2.42 # Proof object formula steps : 11
% 7.73/2.42 # Proof object conjectures : 15
% 7.73/2.42 # Proof object clause conjectures : 9
% 7.73/2.42 # Proof object formula conjectures : 6
% 7.73/2.42 # Proof object initial clauses used : 11
% 7.73/2.42 # Proof object initial formulas used : 11
% 7.73/2.42 # Proof object generating inferences : 6
% 7.73/2.42 # Proof object simplifying inferences : 21
% 7.73/2.42 # Training examples: 0 positive, 0 negative
% 7.73/2.42 # Parsed axioms : 200
% 7.73/2.42 # Removed by relevancy pruning/SinE : 0
% 7.73/2.42 # Initial clauses : 200
% 7.73/2.42 # Removed in clause preprocessing : 0
% 7.73/2.42 # Initial clauses in saturation : 200
% 7.73/2.42 # Processed clauses : 231
% 7.73/2.42 # ...of these trivial : 5
% 7.73/2.42 # ...subsumed : 12
% 7.73/2.42 # ...remaining for further processing : 214
% 7.73/2.42 # Other redundant clauses eliminated : 85
% 7.73/2.42 # Clauses deleted for lack of memory : 0
% 7.73/2.42 # Backward-subsumed : 4
% 7.73/2.42 # Backward-rewritten : 6
% 7.73/2.42 # Generated clauses : 875
% 7.73/2.42 # ...of the previous two non-trivial : 718
% 7.73/2.42 # Contextual simplify-reflections : 7
% 7.73/2.42 # Paramodulations : 770
% 7.73/2.42 # Factorizations : 0
% 7.73/2.42 # Equation resolutions : 105
% 7.73/2.42 # Propositional unsat checks : 0
% 7.73/2.42 # Propositional unsat check successes : 0
% 7.73/2.42 # Current number of processed clauses : 198
% 7.73/2.42 # Positive orientable unit clauses : 15
% 7.73/2.42 # Positive unorientable unit clauses: 0
% 7.73/2.42 # Negative unit clauses : 2
% 7.73/2.42 # Non-unit-clauses : 181
% 7.73/2.42 # Current number of unprocessed clauses: 681
% 7.73/2.42 # ...number of literals in the above : 5178
% 7.73/2.42 # Current number of archived formulas : 0
% 7.73/2.42 # Current number of archived clauses : 10
% 7.73/2.42 # Clause-clause subsumption calls (NU) : 8029
% 7.73/2.42 # Rec. Clause-clause subsumption calls : 2025
% 7.73/2.42 # Non-unit clause-clause subsumptions : 23
% 7.73/2.42 # Unit Clause-clause subsumption calls : 95
% 7.73/2.42 # Rewrite failures with RHS unbound : 0
% 7.73/2.42 # BW rewrite match attempts : 1
% 7.73/2.42 # BW rewrite match successes : 1
% 7.73/2.42 # Condensation attempts : 0
% 7.73/2.42 # Condensation successes : 0
% 7.73/2.42 # Termbank termtop insertions : 23007
% 7.73/2.42
% 7.73/2.42 # -------------------------------------------------
% 7.73/2.42 # User time : 0.028 s
% 7.73/2.42 # System time : 0.004 s
% 7.73/2.42 # Total time : 0.032 s
% 7.73/2.42 # ...preprocessing : 0.013 s
% 7.73/2.42 # ...main loop : 0.019 s
% 7.73/2.42 # Maximum resident set size: 7136 pages
% 7.73/2.42
%------------------------------------------------------------------------------