TSTP Solution File: SWV383+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:03 EDT 2022
% Result : Theorem 7.37s 2.32s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_50,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8mtypsgt/input.p',i_0_50) ).
cnf(i_0_47,negated_conjecture,
succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8mtypsgt/input.p',i_0_47) ).
cnf(i_0_46,negated_conjecture,
ok(triple(esk4_0,esk5_0,esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8mtypsgt/input.p',i_0_46) ).
cnf(i_0_45,negated_conjecture,
check_cpq(triple(esk4_0,esk5_0,esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8mtypsgt/input.p',i_0_45) ).
cnf(i_0_48,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8mtypsgt/input.p',i_0_48) ).
cnf(c_0_56,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6)) ),
i_0_50 ).
cnf(c_0_57,negated_conjecture,
succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)),
i_0_47 ).
cnf(c_0_58,negated_conjecture,
ok(triple(esk4_0,esk5_0,esk6_0)),
i_0_46 ).
cnf(c_0_59,negated_conjecture,
check_cpq(triple(esk4_0,esk5_0,esk6_0)),
i_0_45 ).
cnf(c_0_60,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
i_0_48 ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59])]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV383+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 : n025.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 23:35:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.37/2.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.37/2.32 # Version: 2.1pre011
% 7.37/2.32 # Preprocessing time : 0.012 s
% 7.37/2.32
% 7.37/2.32 # Proof found!
% 7.37/2.32 # SZS status Theorem
% 7.37/2.32 # SZS output start CNFRefutation
% See solution above
% 7.37/2.32 # Proof object total steps : 11
% 7.37/2.32 # Proof object clause steps : 6
% 7.37/2.32 # Proof object formula steps : 5
% 7.37/2.32 # Proof object conjectures : 9
% 7.37/2.32 # Proof object clause conjectures : 5
% 7.37/2.32 # Proof object formula conjectures : 4
% 7.37/2.32 # Proof object initial clauses used : 5
% 7.37/2.32 # Proof object initial formulas used : 5
% 7.37/2.32 # Proof object generating inferences : 1
% 7.37/2.32 # Proof object simplifying inferences : 4
% 7.37/2.32 # Training examples: 0 positive, 0 negative
% 7.37/2.32 # Parsed axioms : 54
% 7.37/2.32 # Removed by relevancy pruning/SinE : 0
% 7.37/2.32 # Initial clauses : 54
% 7.37/2.32 # Removed in clause preprocessing : 0
% 7.37/2.32 # Initial clauses in saturation : 54
% 7.37/2.32 # Processed clauses : 25
% 7.37/2.32 # ...of these trivial : 0
% 7.37/2.32 # ...subsumed : 0
% 7.37/2.32 # ...remaining for further processing : 25
% 7.37/2.32 # Other redundant clauses eliminated : 0
% 7.37/2.32 # Clauses deleted for lack of memory : 0
% 7.37/2.32 # Backward-subsumed : 0
% 7.37/2.32 # Backward-rewritten : 0
% 7.37/2.32 # Generated clauses : 10
% 7.37/2.32 # ...of the previous two non-trivial : 4
% 7.37/2.32 # Contextual simplify-reflections : 1
% 7.37/2.32 # Paramodulations : 8
% 7.37/2.32 # Factorizations : 2
% 7.37/2.32 # Equation resolutions : 0
% 7.37/2.32 # Propositional unsat checks : 0
% 7.37/2.32 # Propositional unsat check successes : 0
% 7.37/2.32 # Current number of processed clauses : 25
% 7.37/2.32 # Positive orientable unit clauses : 9
% 7.37/2.32 # Positive unorientable unit clauses: 0
% 7.37/2.32 # Negative unit clauses : 5
% 7.37/2.32 # Non-unit-clauses : 11
% 7.37/2.32 # Current number of unprocessed clauses: 33
% 7.37/2.32 # ...number of literals in the above : 80
% 7.37/2.32 # Current number of archived formulas : 0
% 7.37/2.32 # Current number of archived clauses : 0
% 7.37/2.32 # Clause-clause subsumption calls (NU) : 12
% 7.37/2.32 # Rec. Clause-clause subsumption calls : 10
% 7.37/2.32 # Non-unit clause-clause subsumptions : 1
% 7.37/2.32 # Unit Clause-clause subsumption calls : 8
% 7.37/2.32 # Rewrite failures with RHS unbound : 0
% 7.37/2.32 # BW rewrite match attempts : 1
% 7.37/2.32 # BW rewrite match successes : 0
% 7.37/2.32 # Condensation attempts : 0
% 7.37/2.32 # Condensation successes : 0
% 7.37/2.32 # Termbank termtop insertions : 1027
% 7.37/2.32
% 7.37/2.32 # -------------------------------------------------
% 7.37/2.32 # User time : 0.009 s
% 7.37/2.32 # System time : 0.003 s
% 7.37/2.32 # Total time : 0.012 s
% 7.37/2.32 # ...preprocessing : 0.012 s
% 7.37/2.32 # ...main loop : 0.001 s
% 7.37/2.32 # Maximum resident set size: 7124 pages
% 7.37/2.32
%------------------------------------------------------------------------------