TSTP Solution File: SWV142+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV142+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 : Wed Jul 20 17:45:59 EDT 2022
% Result : Theorem 8.41s 2.64s
% Output : CNFRefutation 8.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 9 unt; 0 nHn; 15 RR)
% Number of literals : 23 ( 2 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_166,plain,
( leq(s_best7,n3)
| ~ epred1_0
| ~ gt(loopcounter,n0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc072h2b/input.p',i_0_166) ).
cnf(i_0_10,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc072h2b/input.p',i_0_10) ).
cnf(i_0_9,negated_conjecture,
~ leq(s_best7,n3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc072h2b/input.p',i_0_9) ).
cnf(i_0_176,plain,
( leq(n1,loopcounter)
| ~ epred1_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc072h2b/input.p',i_0_176) ).
cnf(i_0_40,plain,
( gt(X1,X2)
| ~ leq(plus(X2,n1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc072h2b/input.p',i_0_40) ).
cnf(i_0_140,plain,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc072h2b/input.p',i_0_140) ).
cnf(c_0_183,plain,
( leq(s_best7,n3)
| ~ epred1_0
| ~ gt(loopcounter,n0) ),
i_0_166 ).
cnf(c_0_184,negated_conjecture,
epred1_0,
i_0_10 ).
cnf(c_0_185,negated_conjecture,
~ leq(s_best7,n3),
i_0_9 ).
cnf(c_0_186,plain,
( leq(n1,loopcounter)
| ~ epred1_0 ),
i_0_176 ).
cnf(c_0_187,plain,
~ gt(loopcounter,n0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_184])]),c_0_185]) ).
cnf(c_0_188,plain,
( gt(X1,X2)
| ~ leq(plus(X2,n1),X1) ),
i_0_40 ).
cnf(c_0_189,plain,
plus(n0,n1) = n1,
i_0_140 ).
cnf(c_0_190,plain,
leq(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_186,c_0_184])]) ).
cnf(c_0_191,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_188]),c_0_189]),c_0_190])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV142+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n022.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 : Tue Jun 14 14:27:19 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.22/0.49 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.41/2.64 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.41/2.64 # Version: 2.1pre011
% 8.41/2.64 # Preprocessing time : 0.028 s
% 8.41/2.64
% 8.41/2.64 # Proof found!
% 8.41/2.64 # SZS status Theorem
% 8.41/2.64 # SZS output start CNFRefutation
% See solution above
% 8.41/2.64 # Proof object total steps : 15
% 8.41/2.64 # Proof object clause steps : 9
% 8.41/2.64 # Proof object formula steps : 6
% 8.41/2.64 # Proof object conjectures : 4
% 8.41/2.64 # Proof object clause conjectures : 2
% 8.41/2.64 # Proof object formula conjectures : 2
% 8.41/2.64 # Proof object initial clauses used : 6
% 8.41/2.64 # Proof object initial formulas used : 6
% 8.41/2.64 # Proof object generating inferences : 1
% 8.41/2.64 # Proof object simplifying inferences : 8
% 8.41/2.64 # Training examples: 0 positive, 0 negative
% 8.41/2.64 # Parsed axioms : 200
% 8.41/2.64 # Removed by relevancy pruning/SinE : 0
% 8.41/2.64 # Initial clauses : 200
% 8.41/2.64 # Removed in clause preprocessing : 0
% 8.41/2.64 # Initial clauses in saturation : 200
% 8.41/2.64 # Processed clauses : 45
% 8.41/2.64 # ...of these trivial : 1
% 8.41/2.64 # ...subsumed : 2
% 8.41/2.64 # ...remaining for further processing : 42
% 8.41/2.64 # Other redundant clauses eliminated : 0
% 8.41/2.64 # Clauses deleted for lack of memory : 0
% 8.41/2.64 # Backward-subsumed : 0
% 8.41/2.64 # Backward-rewritten : 0
% 8.41/2.64 # Generated clauses : 71
% 8.41/2.64 # ...of the previous two non-trivial : 61
% 8.41/2.64 # Contextual simplify-reflections : 0
% 8.41/2.64 # Paramodulations : 69
% 8.41/2.64 # Factorizations : 2
% 8.41/2.64 # Equation resolutions : 0
% 8.41/2.64 # Propositional unsat checks : 0
% 8.41/2.64 # Propositional unsat check successes : 0
% 8.41/2.64 # Current number of processed clauses : 42
% 8.41/2.64 # Positive orientable unit clauses : 27
% 8.41/2.64 # Positive unorientable unit clauses: 0
% 8.41/2.64 # Negative unit clauses : 3
% 8.41/2.64 # Non-unit-clauses : 12
% 8.41/2.64 # Current number of unprocessed clauses: 216
% 8.41/2.64 # ...number of literals in the above : 869
% 8.41/2.64 # Current number of archived formulas : 0
% 8.41/2.64 # Current number of archived clauses : 0
% 8.41/2.64 # Clause-clause subsumption calls (NU) : 5
% 8.41/2.64 # Rec. Clause-clause subsumption calls : 1
% 8.41/2.64 # Non-unit clause-clause subsumptions : 0
% 8.41/2.64 # Unit Clause-clause subsumption calls : 13
% 8.41/2.64 # Rewrite failures with RHS unbound : 0
% 8.41/2.64 # BW rewrite match attempts : 3
% 8.41/2.64 # BW rewrite match successes : 0
% 8.41/2.64 # Condensation attempts : 0
% 8.41/2.64 # Condensation successes : 0
% 8.41/2.64 # Termbank termtop insertions : 7491
% 8.41/2.64
% 8.41/2.64 # -------------------------------------------------
% 8.41/2.64 # User time : 0.027 s
% 8.41/2.64 # System time : 0.003 s
% 8.41/2.64 # Total time : 0.030 s
% 8.41/2.64 # ...preprocessing : 0.028 s
% 8.41/2.64 # ...main loop : 0.002 s
% 8.41/2.64 # Maximum resident set size: 7132 pages
% 8.41/2.64
%------------------------------------------------------------------------------