TSTP Solution File: SWV210+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV210+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:46:13 EDT 2022
% Result : Theorem 8.71s 2.54s
% Output : CNFRefutation 8.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 30 ( 5 equ; 16 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-3 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_201,plain,
( a_select3(z_defuse,X1,X2) = use
| ~ epred2_0
| ~ leq(X2,n998)
| ~ leq(X1,n2)
| ~ leq(n0,X2)
| ~ leq(n0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-blxy3efu/input.p',i_0_201) ).
cnf(i_0_138,negated_conjecture,
epred2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-blxy3efu/input.p',i_0_138) ).
cnf(i_0_133,negated_conjecture,
a_select3(z_defuse,esk21_0,esk22_0) != use,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-blxy3efu/input.p',i_0_133) ).
cnf(i_0_134,negated_conjecture,
leq(esk22_0,n998),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-blxy3efu/input.p',i_0_134) ).
cnf(i_0_135,negated_conjecture,
leq(esk21_0,n2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-blxy3efu/input.p',i_0_135) ).
cnf(i_0_136,negated_conjecture,
leq(n0,esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-blxy3efu/input.p',i_0_136) ).
cnf(i_0_137,negated_conjecture,
leq(n0,esk21_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-blxy3efu/input.p',i_0_137) ).
cnf(c_0_209,plain,
( a_select3(z_defuse,X1,X2) = use
| ~ epred2_0
| ~ leq(X2,n998)
| ~ leq(X1,n2)
| ~ leq(n0,X2)
| ~ leq(n0,X1) ),
i_0_201 ).
cnf(c_0_210,negated_conjecture,
epred2_0,
i_0_138 ).
cnf(c_0_211,negated_conjecture,
a_select3(z_defuse,esk21_0,esk22_0) != use,
i_0_133 ).
cnf(c_0_212,plain,
( a_select3(z_defuse,X1,X2) = use
| ~ leq(X2,n998)
| ~ leq(X1,n2)
| ~ leq(n0,X2)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_209,c_0_210])]) ).
cnf(c_0_213,negated_conjecture,
leq(esk22_0,n998),
i_0_134 ).
cnf(c_0_214,negated_conjecture,
leq(esk21_0,n2),
i_0_135 ).
cnf(c_0_215,negated_conjecture,
leq(n0,esk22_0),
i_0_136 ).
cnf(c_0_216,negated_conjecture,
leq(n0,esk21_0),
i_0_137 ).
cnf(c_0_217,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_211,c_0_212]),c_0_213]),c_0_214]),c_0_215]),c_0_216])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV210+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 14:38:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.71/2.54 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.71/2.54 # Version: 2.1pre011
% 8.71/2.54 # Preprocessing time : 0.016 s
% 8.71/2.54
% 8.71/2.54 # Proof found!
% 8.71/2.54 # SZS status Theorem
% 8.71/2.54 # SZS output start CNFRefutation
% See solution above
% 8.71/2.54 # Proof object total steps : 16
% 8.71/2.54 # Proof object clause steps : 9
% 8.71/2.54 # Proof object formula steps : 7
% 8.71/2.54 # Proof object conjectures : 13
% 8.71/2.54 # Proof object clause conjectures : 7
% 8.71/2.54 # Proof object formula conjectures : 6
% 8.71/2.54 # Proof object initial clauses used : 7
% 8.71/2.54 # Proof object initial formulas used : 7
% 8.71/2.54 # Proof object generating inferences : 1
% 8.71/2.54 # Proof object simplifying inferences : 7
% 8.71/2.54 # Training examples: 0 positive, 0 negative
% 8.71/2.54 # Parsed axioms : 227
% 8.71/2.54 # Removed by relevancy pruning/SinE : 0
% 8.71/2.54 # Initial clauses : 227
% 8.71/2.54 # Removed in clause preprocessing : 0
% 8.71/2.54 # Initial clauses in saturation : 227
% 8.71/2.54 # Processed clauses : 37
% 8.71/2.54 # ...of these trivial : 0
% 8.71/2.54 # ...subsumed : 0
% 8.71/2.54 # ...remaining for further processing : 37
% 8.71/2.54 # Other redundant clauses eliminated : 0
% 8.71/2.54 # Clauses deleted for lack of memory : 0
% 8.71/2.54 # Backward-subsumed : 0
% 8.71/2.54 # Backward-rewritten : 0
% 8.71/2.54 # Generated clauses : 28
% 8.71/2.54 # ...of the previous two non-trivial : 23
% 8.71/2.54 # Contextual simplify-reflections : 0
% 8.71/2.54 # Paramodulations : 26
% 8.71/2.54 # Factorizations : 2
% 8.71/2.54 # Equation resolutions : 0
% 8.71/2.54 # Propositional unsat checks : 0
% 8.71/2.54 # Propositional unsat check successes : 0
% 8.71/2.54 # Current number of processed clauses : 37
% 8.71/2.54 # Positive orientable unit clauses : 25
% 8.71/2.54 # Positive unorientable unit clauses: 0
% 8.71/2.54 # Negative unit clauses : 3
% 8.71/2.54 # Non-unit-clauses : 9
% 8.71/2.54 # Current number of unprocessed clauses: 213
% 8.71/2.54 # ...number of literals in the above : 844
% 8.71/2.54 # Current number of archived formulas : 0
% 8.71/2.54 # Current number of archived clauses : 0
% 8.71/2.54 # Clause-clause subsumption calls (NU) : 25
% 8.71/2.54 # Rec. Clause-clause subsumption calls : 6
% 8.71/2.54 # Non-unit clause-clause subsumptions : 0
% 8.71/2.54 # Unit Clause-clause subsumption calls : 2
% 8.71/2.54 # Rewrite failures with RHS unbound : 0
% 8.71/2.54 # BW rewrite match attempts : 6
% 8.71/2.54 # BW rewrite match successes : 0
% 8.71/2.54 # Condensation attempts : 0
% 8.71/2.54 # Condensation successes : 0
% 8.71/2.54 # Termbank termtop insertions : 7468
% 8.71/2.54
% 8.71/2.54 # -------------------------------------------------
% 8.71/2.54 # User time : 0.017 s
% 8.71/2.54 # System time : 0.000 s
% 8.71/2.54 # Total time : 0.017 s
% 8.71/2.54 # ...preprocessing : 0.016 s
% 8.71/2.54 # ...main loop : 0.001 s
% 8.71/2.54 # Maximum resident set size: 7136 pages
% 8.71/2.54
%------------------------------------------------------------------------------