TSTP Solution File: SWC371+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC371+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:15:16 EDT 2022
% Result : Theorem 8.19s 2.49s
% Output : CNFRefutation 8.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 19 unt; 0 nHn; 25 RR)
% Number of literals : 43 ( 12 equ; 21 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-_5r14mdj/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_5r14mdj/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_5r14mdj/input.p',i_0_44) ).
cnf(i_0_192,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_5r14mdj/input.p',i_0_192) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_5r14mdj/input.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_5r14mdj/input.p',i_0_198) ).
cnf(i_0_195,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_5r14mdj/input.p',i_0_195) ).
cnf(i_0_196,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_5r14mdj/input.p',i_0_196) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_5r14mdj/input.p',i_0_200) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_5r14mdj/input.p',i_0_201) ).
cnf(c_0_212,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_213,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_214,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_215,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
i_0_192 ).
cnf(c_0_216,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_217,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_218,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_213]),c_0_214])]) ).
cnf(c_0_219,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
i_0_195 ).
cnf(c_0_220,negated_conjecture,
ssList(esk52_0),
i_0_196 ).
cnf(c_0_221,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_222,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_223,negated_conjecture,
~ segmentP(esk51_0,esk50_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_216]),c_0_217]) ).
cnf(c_0_224,negated_conjecture,
( segmentP(X1,esk50_0)
| esk51_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_220]),c_0_221])]) ).
cnf(c_0_225,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_222,c_0_217]) ).
cnf(c_0_226,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC371+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 22:15:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/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
% 8.19/2.49 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.19/2.49 # Version: 2.1pre011
% 8.19/2.49 # Preprocessing time : 0.022 s
% 8.19/2.49
% 8.19/2.49 # Proof found!
% 8.19/2.49 # SZS status Theorem
% 8.19/2.49 # SZS output start CNFRefutation
% See solution above
% 8.19/2.49 # Proof object total steps : 25
% 8.19/2.49 # Proof object clause steps : 15
% 8.19/2.49 # Proof object formula steps : 10
% 8.19/2.49 # Proof object conjectures : 18
% 8.19/2.49 # Proof object clause conjectures : 11
% 8.19/2.49 # Proof object formula conjectures : 7
% 8.19/2.49 # Proof object initial clauses used : 10
% 8.19/2.49 # Proof object initial formulas used : 10
% 8.19/2.49 # Proof object generating inferences : 3
% 8.19/2.49 # Proof object simplifying inferences : 10
% 8.19/2.49 # Training examples: 0 positive, 0 negative
% 8.19/2.49 # Parsed axioms : 200
% 8.19/2.49 # Removed by relevancy pruning/SinE : 0
% 8.19/2.49 # Initial clauses : 200
% 8.19/2.49 # Removed in clause preprocessing : 0
% 8.19/2.49 # Initial clauses in saturation : 200
% 8.19/2.49 # Processed clauses : 398
% 8.19/2.49 # ...of these trivial : 14
% 8.19/2.49 # ...subsumed : 85
% 8.19/2.49 # ...remaining for further processing : 299
% 8.19/2.49 # Other redundant clauses eliminated : 101
% 8.19/2.49 # Clauses deleted for lack of memory : 0
% 8.19/2.49 # Backward-subsumed : 13
% 8.19/2.49 # Backward-rewritten : 1
% 8.19/2.49 # Generated clauses : 1472
% 8.19/2.49 # ...of the previous two non-trivial : 1260
% 8.19/2.49 # Contextual simplify-reflections : 83
% 8.19/2.49 # Paramodulations : 1341
% 8.19/2.49 # Factorizations : 0
% 8.19/2.49 # Equation resolutions : 131
% 8.19/2.49 # Propositional unsat checks : 0
% 8.19/2.49 # Propositional unsat check successes : 0
% 8.19/2.49 # Current number of processed clauses : 279
% 8.19/2.49 # Positive orientable unit clauses : 21
% 8.19/2.49 # Positive unorientable unit clauses: 0
% 8.19/2.49 # Negative unit clauses : 8
% 8.19/2.49 # Non-unit-clauses : 250
% 8.19/2.49 # Current number of unprocessed clauses: 1052
% 8.19/2.49 # ...number of literals in the above : 7629
% 8.19/2.49 # Current number of archived formulas : 0
% 8.19/2.49 # Current number of archived clauses : 14
% 8.19/2.49 # Clause-clause subsumption calls (NU) : 16030
% 8.19/2.49 # Rec. Clause-clause subsumption calls : 3108
% 8.19/2.49 # Non-unit clause-clause subsumptions : 143
% 8.19/2.49 # Unit Clause-clause subsumption calls : 447
% 8.19/2.49 # Rewrite failures with RHS unbound : 0
% 8.19/2.49 # BW rewrite match attempts : 1
% 8.19/2.49 # BW rewrite match successes : 1
% 8.19/2.49 # Condensation attempts : 0
% 8.19/2.49 # Condensation successes : 0
% 8.19/2.49 # Termbank termtop insertions : 33391
% 8.19/2.49
% 8.19/2.49 # -------------------------------------------------
% 8.19/2.49 # User time : 0.056 s
% 8.19/2.49 # System time : 0.005 s
% 8.19/2.49 # Total time : 0.061 s
% 8.19/2.49 # ...preprocessing : 0.022 s
% 8.19/2.49 # ...main loop : 0.039 s
% 8.19/2.49 # Maximum resident set size: 7132 pages
% 8.19/2.49
%------------------------------------------------------------------------------