TSTP Solution File: SWC069+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC069+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:24 EDT 2022
% Result : Theorem 7.73s 2.29s
% Output : CNFRefutation 7.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 29 ( 12 unt; 2 nHn; 29 RR)
% Number of literals : 56 ( 15 equ; 32 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 : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_197,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_198) ).
cnf(i_0_199,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_199) ).
cnf(i_0_193,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_193) ).
cnf(i_0_194,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_194) ).
cnf(i_0_192,negated_conjecture,
( segmentP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_192) ).
cnf(i_0_191,negated_conjecture,
( segmentP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_191) ).
cnf(i_0_202,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_202) ).
cnf(i_0_195,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_195) ).
cnf(i_0_196,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_196) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n40pja_n/input.p',i_0_44) ).
cnf(c_0_215,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_197 ).
cnf(c_0_216,negated_conjecture,
esk50_0 = esk48_0,
i_0_198 ).
cnf(c_0_217,negated_conjecture,
esk49_0 = esk51_0,
i_0_199 ).
cnf(c_0_218,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_216]),c_0_217]) ).
cnf(c_0_219,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_220,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_194 ).
cnf(c_0_221,negated_conjecture,
( segmentP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_222,negated_conjecture,
( segmentP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_223,negated_conjecture,
ssList(esk49_0),
i_0_202 ).
cnf(c_0_224,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
i_0_195 ).
cnf(c_0_225,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_196 ).
cnf(c_0_226,negated_conjecture,
~ neq(esk51_0,nil),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_220]),c_0_221]),c_0_222]) ).
cnf(c_0_227,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_228,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_229,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_223,c_0_217]) ).
cnf(c_0_230,negated_conjecture,
esk51_0 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_216]),c_0_217]),c_0_225]) ).
cnf(c_0_231,plain,
$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_229])]),c_0_230]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC069+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 19:22:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.73/2.29 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.73/2.29 # Version: 2.1pre011
% 7.73/2.29 # Preprocessing time : 0.015 s
% 7.73/2.29
% 7.73/2.29 # Proof found!
% 7.73/2.29 # SZS status Theorem
% 7.73/2.29 # SZS output start CNFRefutation
% See solution above
% 7.73/2.29 # Proof object total steps : 29
% 7.73/2.29 # Proof object clause steps : 17
% 7.73/2.29 # Proof object formula steps : 12
% 7.73/2.29 # Proof object conjectures : 24
% 7.73/2.29 # Proof object clause conjectures : 14
% 7.73/2.29 # Proof object formula conjectures : 10
% 7.73/2.29 # Proof object initial clauses used : 12
% 7.73/2.29 # Proof object initial formulas used : 12
% 7.73/2.29 # Proof object generating inferences : 2
% 7.73/2.29 # Proof object simplifying inferences : 13
% 7.73/2.29 # Training examples: 0 positive, 0 negative
% 7.73/2.29 # Parsed axioms : 201
% 7.73/2.29 # Removed by relevancy pruning/SinE : 0
% 7.73/2.29 # Initial clauses : 201
% 7.73/2.29 # Removed in clause preprocessing : 0
% 7.73/2.29 # Initial clauses in saturation : 201
% 7.73/2.29 # Processed clauses : 205
% 7.73/2.29 # ...of these trivial : 3
% 7.73/2.29 # ...subsumed : 2
% 7.73/2.29 # ...remaining for further processing : 200
% 7.73/2.29 # Other redundant clauses eliminated : 82
% 7.73/2.29 # Clauses deleted for lack of memory : 0
% 7.73/2.29 # Backward-subsumed : 0
% 7.73/2.29 # Backward-rewritten : 1
% 7.73/2.29 # Generated clauses : 808
% 7.73/2.29 # ...of the previous two non-trivial : 658
% 7.73/2.29 # Contextual simplify-reflections : 6
% 7.73/2.29 # Paramodulations : 710
% 7.73/2.29 # Factorizations : 0
% 7.73/2.29 # Equation resolutions : 98
% 7.73/2.29 # Propositional unsat checks : 0
% 7.73/2.29 # Propositional unsat check successes : 0
% 7.73/2.29 # Current number of processed clauses : 193
% 7.73/2.29 # Positive orientable unit clauses : 14
% 7.73/2.29 # Positive unorientable unit clauses: 0
% 7.73/2.29 # Negative unit clauses : 4
% 7.73/2.29 # Non-unit-clauses : 175
% 7.73/2.29 # Current number of unprocessed clauses: 654
% 7.73/2.29 # ...number of literals in the above : 4882
% 7.73/2.29 # Current number of archived formulas : 0
% 7.73/2.29 # Current number of archived clauses : 1
% 7.73/2.29 # Clause-clause subsumption calls (NU) : 6455
% 7.73/2.29 # Rec. Clause-clause subsumption calls : 1618
% 7.73/2.29 # Non-unit clause-clause subsumptions : 8
% 7.73/2.29 # Unit Clause-clause subsumption calls : 49
% 7.73/2.29 # Rewrite failures with RHS unbound : 0
% 7.73/2.29 # BW rewrite match attempts : 1
% 7.73/2.29 # BW rewrite match successes : 1
% 7.73/2.29 # Condensation attempts : 0
% 7.73/2.29 # Condensation successes : 0
% 7.73/2.29 # Termbank termtop insertions : 21584
% 7.73/2.29
% 7.73/2.29 # -------------------------------------------------
% 7.73/2.29 # User time : 0.025 s
% 7.73/2.29 # System time : 0.006 s
% 7.73/2.29 # Total time : 0.031 s
% 7.73/2.29 # ...preprocessing : 0.015 s
% 7.73/2.29 # ...main loop : 0.016 s
% 7.73/2.29 # Maximum resident set size: 7132 pages
% 7.73/2.29
%------------------------------------------------------------------------------