TSTP Solution File: SWV206+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV206+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:12 EDT 2022
% Result : Theorem 6.78s 2.27s
% Output : CNFRefutation 6.78s
% 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_202,plain,
( a_select3(u_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-2k5f4wfb/input.p',i_0_202) ).
cnf(i_0_138,negated_conjecture,
epred2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2k5f4wfb/input.p',i_0_138) ).
cnf(i_0_133,negated_conjecture,
a_select3(u_defuse,esk21_0,esk22_0) != use,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2k5f4wfb/input.p',i_0_133) ).
cnf(i_0_134,negated_conjecture,
leq(esk22_0,n998),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2k5f4wfb/input.p',i_0_134) ).
cnf(i_0_135,negated_conjecture,
leq(esk21_0,n2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2k5f4wfb/input.p',i_0_135) ).
cnf(i_0_136,negated_conjecture,
leq(n0,esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2k5f4wfb/input.p',i_0_136) ).
cnf(i_0_137,negated_conjecture,
leq(n0,esk21_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2k5f4wfb/input.p',i_0_137) ).
cnf(c_0_210,plain,
( a_select3(u_defuse,X1,X2) = use
| ~ epred2_0
| ~ leq(X2,n998)
| ~ leq(X1,n2)
| ~ leq(n0,X2)
| ~ leq(n0,X1) ),
i_0_202 ).
cnf(c_0_211,negated_conjecture,
epred2_0,
i_0_138 ).
cnf(c_0_212,negated_conjecture,
a_select3(u_defuse,esk21_0,esk22_0) != use,
i_0_133 ).
cnf(c_0_213,plain,
( a_select3(u_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_210,c_0_211])]) ).
cnf(c_0_214,negated_conjecture,
leq(esk22_0,n998),
i_0_134 ).
cnf(c_0_215,negated_conjecture,
leq(esk21_0,n2),
i_0_135 ).
cnf(c_0_216,negated_conjecture,
leq(n0,esk22_0),
i_0_136 ).
cnf(c_0_217,negated_conjecture,
leq(n0,esk21_0),
i_0_137 ).
cnf(c_0_218,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_212,c_0_213]),c_0_214]),c_0_215]),c_0_216]),c_0_217])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV206+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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 : Tue Jun 14 15:28:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.78/2.27 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 6.78/2.27 # Version: 2.1pre011
% 6.78/2.27 # Preprocessing time : 0.015 s
% 6.78/2.27
% 6.78/2.27 # Proof found!
% 6.78/2.27 # SZS status Theorem
% 6.78/2.27 # SZS output start CNFRefutation
% See solution above
% 6.78/2.27 # Proof object total steps : 16
% 6.78/2.27 # Proof object clause steps : 9
% 6.78/2.27 # Proof object formula steps : 7
% 6.78/2.27 # Proof object conjectures : 13
% 6.78/2.27 # Proof object clause conjectures : 7
% 6.78/2.27 # Proof object formula conjectures : 6
% 6.78/2.27 # Proof object initial clauses used : 7
% 6.78/2.27 # Proof object initial formulas used : 7
% 6.78/2.27 # Proof object generating inferences : 1
% 6.78/2.27 # Proof object simplifying inferences : 7
% 6.78/2.27 # Training examples: 0 positive, 0 negative
% 6.78/2.27 # Parsed axioms : 227
% 6.78/2.27 # Removed by relevancy pruning/SinE : 0
% 6.78/2.27 # Initial clauses : 227
% 6.78/2.27 # Removed in clause preprocessing : 0
% 6.78/2.27 # Initial clauses in saturation : 227
% 6.78/2.27 # Processed clauses : 37
% 6.78/2.27 # ...of these trivial : 0
% 6.78/2.27 # ...subsumed : 0
% 6.78/2.27 # ...remaining for further processing : 37
% 6.78/2.27 # Other redundant clauses eliminated : 0
% 6.78/2.27 # Clauses deleted for lack of memory : 0
% 6.78/2.27 # Backward-subsumed : 0
% 6.78/2.27 # Backward-rewritten : 0
% 6.78/2.27 # Generated clauses : 25
% 6.78/2.27 # ...of the previous two non-trivial : 22
% 6.78/2.27 # Contextual simplify-reflections : 0
% 6.78/2.27 # Paramodulations : 23
% 6.78/2.27 # Factorizations : 2
% 6.78/2.27 # Equation resolutions : 0
% 6.78/2.27 # Propositional unsat checks : 0
% 6.78/2.27 # Propositional unsat check successes : 0
% 6.78/2.27 # Current number of processed clauses : 37
% 6.78/2.27 # Positive orientable unit clauses : 27
% 6.78/2.27 # Positive unorientable unit clauses: 0
% 6.78/2.27 # Negative unit clauses : 3
% 6.78/2.27 # Non-unit-clauses : 7
% 6.78/2.27 # Current number of unprocessed clauses: 212
% 6.78/2.27 # ...number of literals in the above : 844
% 6.78/2.27 # Current number of archived formulas : 0
% 6.78/2.27 # Current number of archived clauses : 0
% 6.78/2.27 # Clause-clause subsumption calls (NU) : 25
% 6.78/2.27 # Rec. Clause-clause subsumption calls : 6
% 6.78/2.27 # Non-unit clause-clause subsumptions : 0
% 6.78/2.27 # Unit Clause-clause subsumption calls : 2
% 6.78/2.27 # Rewrite failures with RHS unbound : 0
% 6.78/2.27 # BW rewrite match attempts : 6
% 6.78/2.27 # BW rewrite match successes : 0
% 6.78/2.27 # Condensation attempts : 0
% 6.78/2.27 # Condensation successes : 0
% 6.78/2.27 # Termbank termtop insertions : 7448
% 6.78/2.27
% 6.78/2.27 # -------------------------------------------------
% 6.78/2.27 # User time : 0.014 s
% 6.78/2.27 # System time : 0.002 s
% 6.78/2.27 # Total time : 0.016 s
% 6.78/2.27 # ...preprocessing : 0.015 s
% 6.78/2.27 # ...main loop : 0.001 s
% 6.78/2.27 # Maximum resident set size: 7136 pages
% 6.78/2.27
%------------------------------------------------------------------------------