TSTP Solution File: SWV376+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV376+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:01 EDT 2022
% Result : Theorem 7.32s 2.36s
% Output : CNFRefutation 7.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 14 unt; 5 nHn; 21 RR)
% Number of literals : 42 ( 4 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-3 aty)
% Number of variables : 46 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_49,plain,
( ok(triple(X1,X2,X3))
| ~ ok(triple(X4,X5,X6))
| ~ ok(triple(esk10_0,esk11_0,esk12_0))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-50htkodz/input.p',i_0_49) ).
cnf(i_0_46,negated_conjecture,
succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-50htkodz/input.p',i_0_46) ).
cnf(i_0_45,negated_conjecture,
ok(triple(esk4_0,esk5_0,esk6_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-50htkodz/input.p',i_0_45) ).
cnf(i_0_47,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-50htkodz/input.p',i_0_47) ).
cnf(i_0_31,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-50htkodz/input.p',i_0_31) ).
cnf(i_0_48,plain,
( ok(triple(X1,X2,X3))
| ok(im_succ_cpq(triple(esk10_0,esk11_0,esk12_0)))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-50htkodz/input.p',i_0_48) ).
cnf(i_0_30,plain,
~ ok(triple(X1,X2,bad)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-50htkodz/input.p',i_0_30) ).
cnf(i_0_51,lemma,
( ok(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-50htkodz/input.p',i_0_51) ).
cnf(c_0_60,plain,
( ok(triple(X1,X2,X3))
| ~ ok(triple(X4,X5,X6))
| ~ ok(triple(esk10_0,esk11_0,esk12_0))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6)) ),
i_0_49 ).
cnf(c_0_61,negated_conjecture,
succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)),
i_0_46 ).
cnf(c_0_62,negated_conjecture,
ok(triple(esk4_0,esk5_0,esk6_0)),
i_0_45 ).
cnf(c_0_63,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
i_0_47 ).
cnf(c_0_64,negated_conjecture,
~ ok(triple(esk10_0,esk11_0,esk12_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]),c_0_63]) ).
cnf(c_0_65,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
i_0_31 ).
cnf(c_0_66,plain,
( ok(triple(X1,X2,X3))
| ok(im_succ_cpq(triple(esk10_0,esk11_0,esk12_0)))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6)) ),
i_0_48 ).
cnf(c_0_67,plain,
esk12_0 = bad,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
esk3_0 = bad,
inference(spm,[status(thm)],[c_0_63,c_0_65]) ).
cnf(c_0_69,plain,
( ok(im_succ_cpq(triple(esk10_0,esk11_0,bad)))
| ok(triple(X1,X2,X3))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6)) ),
inference(rw,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
succ_cpq(triple(esk1_0,esk2_0,bad),triple(esk4_0,esk5_0,esk6_0)),
inference(rw,[status(thm)],[c_0_61,c_0_68]) ).
cnf(c_0_71,plain,
~ ok(triple(X1,X2,bad)),
i_0_30 ).
cnf(c_0_72,lemma,
( ok(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
i_0_51 ).
cnf(c_0_73,negated_conjecture,
ok(im_succ_cpq(triple(esk10_0,esk11_0,bad))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_62])]),c_0_71]) ).
cnf(c_0_74,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV376+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n011.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 20:36:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.32/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.32/2.36 # Version: 2.1pre011
% 7.32/2.36 # Preprocessing time : 0.019 s
% 7.32/2.36
% 7.32/2.36 # Proof found!
% 7.32/2.36 # SZS status Theorem
% 7.32/2.36 # SZS output start CNFRefutation
% See solution above
% 7.32/2.36 # Proof object total steps : 23
% 7.32/2.36 # Proof object clause steps : 15
% 7.32/2.36 # Proof object formula steps : 8
% 7.32/2.36 # Proof object conjectures : 10
% 7.32/2.36 # Proof object clause conjectures : 7
% 7.32/2.36 # Proof object formula conjectures : 3
% 7.32/2.36 # Proof object initial clauses used : 8
% 7.32/2.36 # Proof object initial formulas used : 8
% 7.32/2.36 # Proof object generating inferences : 5
% 7.32/2.36 # Proof object simplifying inferences : 9
% 7.32/2.36 # Training examples: 0 positive, 0 negative
% 7.32/2.36 # Parsed axioms : 55
% 7.32/2.36 # Removed by relevancy pruning/SinE : 0
% 7.32/2.36 # Initial clauses : 55
% 7.32/2.36 # Removed in clause preprocessing : 0
% 7.32/2.36 # Initial clauses in saturation : 55
% 7.32/2.36 # Processed clauses : 75
% 7.32/2.36 # ...of these trivial : 0
% 7.32/2.36 # ...subsumed : 6
% 7.32/2.36 # ...remaining for further processing : 69
% 7.32/2.36 # Other redundant clauses eliminated : 3
% 7.32/2.36 # Clauses deleted for lack of memory : 0
% 7.32/2.36 # Backward-subsumed : 0
% 7.32/2.36 # Backward-rewritten : 7
% 7.32/2.36 # Generated clauses : 158
% 7.32/2.36 # ...of the previous two non-trivial : 143
% 7.32/2.36 # Contextual simplify-reflections : 3
% 7.32/2.36 # Paramodulations : 154
% 7.32/2.36 # Factorizations : 2
% 7.32/2.36 # Equation resolutions : 3
% 7.32/2.36 # Propositional unsat checks : 0
% 7.32/2.36 # Propositional unsat check successes : 0
% 7.32/2.36 # Current number of processed clauses : 60
% 7.32/2.36 # Positive orientable unit clauses : 19
% 7.32/2.36 # Positive unorientable unit clauses: 0
% 7.32/2.36 # Negative unit clauses : 6
% 7.32/2.36 # Non-unit-clauses : 35
% 7.32/2.36 # Current number of unprocessed clauses: 88
% 7.32/2.36 # ...number of literals in the above : 290
% 7.32/2.36 # Current number of archived formulas : 0
% 7.32/2.36 # Current number of archived clauses : 7
% 7.32/2.36 # Clause-clause subsumption calls (NU) : 274
% 7.32/2.36 # Rec. Clause-clause subsumption calls : 170
% 7.32/2.36 # Non-unit clause-clause subsumptions : 6
% 7.32/2.36 # Unit Clause-clause subsumption calls : 34
% 7.32/2.36 # Rewrite failures with RHS unbound : 0
% 7.32/2.36 # BW rewrite match attempts : 10
% 7.32/2.36 # BW rewrite match successes : 3
% 7.32/2.36 # Condensation attempts : 0
% 7.32/2.36 # Condensation successes : 0
% 7.32/2.36 # Termbank termtop insertions : 3622
% 7.32/2.36
% 7.32/2.36 # -------------------------------------------------
% 7.32/2.36 # User time : 0.021 s
% 7.32/2.36 # System time : 0.004 s
% 7.32/2.36 # Total time : 0.025 s
% 7.32/2.36 # ...preprocessing : 0.019 s
% 7.32/2.36 # ...main loop : 0.006 s
% 7.32/2.36 # Maximum resident set size: 7132 pages
% 7.32/2.36
%------------------------------------------------------------------------------