TSTP Solution File: SWC122+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC122+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:45 EDT 2022
% Result : Theorem 7.70s 2.44s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of clauses : 36 ( 18 unt; 0 nHn; 36 RR)
% Number of literals : 77 ( 11 equ; 44 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_197) ).
cnf(i_0_149,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_149) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_159) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_44) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_58) ).
cnf(i_0_192,negated_conjecture,
( neq(esk50_0,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_192) ).
cnf(i_0_131,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_131) ).
cnf(i_0_132,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_132) ).
cnf(i_0_191,negated_conjecture,
( rearsegP(esk51_0,esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_191) ).
cnf(i_0_200,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_200) ).
cnf(i_0_193,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_193) ).
cnf(i_0_196,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_196) ).
cnf(i_0_199,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vhxco5zk/input.p',i_0_199) ).
cnf(c_0_215,negated_conjecture,
neq(esk49_0,nil),
i_0_195 ).
cnf(c_0_216,negated_conjecture,
esk49_0 = esk51_0,
i_0_197 ).
cnf(c_0_217,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_218,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_219,plain,
ssList(nil),
i_0_44 ).
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)
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_222,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_223,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219])]),c_0_220]) ).
cnf(c_0_224,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_131 ).
cnf(c_0_225,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_132 ).
cnf(c_0_226,negated_conjecture,
( rearsegP(esk51_0,esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_227,negated_conjecture,
ssList(esk49_0),
i_0_200 ).
cnf(c_0_228,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_193 ).
cnf(c_0_229,negated_conjecture,
esk50_0 = esk48_0,
i_0_196 ).
cnf(c_0_230,negated_conjecture,
neq(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_222])]) ).
cnf(c_0_231,plain,
( segmentP(X1,X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224])]),c_0_225]) ).
cnf(c_0_232,negated_conjecture,
rearsegP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_222])]) ).
cnf(c_0_233,negated_conjecture,
ssList(esk50_0),
i_0_199 ).
cnf(c_0_234,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_227,c_0_216]) ).
cnf(c_0_235,negated_conjecture,
~ segmentP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_229]),c_0_229]),c_0_216]),c_0_230])]) ).
cnf(c_0_236,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_231,c_0_232]),c_0_233]),c_0_234])]),c_0_235]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC122+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 23:35:57 EDT 2022
% 0.12/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.70/2.44 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.70/2.44 # Version: 2.1pre011
% 7.70/2.44 # Preprocessing time : 0.021 s
% 7.70/2.44
% 7.70/2.44 # Proof found!
% 7.70/2.44 # SZS status Theorem
% 7.70/2.44 # SZS output start CNFRefutation
% See solution above
% 7.70/2.44 # Proof object total steps : 36
% 7.70/2.44 # Proof object clause steps : 22
% 7.70/2.44 # Proof object formula steps : 14
% 7.70/2.44 # Proof object conjectures : 22
% 7.70/2.44 # Proof object clause conjectures : 14
% 7.70/2.44 # Proof object formula conjectures : 8
% 7.70/2.44 # Proof object initial clauses used : 14
% 7.70/2.44 # Proof object initial formulas used : 14
% 7.70/2.44 # Proof object generating inferences : 3
% 7.70/2.44 # Proof object simplifying inferences : 20
% 7.70/2.44 # Training examples: 0 positive, 0 negative
% 7.70/2.44 # Parsed axioms : 199
% 7.70/2.44 # Removed by relevancy pruning/SinE : 0
% 7.70/2.44 # Initial clauses : 199
% 7.70/2.44 # Removed in clause preprocessing : 0
% 7.70/2.44 # Initial clauses in saturation : 199
% 7.70/2.44 # Processed clauses : 338
% 7.70/2.44 # ...of these trivial : 3
% 7.70/2.44 # ...subsumed : 76
% 7.70/2.44 # ...remaining for further processing : 259
% 7.70/2.44 # Other redundant clauses eliminated : 125
% 7.70/2.44 # Clauses deleted for lack of memory : 0
% 7.70/2.44 # Backward-subsumed : 2
% 7.70/2.44 # Backward-rewritten : 1
% 7.70/2.44 # Generated clauses : 1313
% 7.70/2.44 # ...of the previous two non-trivial : 1086
% 7.70/2.44 # Contextual simplify-reflections : 102
% 7.70/2.44 # Paramodulations : 1156
% 7.70/2.44 # Factorizations : 0
% 7.70/2.44 # Equation resolutions : 157
% 7.70/2.44 # Propositional unsat checks : 0
% 7.70/2.44 # Propositional unsat check successes : 0
% 7.70/2.44 # Current number of processed clauses : 250
% 7.70/2.44 # Positive orientable unit clauses : 17
% 7.70/2.44 # Positive unorientable unit clauses: 0
% 7.70/2.44 # Negative unit clauses : 5
% 7.70/2.44 # Non-unit-clauses : 228
% 7.70/2.44 # Current number of unprocessed clauses: 943
% 7.70/2.44 # ...number of literals in the above : 7114
% 7.70/2.44 # Current number of archived formulas : 0
% 7.70/2.44 # Current number of archived clauses : 3
% 7.70/2.44 # Clause-clause subsumption calls (NU) : 14285
% 7.70/2.44 # Rec. Clause-clause subsumption calls : 2966
% 7.70/2.44 # Non-unit clause-clause subsumptions : 156
% 7.70/2.44 # Unit Clause-clause subsumption calls : 217
% 7.70/2.44 # Rewrite failures with RHS unbound : 0
% 7.70/2.44 # BW rewrite match attempts : 1
% 7.70/2.44 # BW rewrite match successes : 1
% 7.70/2.44 # Condensation attempts : 0
% 7.70/2.44 # Condensation successes : 0
% 7.70/2.44 # Termbank termtop insertions : 31301
% 7.70/2.44
% 7.70/2.44 # -------------------------------------------------
% 7.70/2.44 # User time : 0.049 s
% 7.70/2.44 # System time : 0.003 s
% 7.70/2.44 # Total time : 0.052 s
% 7.70/2.44 # ...preprocessing : 0.021 s
% 7.70/2.44 # ...main loop : 0.031 s
% 7.70/2.44 # Maximum resident set size: 7132 pages
% 7.70/2.44
%------------------------------------------------------------------------------