TSTP Solution File: SWC367+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC367+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:15 EDT 2022
% Result : Theorem 7.07s 2.52s
% Output : CNFRefutation 7.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 13 unt; 4 nHn; 19 RR)
% Number of literals : 25 ( 10 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
~ rearsegP(esk49_0,esk48_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e7zuj8uf/input.p',i_0_195) ).
cnf(i_0_196,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e7zuj8uf/input.p',i_0_196) ).
cnf(i_0_197,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e7zuj8uf/input.p',i_0_197) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e7zuj8uf/input.p',i_0_191) ).
cnf(i_0_193,negated_conjecture,
( nil = esk51_0
| rearsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e7zuj8uf/input.p',i_0_193) ).
cnf(i_0_97,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e7zuj8uf/input.p',i_0_97) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e7zuj8uf/input.p',i_0_44) ).
cnf(c_0_205,negated_conjecture,
~ rearsegP(esk49_0,esk48_0),
i_0_195 ).
cnf(c_0_206,negated_conjecture,
esk50_0 = esk48_0,
i_0_196 ).
cnf(c_0_207,negated_conjecture,
esk49_0 = esk51_0,
i_0_197 ).
cnf(c_0_208,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk51_0,esk50_0) ),
i_0_191 ).
cnf(c_0_209,negated_conjecture,
~ rearsegP(esk51_0,esk50_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_205,c_0_206]),c_0_207]) ).
cnf(c_0_210,negated_conjecture,
( nil = esk51_0
| rearsegP(esk51_0,esk50_0) ),
i_0_193 ).
cnf(c_0_211,negated_conjecture,
esk50_0 = nil,
inference(sr,[status(thm)],[c_0_208,c_0_209]) ).
cnf(c_0_212,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[c_0_210,c_0_209]) ).
cnf(c_0_213,negated_conjecture,
~ rearsegP(nil,nil),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_209,c_0_211]),c_0_212]) ).
cnf(c_0_214,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
i_0_97 ).
cnf(c_0_215,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_216,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_213,c_0_214]),c_0_215])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC367+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n023.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 13:05:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.07/2.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.07/2.52 # Version: 2.1pre011
% 7.07/2.52 # Preprocessing time : 0.013 s
% 7.07/2.52
% 7.07/2.52 # Proof found!
% 7.07/2.52 # SZS status Theorem
% 7.07/2.52 # SZS output start CNFRefutation
% See solution above
% 7.07/2.52 # Proof object total steps : 19
% 7.07/2.52 # Proof object clause steps : 12
% 7.07/2.52 # Proof object formula steps : 7
% 7.07/2.52 # Proof object conjectures : 14
% 7.07/2.52 # Proof object clause conjectures : 9
% 7.07/2.52 # Proof object formula conjectures : 5
% 7.07/2.52 # Proof object initial clauses used : 7
% 7.07/2.52 # Proof object initial formulas used : 7
% 7.07/2.52 # Proof object generating inferences : 1
% 7.07/2.52 # Proof object simplifying inferences : 8
% 7.07/2.52 # Training examples: 0 positive, 0 negative
% 7.07/2.52 # Parsed axioms : 199
% 7.07/2.52 # Removed by relevancy pruning/SinE : 0
% 7.07/2.52 # Initial clauses : 199
% 7.07/2.52 # Removed in clause preprocessing : 0
% 7.07/2.52 # Initial clauses in saturation : 199
% 7.07/2.52 # Processed clauses : 208
% 7.07/2.52 # ...of these trivial : 2
% 7.07/2.52 # ...subsumed : 4
% 7.07/2.52 # ...remaining for further processing : 202
% 7.07/2.52 # Other redundant clauses eliminated : 82
% 7.07/2.52 # Clauses deleted for lack of memory : 0
% 7.07/2.52 # Backward-subsumed : 0
% 7.07/2.52 # Backward-rewritten : 8
% 7.07/2.52 # Generated clauses : 805
% 7.07/2.52 # ...of the previous two non-trivial : 658
% 7.07/2.52 # Contextual simplify-reflections : 2
% 7.07/2.52 # Paramodulations : 705
% 7.07/2.52 # Factorizations : 0
% 7.07/2.52 # Equation resolutions : 98
% 7.07/2.52 # Propositional unsat checks : 0
% 7.07/2.52 # Propositional unsat check successes : 0
% 7.07/2.52 # Current number of processed clauses : 186
% 7.07/2.52 # Positive orientable unit clauses : 14
% 7.07/2.52 # Positive unorientable unit clauses: 0
% 7.07/2.52 # Negative unit clauses : 3
% 7.07/2.52 # Non-unit-clauses : 169
% 7.07/2.52 # Current number of unprocessed clauses: 645
% 7.07/2.52 # ...number of literals in the above : 4851
% 7.07/2.52 # Current number of archived formulas : 0
% 7.07/2.52 # Current number of archived clauses : 10
% 7.07/2.52 # Clause-clause subsumption calls (NU) : 6416
% 7.07/2.52 # Rec. Clause-clause subsumption calls : 1440
% 7.07/2.52 # Non-unit clause-clause subsumptions : 6
% 7.07/2.52 # Unit Clause-clause subsumption calls : 475
% 7.07/2.52 # Rewrite failures with RHS unbound : 0
% 7.07/2.52 # BW rewrite match attempts : 3
% 7.07/2.52 # BW rewrite match successes : 3
% 7.07/2.52 # Condensation attempts : 0
% 7.07/2.52 # Condensation successes : 0
% 7.07/2.52 # Termbank termtop insertions : 21500
% 7.07/2.52
% 7.07/2.52 # -------------------------------------------------
% 7.07/2.52 # User time : 0.025 s
% 7.07/2.52 # System time : 0.005 s
% 7.07/2.52 # Total time : 0.031 s
% 7.07/2.52 # ...preprocessing : 0.013 s
% 7.07/2.52 # ...main loop : 0.017 s
% 7.07/2.52 # Maximum resident set size: 7124 pages
% 7.07/2.52
%------------------------------------------------------------------------------