TSTP Solution File: SWC317+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC317+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:14:57 EDT 2022
% Result : Theorem 7.79s 2.35s
% Output : CNFRefutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 11 unt; 0 nHn; 22 RR)
% Number of literals : 41 ( 16 equ; 22 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_199,negated_conjecture,
( app(X1,cons(X2,nil)) != esk49_0
| app(cons(X2,nil),X1) != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_2rekro/input.p',i_0_199) ).
cnf(i_0_203,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_2rekro/input.p',i_0_203) ).
cnf(i_0_204,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_2rekro/input.p',i_0_204) ).
cnf(i_0_202,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_2rekro/input.p',i_0_202) ).
cnf(i_0_191,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_2rekro/input.p',i_0_191) ).
cnf(i_0_193,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_2rekro/input.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_2rekro/input.p',i_0_197) ).
cnf(i_0_195,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1_2rekro/input.p',i_0_195) ).
cnf(c_0_213,negated_conjecture,
( app(X1,cons(X2,nil)) != esk49_0
| app(cons(X2,nil),X1) != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(esk51_0,nil) ),
i_0_199 ).
cnf(c_0_214,negated_conjecture,
esk50_0 = esk48_0,
i_0_203 ).
cnf(c_0_215,negated_conjecture,
esk49_0 = esk51_0,
i_0_204 ).
cnf(c_0_216,negated_conjecture,
neq(esk49_0,nil),
i_0_202 ).
cnf(c_0_217,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_218,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_219,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_220,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_221,negated_conjecture,
( app(X1,cons(X2,nil)) != esk49_0
| app(cons(X2,nil),X1) != esk50_0
| ~ ssItem(X2)
| ~ ssList(X1) ),
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_222,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_217,c_0_215]),c_0_215]),c_0_216])]) ).
cnf(c_0_223,negated_conjecture,
app(cons(esk52_0,nil),esk53_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_215]),c_0_216])]) ).
cnf(c_0_224,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_215]),c_0_216])]) ).
cnf(c_0_225,negated_conjecture,
ssList(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_215]),c_0_216])]) ).
cnf(c_0_226,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC317+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n021.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 : Sat Jun 11 23:14:42 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.79/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.79/2.35 # Version: 2.1pre011
% 7.79/2.35 # Preprocessing time : 0.024 s
% 7.79/2.35
% 7.79/2.35 # Proof found!
% 7.79/2.35 # SZS status Theorem
% 7.79/2.35 # SZS output start CNFRefutation
% See solution above
% 7.79/2.35 # Proof object total steps : 22
% 7.79/2.35 # Proof object clause steps : 14
% 7.79/2.35 # Proof object formula steps : 8
% 7.79/2.35 # Proof object conjectures : 22
% 7.79/2.35 # Proof object clause conjectures : 14
% 7.79/2.35 # Proof object formula conjectures : 8
% 7.79/2.35 # Proof object initial clauses used : 8
% 7.79/2.35 # Proof object initial formulas used : 8
% 7.79/2.35 # Proof object generating inferences : 1
% 7.79/2.35 # Proof object simplifying inferences : 21
% 7.79/2.35 # Training examples: 0 positive, 0 negative
% 7.79/2.35 # Parsed axioms : 206
% 7.79/2.35 # Removed by relevancy pruning/SinE : 0
% 7.79/2.35 # Initial clauses : 206
% 7.79/2.35 # Removed in clause preprocessing : 0
% 7.79/2.35 # Initial clauses in saturation : 206
% 7.79/2.35 # Processed clauses : 50
% 7.79/2.35 # ...of these trivial : 7
% 7.79/2.35 # ...subsumed : 0
% 7.79/2.35 # ...remaining for further processing : 43
% 7.79/2.35 # Other redundant clauses eliminated : 1
% 7.79/2.35 # Clauses deleted for lack of memory : 0
% 7.79/2.35 # Backward-subsumed : 0
% 7.79/2.35 # Backward-rewritten : 0
% 7.79/2.35 # Generated clauses : 8
% 7.79/2.35 # ...of the previous two non-trivial : 7
% 7.79/2.35 # Contextual simplify-reflections : 0
% 7.79/2.35 # Paramodulations : 7
% 7.79/2.35 # Factorizations : 0
% 7.79/2.35 # Equation resolutions : 1
% 7.79/2.35 # Propositional unsat checks : 0
% 7.79/2.35 # Propositional unsat check successes : 0
% 7.79/2.35 # Current number of processed clauses : 42
% 7.79/2.35 # Positive orientable unit clauses : 19
% 7.79/2.35 # Positive unorientable unit clauses: 0
% 7.79/2.35 # Negative unit clauses : 2
% 7.79/2.35 # Non-unit-clauses : 21
% 7.79/2.35 # Current number of unprocessed clauses: 162
% 7.79/2.35 # ...number of literals in the above : 659
% 7.79/2.35 # Current number of archived formulas : 0
% 7.79/2.35 # Current number of archived clauses : 0
% 7.79/2.35 # Clause-clause subsumption calls (NU) : 99
% 7.79/2.35 # Rec. Clause-clause subsumption calls : 64
% 7.79/2.35 # Non-unit clause-clause subsumptions : 0
% 7.79/2.35 # Unit Clause-clause subsumption calls : 0
% 7.79/2.35 # Rewrite failures with RHS unbound : 0
% 7.79/2.35 # BW rewrite match attempts : 0
% 7.79/2.35 # BW rewrite match successes : 0
% 7.79/2.35 # Condensation attempts : 0
% 7.79/2.35 # Condensation successes : 0
% 7.79/2.35 # Termbank termtop insertions : 4822
% 7.79/2.35
% 7.79/2.35 # -------------------------------------------------
% 7.79/2.35 # User time : 0.020 s
% 7.79/2.35 # System time : 0.005 s
% 7.79/2.35 # Total time : 0.025 s
% 7.79/2.35 # ...preprocessing : 0.024 s
% 7.79/2.35 # ...main loop : 0.001 s
% 7.79/2.35 # Maximum resident set size: 7132 pages
% 7.79/2.35
%------------------------------------------------------------------------------