TSTP Solution File: SWC106+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC106+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:39 EDT 2022
% Result : Theorem 7.66s 2.36s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 40 ( 20 unt; 2 nHn; 40 RR)
% Number of literals : 75 ( 16 equ; 40 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_193) ).
cnf(i_0_204,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_204) ).
cnf(i_0_202,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_202) ).
cnf(i_0_195,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_195) ).
cnf(i_0_203,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_203) ).
cnf(i_0_206,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_206) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_197) ).
cnf(i_0_101,plain,
( rearsegP(app(X1,X2),X3)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ rearsegP(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_101) ).
cnf(i_0_191,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil)
| ~ rearsegP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_191) ).
cnf(i_0_97,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_97) ).
cnf(i_0_199,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_199) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_53) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_44) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aj06guop/input.p',i_0_41) ).
cnf(c_0_221,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_222,negated_conjecture,
esk49_0 = esk51_0,
i_0_204 ).
cnf(c_0_223,negated_conjecture,
neq(esk49_0,nil),
i_0_202 ).
cnf(c_0_224,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_225,negated_conjecture,
esk50_0 = esk48_0,
i_0_203 ).
cnf(c_0_226,negated_conjecture,
app(esk53_0,cons(esk52_0,nil)) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_222]),c_0_222]),c_0_223])]) ).
cnf(c_0_227,negated_conjecture,
cons(esk52_0,nil) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_225]),c_0_222]),c_0_223])]) ).
cnf(c_0_228,negated_conjecture,
ssList(esk50_0),
i_0_206 ).
cnf(c_0_229,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_230,plain,
( rearsegP(app(X1,X2),X3)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ rearsegP(X2,X3) ),
i_0_101 ).
cnf(c_0_231,negated_conjecture,
app(esk53_0,esk48_0) = esk49_0,
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_232,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_228,c_0_225]) ).
cnf(c_0_233,negated_conjecture,
ssList(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_222]),c_0_223])]) ).
cnf(c_0_234,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil)
| ~ rearsegP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_235,plain,
( rearsegP(esk49_0,X1)
| ~ rearsegP(esk48_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232]),c_0_233])]) ).
cnf(c_0_236,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
i_0_97 ).
cnf(c_0_237,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_199 ).
cnf(c_0_238,negated_conjecture,
( ~ rearsegP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_222]),c_0_223])]) ).
cnf(c_0_239,plain,
rearsegP(esk49_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_232])]) ).
cnf(c_0_240,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_241,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_222]),c_0_223])]) ).
cnf(c_0_242,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_243,negated_conjecture,
~ neq(esk48_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_239])]) ).
cnf(c_0_244,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_245,plain,
esk48_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_227]),c_0_241]),c_0_242])]) ).
cnf(c_0_246,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_242]),c_0_232])]),c_0_245]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWC106+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.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 00:41:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.66/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.66/2.36 # Version: 2.1pre011
% 7.66/2.36 # Preprocessing time : 0.014 s
% 7.66/2.36
% 7.66/2.36 # Proof found!
% 7.66/2.36 # SZS status Theorem
% 7.66/2.36 # SZS output start CNFRefutation
% See solution above
% 7.66/2.36 # Proof object total steps : 40
% 7.66/2.36 # Proof object clause steps : 26
% 7.66/2.36 # Proof object formula steps : 14
% 7.66/2.36 # Proof object conjectures : 26
% 7.66/2.36 # Proof object clause conjectures : 17
% 7.66/2.36 # Proof object formula conjectures : 9
% 7.66/2.36 # Proof object initial clauses used : 14
% 7.66/2.36 # Proof object initial formulas used : 14
% 7.66/2.36 # Proof object generating inferences : 4
% 7.66/2.36 # Proof object simplifying inferences : 33
% 7.66/2.36 # Training examples: 0 positive, 0 negative
% 7.66/2.36 # Parsed axioms : 206
% 7.66/2.36 # Removed by relevancy pruning/SinE : 0
% 7.66/2.36 # Initial clauses : 206
% 7.66/2.36 # Removed in clause preprocessing : 0
% 7.66/2.36 # Initial clauses in saturation : 206
% 7.66/2.36 # Processed clauses : 244
% 7.66/2.36 # ...of these trivial : 10
% 7.66/2.36 # ...subsumed : 10
% 7.66/2.36 # ...remaining for further processing : 224
% 7.66/2.36 # Other redundant clauses eliminated : 83
% 7.66/2.36 # Clauses deleted for lack of memory : 0
% 7.66/2.36 # Backward-subsumed : 0
% 7.66/2.36 # Backward-rewritten : 3
% 7.66/2.36 # Generated clauses : 939
% 7.66/2.36 # ...of the previous two non-trivial : 784
% 7.66/2.36 # Contextual simplify-reflections : 3
% 7.66/2.36 # Paramodulations : 838
% 7.66/2.36 # Factorizations : 0
% 7.66/2.36 # Equation resolutions : 101
% 7.66/2.36 # Propositional unsat checks : 0
% 7.66/2.36 # Propositional unsat check successes : 0
% 7.66/2.36 # Current number of processed clauses : 215
% 7.66/2.36 # Positive orientable unit clauses : 29
% 7.66/2.36 # Positive unorientable unit clauses: 0
% 7.66/2.36 # Negative unit clauses : 6
% 7.66/2.36 # Non-unit-clauses : 180
% 7.66/2.36 # Current number of unprocessed clauses: 746
% 7.66/2.36 # ...number of literals in the above : 5457
% 7.66/2.36 # Current number of archived formulas : 0
% 7.66/2.36 # Current number of archived clauses : 3
% 7.66/2.36 # Clause-clause subsumption calls (NU) : 6224
% 7.66/2.36 # Rec. Clause-clause subsumption calls : 1395
% 7.66/2.36 # Non-unit clause-clause subsumptions : 10
% 7.66/2.36 # Unit Clause-clause subsumption calls : 464
% 7.66/2.36 # Rewrite failures with RHS unbound : 0
% 7.66/2.36 # BW rewrite match attempts : 3
% 7.66/2.36 # BW rewrite match successes : 3
% 7.66/2.36 # Condensation attempts : 0
% 7.66/2.36 # Condensation successes : 0
% 7.66/2.36 # Termbank termtop insertions : 23996
% 7.66/2.36
% 7.66/2.36 # -------------------------------------------------
% 7.66/2.36 # User time : 0.034 s
% 7.66/2.36 # System time : 0.001 s
% 7.66/2.36 # Total time : 0.035 s
% 7.66/2.36 # ...preprocessing : 0.014 s
% 7.66/2.36 # ...main loop : 0.021 s
% 7.66/2.36 # Maximum resident set size: 7136 pages
% 7.66/2.36
%------------------------------------------------------------------------------