TSTP Solution File: SWC028+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC028+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:09 EDT 2022
% Result : Theorem 7.43s 2.65s
% Output : CNFRefutation 7.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 12 unt; 8 nHn; 28 RR)
% Number of literals : 50 ( 27 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_198,negated_conjecture,
( nil = esk48_0
| nil = esk49_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_198) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_199) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_200) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_191) ).
cnf(i_0_195,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_195) ).
cnf(i_0_104,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_104) ).
cnf(i_0_202,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_202) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_42) ).
cnf(i_0_194,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_194) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v5g0o/input.p',i_0_44) ).
cnf(c_0_213,negated_conjecture,
( nil = esk48_0
| nil = esk49_0 ),
i_0_198 ).
cnf(c_0_214,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_215,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_216,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk51_0,esk50_0) ),
i_0_191 ).
cnf(c_0_217,negated_conjecture,
( esk51_0 = nil
| esk50_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_214]),c_0_215]) ).
cnf(c_0_218,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
i_0_195 ).
cnf(c_0_219,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
i_0_104 ).
cnf(c_0_220,negated_conjecture,
( esk50_0 = nil
| rearsegP(nil,esk50_0) ),
inference(spm,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_221,negated_conjecture,
ssList(esk50_0),
i_0_202 ).
cnf(c_0_222,negated_conjecture,
( esk50_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_214]),c_0_215]) ).
cnf(c_0_223,plain,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221])]) ).
cnf(c_0_224,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_225,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
i_0_194 ).
cnf(c_0_226,negated_conjecture,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_223])]) ).
cnf(c_0_227,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_224]) ).
cnf(c_0_228,negated_conjecture,
neq(nil,nil),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_223]),c_0_226]) ).
cnf(c_0_229,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_230,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWC028+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 12 06:27:56 EDT 2022
% 0.21/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.43/2.65 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.43/2.65 # Version: 2.1pre011
% 7.43/2.65 # Preprocessing time : 0.014 s
% 7.43/2.65
% 7.43/2.65 # Proof found!
% 7.43/2.65 # SZS status Theorem
% 7.43/2.65 # SZS output start CNFRefutation
% See solution above
% 7.43/2.65 # Proof object total steps : 28
% 7.43/2.65 # Proof object clause steps : 18
% 7.43/2.65 # Proof object formula steps : 10
% 7.43/2.65 # Proof object conjectures : 19
% 7.43/2.65 # Proof object clause conjectures : 12
% 7.43/2.65 # Proof object formula conjectures : 7
% 7.43/2.65 # Proof object initial clauses used : 10
% 7.43/2.65 # Proof object initial formulas used : 10
% 7.43/2.65 # Proof object generating inferences : 3
% 7.43/2.65 # Proof object simplifying inferences : 13
% 7.43/2.65 # Training examples: 0 positive, 0 negative
% 7.43/2.65 # Parsed axioms : 200
% 7.43/2.65 # Removed by relevancy pruning/SinE : 0
% 7.43/2.65 # Initial clauses : 200
% 7.43/2.65 # Removed in clause preprocessing : 0
% 7.43/2.65 # Initial clauses in saturation : 200
% 7.43/2.65 # Processed clauses : 244
% 7.43/2.65 # ...of these trivial : 7
% 7.43/2.65 # ...subsumed : 11
% 7.43/2.65 # ...remaining for further processing : 226
% 7.43/2.65 # Other redundant clauses eliminated : 24
% 7.43/2.65 # Clauses deleted for lack of memory : 0
% 7.43/2.65 # Backward-subsumed : 0
% 7.43/2.65 # Backward-rewritten : 10
% 7.43/2.65 # Generated clauses : 1414
% 7.43/2.65 # ...of the previous two non-trivial : 1276
% 7.43/2.65 # Contextual simplify-reflections : 5
% 7.43/2.65 # Paramodulations : 1344
% 7.43/2.65 # Factorizations : 30
% 7.43/2.65 # Equation resolutions : 40
% 7.43/2.65 # Propositional unsat checks : 0
% 7.43/2.65 # Propositional unsat check successes : 0
% 7.43/2.65 # Current number of processed clauses : 210
% 7.43/2.65 # Positive orientable unit clauses : 21
% 7.43/2.65 # Positive unorientable unit clauses: 0
% 7.43/2.65 # Negative unit clauses : 4
% 7.43/2.65 # Non-unit-clauses : 185
% 7.43/2.65 # Current number of unprocessed clauses: 1168
% 7.43/2.65 # ...number of literals in the above : 5773
% 7.43/2.65 # Current number of archived formulas : 0
% 7.43/2.65 # Current number of archived clauses : 10
% 7.43/2.65 # Clause-clause subsumption calls (NU) : 7015
% 7.43/2.65 # Rec. Clause-clause subsumption calls : 1843
% 7.43/2.65 # Non-unit clause-clause subsumptions : 14
% 7.43/2.65 # Unit Clause-clause subsumption calls : 433
% 7.43/2.65 # Rewrite failures with RHS unbound : 0
% 7.43/2.65 # BW rewrite match attempts : 2
% 7.43/2.65 # BW rewrite match successes : 2
% 7.43/2.65 # Condensation attempts : 0
% 7.43/2.65 # Condensation successes : 0
% 7.43/2.65 # Termbank termtop insertions : 25871
% 7.43/2.65
% 7.43/2.65 # -------------------------------------------------
% 7.43/2.65 # User time : 0.029 s
% 7.43/2.65 # System time : 0.004 s
% 7.43/2.65 # Total time : 0.033 s
% 7.43/2.65 # ...preprocessing : 0.014 s
% 7.43/2.65 # ...main loop : 0.019 s
% 7.43/2.65 # Maximum resident set size: 7140 pages
% 7.43/2.65
%------------------------------------------------------------------------------