TSTP Solution File: SWV078+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV078+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:45 EDT 2022
% Result : Theorem 7.48s 2.40s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( ~ true
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-51qveizi/input.p',i_0_1) ).
cnf(i_0_166,plain,
true,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-51qveizi/input.p',i_0_166) ).
cnf(i_0_6,negated_conjecture,
leq(n0,pv31),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-51qveizi/input.p',i_0_6) ).
cnf(i_0_5,negated_conjecture,
leq(pv31,minus(n5,n1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-51qveizi/input.p',i_0_5) ).
cnf(c_0_171,negated_conjecture,
( ~ true
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ),
i_0_1 ).
cnf(c_0_172,plain,
true,
i_0_166 ).
cnf(c_0_173,negated_conjecture,
leq(n0,pv31),
i_0_6 ).
cnf(c_0_174,negated_conjecture,
leq(pv31,minus(n5,n1)),
i_0_5 ).
cnf(c_0_175,negated_conjecture,
~ leq(pv31,minus(n5,n1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_171,c_0_172]),c_0_173])]) ).
cnf(c_0_176,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_174,c_0_175]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV078+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 16 05:58:10 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.48/2.40 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.48/2.40 # Version: 2.1pre011
% 7.48/2.40 # Preprocessing time : 0.016 s
% 7.48/2.40
% 7.48/2.40 # Proof found!
% 7.48/2.40 # SZS status Theorem
% 7.48/2.40 # SZS output start CNFRefutation
% See solution above
% 7.48/2.40 # Proof object total steps : 10
% 7.48/2.40 # Proof object clause steps : 6
% 7.48/2.40 # Proof object formula steps : 4
% 7.48/2.40 # Proof object conjectures : 8
% 7.48/2.40 # Proof object clause conjectures : 5
% 7.48/2.40 # Proof object formula conjectures : 3
% 7.48/2.40 # Proof object initial clauses used : 4
% 7.48/2.40 # Proof object initial formulas used : 4
% 7.48/2.40 # Proof object generating inferences : 0
% 7.48/2.40 # Proof object simplifying inferences : 4
% 7.48/2.40 # Training examples: 0 positive, 0 negative
% 7.48/2.40 # Parsed axioms : 190
% 7.48/2.40 # Removed by relevancy pruning/SinE : 0
% 7.48/2.40 # Initial clauses : 190
% 7.48/2.40 # Removed in clause preprocessing : 0
% 7.48/2.40 # Initial clauses in saturation : 190
% 7.48/2.40 # Processed clauses : 13
% 7.48/2.40 # ...of these trivial : 0
% 7.48/2.40 # ...subsumed : 0
% 7.48/2.40 # ...remaining for further processing : 12
% 7.48/2.40 # Other redundant clauses eliminated : 0
% 7.48/2.40 # Clauses deleted for lack of memory : 0
% 7.48/2.40 # Backward-subsumed : 0
% 7.48/2.40 # Backward-rewritten : 1
% 7.48/2.40 # Generated clauses : 0
% 7.48/2.40 # ...of the previous two non-trivial : 1
% 7.48/2.40 # Contextual simplify-reflections : 0
% 7.48/2.40 # Paramodulations : 0
% 7.48/2.40 # Factorizations : 0
% 7.48/2.40 # Equation resolutions : 0
% 7.48/2.40 # Propositional unsat checks : 0
% 7.48/2.40 # Propositional unsat check successes : 0
% 7.48/2.40 # Current number of processed clauses : 11
% 7.48/2.40 # Positive orientable unit clauses : 10
% 7.48/2.40 # Positive unorientable unit clauses: 0
% 7.48/2.40 # Negative unit clauses : 1
% 7.48/2.40 # Non-unit-clauses : 0
% 7.48/2.40 # Current number of unprocessed clauses: 178
% 7.48/2.40 # ...number of literals in the above : 787
% 7.48/2.40 # Current number of archived formulas : 0
% 7.48/2.40 # Current number of archived clauses : 1
% 7.48/2.40 # Clause-clause subsumption calls (NU) : 0
% 7.48/2.40 # Rec. Clause-clause subsumption calls : 0
% 7.48/2.40 # Non-unit clause-clause subsumptions : 0
% 7.48/2.40 # Unit Clause-clause subsumption calls : 0
% 7.48/2.40 # Rewrite failures with RHS unbound : 0
% 7.48/2.40 # BW rewrite match attempts : 3
% 7.48/2.40 # BW rewrite match successes : 1
% 7.48/2.40 # Condensation attempts : 0
% 7.48/2.40 # Condensation successes : 0
% 7.48/2.40 # Termbank termtop insertions : 6656
% 7.48/2.40
% 7.48/2.40 # -------------------------------------------------
% 7.48/2.40 # User time : 0.013 s
% 7.48/2.40 # System time : 0.004 s
% 7.48/2.40 # Total time : 0.016 s
% 7.48/2.40 # ...preprocessing : 0.016 s
% 7.48/2.40 # ...main loop : 0.000 s
% 7.48/2.40 # Maximum resident set size: 7128 pages
% 7.48/2.40
%------------------------------------------------------------------------------