TSTP Solution File: SWV397+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV397+1 : TPTP v8.1.0. Released 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:47:05 EDT 2022
% Result : Theorem 7.25s 2.28s
% Output : CNFRefutation 7.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 2 nHn; 7 RR)
% Number of literals : 11 ( 2 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 12 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_46,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-krya8r8o/input.p',i_0_46) ).
cnf(i_0_33,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-krya8r8o/input.p',i_0_33) ).
cnf(i_0_30,plain,
~ ok(triple(X1,X2,bad)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-krya8r8o/input.p',i_0_30) ).
cnf(i_0_45,negated_conjecture,
~ contains_slb(esk2_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-krya8r8o/input.p',i_0_45) ).
cnf(c_0_51,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
i_0_46 ).
cnf(c_0_52,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
i_0_33 ).
cnf(c_0_53,plain,
~ ok(triple(X1,X2,bad)),
i_0_30 ).
cnf(c_0_54,negated_conjecture,
~ contains_slb(esk2_0,esk4_0),
i_0_45 ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 18:48:50 EDT 2022
% 0.13/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
% 7.25/2.28 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.25/2.28 # Version: 2.1pre011
% 7.25/2.28 # Preprocessing time : 0.019 s
% 7.25/2.28
% 7.25/2.28 # Proof found!
% 7.25/2.28 # SZS status Theorem
% 7.25/2.28 # SZS output start CNFRefutation
% See solution above
% 7.25/2.28 # Proof object total steps : 9
% 7.25/2.28 # Proof object clause steps : 5
% 7.25/2.28 # Proof object formula steps : 4
% 7.25/2.28 # Proof object conjectures : 5
% 7.25/2.28 # Proof object clause conjectures : 3
% 7.25/2.28 # Proof object formula conjectures : 2
% 7.25/2.28 # Proof object initial clauses used : 4
% 7.25/2.28 # Proof object initial formulas used : 4
% 7.25/2.28 # Proof object generating inferences : 1
% 7.25/2.28 # Proof object simplifying inferences : 2
% 7.25/2.28 # Training examples: 0 positive, 0 negative
% 7.25/2.28 # Parsed axioms : 50
% 7.25/2.28 # Removed by relevancy pruning/SinE : 0
% 7.25/2.28 # Initial clauses : 50
% 7.25/2.28 # Removed in clause preprocessing : 0
% 7.25/2.28 # Initial clauses in saturation : 50
% 7.25/2.28 # Processed clauses : 33
% 7.25/2.28 # ...of these trivial : 0
% 7.25/2.28 # ...subsumed : 0
% 7.25/2.28 # ...remaining for further processing : 33
% 7.25/2.28 # Other redundant clauses eliminated : 1
% 7.25/2.28 # Clauses deleted for lack of memory : 0
% 7.25/2.28 # Backward-subsumed : 0
% 7.25/2.28 # Backward-rewritten : 0
% 7.25/2.28 # Generated clauses : 16
% 7.25/2.28 # ...of the previous two non-trivial : 9
% 7.25/2.28 # Contextual simplify-reflections : 1
% 7.25/2.28 # Paramodulations : 13
% 7.25/2.28 # Factorizations : 2
% 7.25/2.28 # Equation resolutions : 1
% 7.25/2.28 # Propositional unsat checks : 0
% 7.25/2.28 # Propositional unsat check successes : 0
% 7.25/2.28 # Current number of processed clauses : 32
% 7.25/2.28 # Positive orientable unit clauses : 10
% 7.25/2.28 # Positive unorientable unit clauses: 0
% 7.25/2.28 # Negative unit clauses : 5
% 7.25/2.28 # Non-unit-clauses : 17
% 7.25/2.28 # Current number of unprocessed clauses: 25
% 7.25/2.28 # ...number of literals in the above : 62
% 7.25/2.28 # Current number of archived formulas : 0
% 7.25/2.28 # Current number of archived clauses : 0
% 7.25/2.28 # Clause-clause subsumption calls (NU) : 21
% 7.25/2.28 # Rec. Clause-clause subsumption calls : 16
% 7.25/2.28 # Non-unit clause-clause subsumptions : 1
% 7.25/2.28 # Unit Clause-clause subsumption calls : 5
% 7.25/2.28 # Rewrite failures with RHS unbound : 0
% 7.25/2.28 # BW rewrite match attempts : 1
% 7.25/2.28 # BW rewrite match successes : 0
% 7.25/2.28 # Condensation attempts : 0
% 7.25/2.28 # Condensation successes : 0
% 7.25/2.28 # Termbank termtop insertions : 1053
% 7.25/2.28
% 7.25/2.28 # -------------------------------------------------
% 7.25/2.28 # User time : 0.014 s
% 7.25/2.28 # System time : 0.007 s
% 7.25/2.28 # Total time : 0.021 s
% 7.25/2.28 # ...preprocessing : 0.019 s
% 7.25/2.28 # ...main loop : 0.001 s
% 7.25/2.28 # Maximum resident set size: 7128 pages
% 7.25/2.28
%------------------------------------------------------------------------------