TSTP Solution File: SWC101+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC101+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:37 EDT 2022
% Result : Theorem 7.36s 2.48s
% Output : CNFRefutation 7.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 29 ( 15 unt; 2 nHn; 29 RR)
% Number of literals : 56 ( 19 equ; 32 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ frontsegP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_191) ).
cnf(i_0_199,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_199) ).
cnf(i_0_198,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_198) ).
cnf(i_0_192,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_192) ).
cnf(i_0_193,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_193) ).
cnf(i_0_113,plain,
( frontsegP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_113) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_58) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_44) ).
cnf(i_0_201,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_201) ).
cnf(i_0_196,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_196) ).
cnf(i_0_197,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o4nfmm12/input.p',i_0_197) ).
cnf(c_0_214,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ frontsegP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_215,negated_conjecture,
esk49_0 = esk51_0,
i_0_199 ).
cnf(c_0_216,negated_conjecture,
esk50_0 = esk48_0,
i_0_198 ).
cnf(c_0_217,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
i_0_192 ).
cnf(c_0_218,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
i_0_193 ).
cnf(c_0_219,plain,
( frontsegP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
i_0_113 ).
cnf(c_0_220,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_221,negated_conjecture,
( ~ neq(esk50_0,nil)
| ~ frontsegP(esk51_0,esk50_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_214,c_0_215]),c_0_216]),c_0_216]) ).
cnf(c_0_222,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_223,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_224,negated_conjecture,
ssList(esk50_0),
i_0_201 ).
cnf(c_0_225,negated_conjecture,
esk50_0 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_216]),c_0_215]),c_0_218]) ).
cnf(c_0_226,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_219]),c_0_220]) ).
cnf(c_0_227,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
i_0_196 ).
cnf(c_0_228,negated_conjecture,
ssList(esk52_0),
i_0_197 ).
cnf(c_0_229,negated_conjecture,
~ frontsegP(esk51_0,esk50_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_223]),c_0_224])]),c_0_225]) ).
cnf(c_0_230,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_228]),c_0_224])]),c_0_229]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC101+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n017.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 11:45:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.36/2.48 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.36/2.48 # Version: 2.1pre011
% 7.36/2.48 # Preprocessing time : 0.014 s
% 7.36/2.48
% 7.36/2.48 # Proof found!
% 7.36/2.48 # SZS status Theorem
% 7.36/2.48 # SZS output start CNFRefutation
% See solution above
% 7.36/2.48 # Proof object total steps : 29
% 7.36/2.48 # Proof object clause steps : 17
% 7.36/2.48 # Proof object formula steps : 12
% 7.36/2.48 # Proof object conjectures : 20
% 7.36/2.48 # Proof object clause conjectures : 12
% 7.36/2.48 # Proof object formula conjectures : 8
% 7.36/2.48 # Proof object initial clauses used : 12
% 7.36/2.48 # Proof object initial formulas used : 12
% 7.36/2.48 # Proof object generating inferences : 3
% 7.36/2.48 # Proof object simplifying inferences : 15
% 7.36/2.48 # Training examples: 0 positive, 0 negative
% 7.36/2.48 # Parsed axioms : 201
% 7.36/2.48 # Removed by relevancy pruning/SinE : 0
% 7.36/2.48 # Initial clauses : 201
% 7.36/2.48 # Removed in clause preprocessing : 0
% 7.36/2.48 # Initial clauses in saturation : 201
% 7.36/2.48 # Processed clauses : 239
% 7.36/2.48 # ...of these trivial : 4
% 7.36/2.48 # ...subsumed : 16
% 7.36/2.48 # ...remaining for further processing : 219
% 7.36/2.48 # Other redundant clauses eliminated : 82
% 7.36/2.48 # Clauses deleted for lack of memory : 0
% 7.36/2.48 # Backward-subsumed : 1
% 7.36/2.48 # Backward-rewritten : 1
% 7.36/2.48 # Generated clauses : 963
% 7.36/2.48 # ...of the previous two non-trivial : 801
% 7.36/2.48 # Contextual simplify-reflections : 13
% 7.36/2.48 # Paramodulations : 864
% 7.36/2.48 # Factorizations : 0
% 7.36/2.48 # Equation resolutions : 99
% 7.36/2.48 # Propositional unsat checks : 0
% 7.36/2.48 # Propositional unsat check successes : 0
% 7.36/2.48 # Current number of processed clauses : 211
% 7.36/2.48 # Positive orientable unit clauses : 20
% 7.36/2.48 # Positive unorientable unit clauses: 0
% 7.36/2.48 # Negative unit clauses : 5
% 7.36/2.48 # Non-unit-clauses : 186
% 7.36/2.48 # Current number of unprocessed clauses: 746
% 7.36/2.48 # ...number of literals in the above : 5459
% 7.36/2.48 # Current number of archived formulas : 0
% 7.36/2.48 # Current number of archived clauses : 2
% 7.36/2.48 # Clause-clause subsumption calls (NU) : 7492
% 7.36/2.48 # Rec. Clause-clause subsumption calls : 1790
% 7.36/2.48 # Non-unit clause-clause subsumptions : 23
% 7.36/2.48 # Unit Clause-clause subsumption calls : 62
% 7.36/2.48 # Rewrite failures with RHS unbound : 0
% 7.36/2.48 # BW rewrite match attempts : 1
% 7.36/2.48 # BW rewrite match successes : 1
% 7.36/2.48 # Condensation attempts : 0
% 7.36/2.48 # Condensation successes : 0
% 7.36/2.48 # Termbank termtop insertions : 24316
% 7.36/2.48
% 7.36/2.48 # -------------------------------------------------
% 7.36/2.48 # User time : 0.029 s
% 7.36/2.48 # System time : 0.004 s
% 7.36/2.48 # Total time : 0.033 s
% 7.36/2.48 # ...preprocessing : 0.014 s
% 7.36/2.48 # ...main loop : 0.019 s
% 7.36/2.48 # Maximum resident set size: 7128 pages
% 7.36/2.48
%------------------------------------------------------------------------------