TSTP Solution File: SWV223+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV223+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:15 EDT 2022
% Result : Theorem 8.19s 2.58s
% Output : CNFRefutation 8.19s
% 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_227,plain,
( n0 != X1
| n3 != X2
| ~ epred3_2(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nu_0zoj9/input.p',i_0_227) ).
cnf(i_0_197,plain,
( n3 = X1
| ~ epred3_2(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nu_0zoj9/input.p',i_0_197) ).
cnf(i_0_198,plain,
( n0 = X1
| ~ epred3_2(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nu_0zoj9/input.p',i_0_198) ).
cnf(i_0_126,negated_conjecture,
epred3_2(esk22_0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nu_0zoj9/input.p',i_0_126) ).
cnf(c_0_232,plain,
( n0 != X1
| n3 != X2
| ~ epred3_2(X1,X2) ),
i_0_227 ).
cnf(c_0_233,plain,
( n3 = X1
| ~ epred3_2(X2,X1) ),
i_0_197 ).
cnf(c_0_234,plain,
( n0 = X1
| ~ epred3_2(X1,X2) ),
i_0_198 ).
cnf(c_0_235,negated_conjecture,
epred3_2(esk22_0,esk21_0),
i_0_126 ).
cnf(c_0_236,plain,
~ epred3_2(X1,X2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_232,c_0_233]),c_0_234]) ).
cnf(c_0_237,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_235,c_0_236]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV223+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 12:27:36 EDT 2022
% 0.13/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
% 8.19/2.58 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.19/2.58 # Version: 2.1pre011
% 8.19/2.58 # Preprocessing time : 0.028 s
% 8.19/2.58
% 8.19/2.58 # Proof found!
% 8.19/2.58 # SZS status Theorem
% 8.19/2.58 # SZS output start CNFRefutation
% See solution above
% 8.19/2.58 # Proof object total steps : 10
% 8.19/2.58 # Proof object clause steps : 6
% 8.19/2.58 # Proof object formula steps : 4
% 8.19/2.58 # Proof object conjectures : 3
% 8.19/2.58 # Proof object clause conjectures : 2
% 8.19/2.58 # Proof object formula conjectures : 1
% 8.19/2.58 # Proof object initial clauses used : 4
% 8.19/2.58 # Proof object initial formulas used : 4
% 8.19/2.58 # Proof object generating inferences : 0
% 8.19/2.58 # Proof object simplifying inferences : 3
% 8.19/2.58 # Training examples: 0 positive, 0 negative
% 8.19/2.58 # Parsed axioms : 232
% 8.19/2.58 # Removed by relevancy pruning/SinE : 0
% 8.19/2.58 # Initial clauses : 232
% 8.19/2.58 # Removed in clause preprocessing : 0
% 8.19/2.58 # Initial clauses in saturation : 232
% 8.19/2.58 # Processed clauses : 49
% 8.19/2.58 # ...of these trivial : 0
% 8.19/2.58 # ...subsumed : 0
% 8.19/2.58 # ...remaining for further processing : 49
% 8.19/2.58 # Other redundant clauses eliminated : 0
% 8.19/2.58 # Clauses deleted for lack of memory : 0
% 8.19/2.58 # Backward-subsumed : 0
% 8.19/2.58 # Backward-rewritten : 0
% 8.19/2.58 # Generated clauses : 43
% 8.19/2.58 # ...of the previous two non-trivial : 38
% 8.19/2.58 # Contextual simplify-reflections : 5
% 8.19/2.58 # Paramodulations : 40
% 8.19/2.58 # Factorizations : 2
% 8.19/2.58 # Equation resolutions : 0
% 8.19/2.58 # Propositional unsat checks : 0
% 8.19/2.58 # Propositional unsat check successes : 0
% 8.19/2.58 # Current number of processed clauses : 48
% 8.19/2.58 # Positive orientable unit clauses : 29
% 8.19/2.58 # Positive unorientable unit clauses: 0
% 8.19/2.58 # Negative unit clauses : 3
% 8.19/2.58 # Non-unit-clauses : 16
% 8.19/2.58 # Current number of unprocessed clauses: 210
% 8.19/2.58 # ...number of literals in the above : 880
% 8.19/2.58 # Current number of archived formulas : 0
% 8.19/2.58 # Current number of archived clauses : 1
% 8.19/2.58 # Clause-clause subsumption calls (NU) : 37
% 8.19/2.58 # Rec. Clause-clause subsumption calls : 29
% 8.19/2.58 # Non-unit clause-clause subsumptions : 5
% 8.19/2.58 # Unit Clause-clause subsumption calls : 18
% 8.19/2.58 # Rewrite failures with RHS unbound : 0
% 8.19/2.58 # BW rewrite match attempts : 4
% 8.19/2.58 # BW rewrite match successes : 0
% 8.19/2.58 # Condensation attempts : 0
% 8.19/2.58 # Condensation successes : 0
% 8.19/2.58 # Termbank termtop insertions : 7575
% 8.19/2.58
% 8.19/2.58 # -------------------------------------------------
% 8.19/2.58 # User time : 0.024 s
% 8.19/2.58 # System time : 0.006 s
% 8.19/2.58 # Total time : 0.030 s
% 8.19/2.58 # ...preprocessing : 0.028 s
% 8.19/2.58 # ...main loop : 0.002 s
% 8.19/2.58 # Maximum resident set size: 7124 pages
% 8.19/2.58
%------------------------------------------------------------------------------