TSTP Solution File: SWV229+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV229+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:46:17 EDT 2022
% Result : Theorem 7.71s 2.32s
% Output : CNFRefutation 7.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 4 unt; 0 nHn; 10 RR)
% Number of literals : 18 ( 8 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 14 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_221,plain,
( n1 != X1
| n4 != X2
| ~ epred3_2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qf673oea/input.p',i_0_221) ).
cnf(i_0_197,plain,
( n4 = X1
| ~ epred3_2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qf673oea/input.p',i_0_197) ).
cnf(i_0_199,plain,
( n1 = X1
| ~ epred3_2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qf673oea/input.p',i_0_199) ).
cnf(i_0_126,negated_conjecture,
epred3_2(esk21_0,esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qf673oea/input.p',i_0_126) ).
cnf(c_0_226,plain,
( n1 != X1
| n4 != X2
| ~ epred3_2(X1,X2) ),
i_0_221 ).
cnf(c_0_227,plain,
( n4 = X1
| ~ epred3_2(X2,X1) ),
i_0_197 ).
cnf(c_0_228,plain,
( n1 = X1
| ~ epred3_2(X1,X2) ),
i_0_199 ).
cnf(c_0_229,negated_conjecture,
epred3_2(esk21_0,esk22_0),
i_0_126 ).
cnf(c_0_230,plain,
~ epred3_2(X1,X2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_226,c_0_227]),c_0_228]) ).
cnf(c_0_231,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_229,c_0_230]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV229+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n004.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 23:35:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.71/2.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.71/2.32 # Version: 2.1pre011
% 7.71/2.32 # Preprocessing time : 0.018 s
% 7.71/2.32
% 7.71/2.32 # Proof found!
% 7.71/2.32 # SZS status Theorem
% 7.71/2.32 # SZS output start CNFRefutation
% See solution above
% 7.71/2.32 # Proof object total steps : 10
% 7.71/2.32 # Proof object clause steps : 6
% 7.71/2.32 # Proof object formula steps : 4
% 7.71/2.32 # Proof object conjectures : 3
% 7.71/2.32 # Proof object clause conjectures : 2
% 7.71/2.32 # Proof object formula conjectures : 1
% 7.71/2.32 # Proof object initial clauses used : 4
% 7.71/2.32 # Proof object initial formulas used : 4
% 7.71/2.32 # Proof object generating inferences : 0
% 7.71/2.32 # Proof object simplifying inferences : 3
% 7.71/2.32 # Training examples: 0 positive, 0 negative
% 7.71/2.32 # Parsed axioms : 226
% 7.71/2.32 # Removed by relevancy pruning/SinE : 0
% 7.71/2.32 # Initial clauses : 226
% 7.71/2.32 # Removed in clause preprocessing : 0
% 7.71/2.32 # Initial clauses in saturation : 226
% 7.71/2.32 # Processed clauses : 61
% 7.71/2.32 # ...of these trivial : 0
% 7.71/2.32 # ...subsumed : 0
% 7.71/2.32 # ...remaining for further processing : 61
% 7.71/2.32 # Other redundant clauses eliminated : 0
% 7.71/2.32 # Clauses deleted for lack of memory : 0
% 7.71/2.32 # Backward-subsumed : 2
% 7.71/2.32 # Backward-rewritten : 1
% 7.71/2.32 # Generated clauses : 78
% 7.71/2.32 # ...of the previous two non-trivial : 72
% 7.71/2.32 # Contextual simplify-reflections : 6
% 7.71/2.32 # Paramodulations : 73
% 7.71/2.32 # Factorizations : 4
% 7.71/2.32 # Equation resolutions : 0
% 7.71/2.32 # Propositional unsat checks : 0
% 7.71/2.32 # Propositional unsat check successes : 0
% 7.71/2.32 # Current number of processed clauses : 57
% 7.71/2.32 # Positive orientable unit clauses : 31
% 7.71/2.32 # Positive unorientable unit clauses: 1
% 7.71/2.32 # Negative unit clauses : 3
% 7.71/2.32 # Non-unit-clauses : 22
% 7.71/2.32 # Current number of unprocessed clauses: 221
% 7.71/2.32 # ...number of literals in the above : 897
% 7.71/2.32 # Current number of archived formulas : 0
% 7.71/2.32 # Current number of archived clauses : 4
% 7.71/2.32 # Clause-clause subsumption calls (NU) : 119
% 7.71/2.32 # Rec. Clause-clause subsumption calls : 76
% 7.71/2.32 # Non-unit clause-clause subsumptions : 8
% 7.71/2.32 # Unit Clause-clause subsumption calls : 21
% 7.71/2.32 # Rewrite failures with RHS unbound : 0
% 7.71/2.32 # BW rewrite match attempts : 8
% 7.71/2.32 # BW rewrite match successes : 4
% 7.71/2.32 # Condensation attempts : 0
% 7.71/2.32 # Condensation successes : 0
% 7.71/2.32 # Termbank termtop insertions : 7849
% 7.71/2.32
% 7.71/2.32 # -------------------------------------------------
% 7.71/2.32 # User time : 0.012 s
% 7.71/2.32 # System time : 0.007 s
% 7.71/2.32 # Total time : 0.019 s
% 7.71/2.32 # ...preprocessing : 0.018 s
% 7.71/2.32 # ...main loop : 0.001 s
% 7.71/2.32 # Maximum resident set size: 7136 pages
% 7.71/2.32
%------------------------------------------------------------------------------