TSTP Solution File: SWC387+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC387+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:15:22 EDT 2022
% Result : Theorem 7.38s 2.36s
% Output : CNFRefutation 7.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 15 unt; 3 nHn; 31 RR)
% Number of literals : 55 ( 22 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_44) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_201) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_198) ).
cnf(i_0_194,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_194) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_197) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_195) ).
cnf(i_0_196,negated_conjecture,
( cons(X1,nil) != esk48_0
| ~ ssItem(X1)
| ~ memberP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_196) ).
cnf(i_0_191,negated_conjecture,
( memberP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_191) ).
cnf(i_0_192,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_192) ).
cnf(i_0_193,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ezxhcvli/input.p',i_0_193) ).
cnf(c_0_213,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_214,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_215,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_216,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_217,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
i_0_194 ).
cnf(c_0_218,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_219,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_195 ).
cnf(c_0_220,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_213,c_0_214]) ).
cnf(c_0_221,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_222,negated_conjecture,
esk51_0 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_218]),c_0_216]),c_0_219]) ).
cnf(c_0_223,negated_conjecture,
( cons(X1,nil) != esk48_0
| ~ ssItem(X1)
| ~ memberP(esk49_0,X1) ),
i_0_196 ).
cnf(c_0_224,negated_conjecture,
( memberP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_225,negated_conjecture,
neq(esk51_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_222]) ).
cnf(c_0_226,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_227,negated_conjecture,
( cons(X1,nil) != esk50_0
| ~ memberP(esk51_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_218]),c_0_216]) ).
cnf(c_0_228,negated_conjecture,
memberP(esk51_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_225])]) ).
cnf(c_0_229,negated_conjecture,
cons(esk52_0,nil) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_225])]) ).
cnf(c_0_230,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_231,negated_conjecture,
~ ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229])]) ).
cnf(c_0_232,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_225])]),c_0_231]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC387+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 : n024.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 11:01:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.38/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.38/2.36 # Version: 2.1pre011
% 7.38/2.36 # Preprocessing time : 0.012 s
% 7.38/2.36
% 7.38/2.36 # Proof found!
% 7.38/2.36 # SZS status Theorem
% 7.38/2.36 # SZS output start CNFRefutation
% See solution above
% 7.38/2.36 # Proof object total steps : 31
% 7.38/2.36 # Proof object clause steps : 20
% 7.38/2.36 # Proof object formula steps : 11
% 7.38/2.36 # Proof object conjectures : 26
% 7.38/2.36 # Proof object clause conjectures : 17
% 7.38/2.36 # Proof object formula conjectures : 9
% 7.38/2.36 # Proof object initial clauses used : 11
% 7.38/2.36 # Proof object initial formulas used : 11
% 7.38/2.36 # Proof object generating inferences : 3
% 7.38/2.36 # Proof object simplifying inferences : 16
% 7.38/2.36 # Training examples: 0 positive, 0 negative
% 7.38/2.36 # Parsed axioms : 200
% 7.38/2.36 # Removed by relevancy pruning/SinE : 0
% 7.38/2.36 # Initial clauses : 200
% 7.38/2.36 # Removed in clause preprocessing : 0
% 7.38/2.36 # Initial clauses in saturation : 200
% 7.38/2.36 # Processed clauses : 237
% 7.38/2.36 # ...of these trivial : 4
% 7.38/2.36 # ...subsumed : 8
% 7.38/2.36 # ...remaining for further processing : 224
% 7.38/2.36 # Other redundant clauses eliminated : 24
% 7.38/2.36 # Clauses deleted for lack of memory : 0
% 7.38/2.36 # Backward-subsumed : 0
% 7.38/2.36 # Backward-rewritten : 4
% 7.38/2.36 # Generated clauses : 1535
% 7.38/2.36 # ...of the previous two non-trivial : 1396
% 7.38/2.36 # Contextual simplify-reflections : 11
% 7.38/2.36 # Paramodulations : 1465
% 7.38/2.36 # Factorizations : 30
% 7.38/2.36 # Equation resolutions : 40
% 7.38/2.36 # Propositional unsat checks : 0
% 7.38/2.36 # Propositional unsat check successes : 0
% 7.38/2.36 # Current number of processed clauses : 214
% 7.38/2.36 # Positive orientable unit clauses : 21
% 7.38/2.36 # Positive unorientable unit clauses: 0
% 7.38/2.36 # Negative unit clauses : 4
% 7.38/2.36 # Non-unit-clauses : 189
% 7.38/2.36 # Current number of unprocessed clauses: 1359
% 7.38/2.36 # ...number of literals in the above : 6505
% 7.38/2.36 # Current number of archived formulas : 0
% 7.38/2.36 # Current number of archived clauses : 4
% 7.38/2.36 # Clause-clause subsumption calls (NU) : 8161
% 7.38/2.36 # Rec. Clause-clause subsumption calls : 1875
% 7.38/2.36 # Non-unit clause-clause subsumptions : 18
% 7.38/2.36 # Unit Clause-clause subsumption calls : 531
% 7.38/2.36 # Rewrite failures with RHS unbound : 0
% 7.38/2.36 # BW rewrite match attempts : 2
% 7.38/2.36 # BW rewrite match successes : 2
% 7.38/2.36 # Condensation attempts : 0
% 7.38/2.36 # Condensation successes : 0
% 7.38/2.36 # Termbank termtop insertions : 27814
% 7.38/2.36
% 7.38/2.36 # -------------------------------------------------
% 7.38/2.36 # User time : 0.031 s
% 7.38/2.36 # System time : 0.002 s
% 7.38/2.36 # Total time : 0.033 s
% 7.38/2.36 # ...preprocessing : 0.012 s
% 7.38/2.36 # ...main loop : 0.021 s
% 7.38/2.36 # Maximum resident set size: 7140 pages
% 7.38/2.36
%------------------------------------------------------------------------------