TSTP Solution File: SWV388+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV388+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:04 EDT 2022
% Result : Theorem 7.69s 2.44s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_48,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3l077f9x/input.p',i_0_48) ).
cnf(i_0_46,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3l077f9x/input.p',i_0_46) ).
cnf(i_0_47,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3l077f9x/input.p',i_0_47) ).
cnf(c_0_52,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
i_0_48 ).
cnf(c_0_53,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
i_0_46 ).
cnf(c_0_54,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
i_0_47 ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV388+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 20:08:11 EDT 2022
% 0.14/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
% 7.69/2.44 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.69/2.44 # Version: 2.1pre011
% 7.69/2.44 # Preprocessing time : 0.019 s
% 7.69/2.44
% 7.69/2.44 # Proof found!
% 7.69/2.44 # SZS status Theorem
% 7.69/2.44 # SZS output start CNFRefutation
% See solution above
% 7.69/2.44 # Proof object total steps : 7
% 7.69/2.44 # Proof object clause steps : 4
% 7.69/2.44 # Proof object formula steps : 3
% 7.69/2.44 # Proof object conjectures : 5
% 7.69/2.44 # Proof object clause conjectures : 3
% 7.69/2.44 # Proof object formula conjectures : 2
% 7.69/2.44 # Proof object initial clauses used : 3
% 7.69/2.44 # Proof object initial formulas used : 3
% 7.69/2.44 # Proof object generating inferences : 1
% 7.69/2.44 # Proof object simplifying inferences : 1
% 7.69/2.44 # Training examples: 0 positive, 0 negative
% 7.69/2.44 # Parsed axioms : 52
% 7.69/2.44 # Removed by relevancy pruning/SinE : 0
% 7.69/2.44 # Initial clauses : 52
% 7.69/2.44 # Removed in clause preprocessing : 0
% 7.69/2.44 # Initial clauses in saturation : 52
% 7.69/2.44 # Processed clauses : 13
% 7.69/2.44 # ...of these trivial : 0
% 7.69/2.44 # ...subsumed : 0
% 7.69/2.44 # ...remaining for further processing : 13
% 7.69/2.44 # Other redundant clauses eliminated : 0
% 7.69/2.44 # Clauses deleted for lack of memory : 0
% 7.69/2.44 # Backward-subsumed : 0
% 7.69/2.44 # Backward-rewritten : 0
% 7.69/2.44 # Generated clauses : 3
% 7.69/2.44 # ...of the previous two non-trivial : 0
% 7.69/2.44 # Contextual simplify-reflections : 0
% 7.69/2.44 # Paramodulations : 1
% 7.69/2.44 # Factorizations : 2
% 7.69/2.44 # Equation resolutions : 0
% 7.69/2.44 # Propositional unsat checks : 0
% 7.69/2.44 # Propositional unsat check successes : 0
% 7.69/2.44 # Current number of processed clauses : 13
% 7.69/2.44 # Positive orientable unit clauses : 6
% 7.69/2.44 # Positive unorientable unit clauses: 0
% 7.69/2.44 # Negative unit clauses : 5
% 7.69/2.44 # Non-unit-clauses : 2
% 7.69/2.44 # Current number of unprocessed clauses: 39
% 7.69/2.44 # ...number of literals in the above : 88
% 7.69/2.44 # Current number of archived formulas : 0
% 7.69/2.44 # Current number of archived clauses : 0
% 7.69/2.44 # Clause-clause subsumption calls (NU) : 0
% 7.69/2.44 # Rec. Clause-clause subsumption calls : 0
% 7.69/2.44 # Non-unit clause-clause subsumptions : 0
% 7.69/2.44 # Unit Clause-clause subsumption calls : 1
% 7.69/2.44 # Rewrite failures with RHS unbound : 0
% 7.69/2.44 # BW rewrite match attempts : 0
% 7.69/2.44 # BW rewrite match successes : 0
% 7.69/2.44 # Condensation attempts : 0
% 7.69/2.44 # Condensation successes : 0
% 7.69/2.44 # Termbank termtop insertions : 808
% 7.69/2.44
% 7.69/2.44 # -------------------------------------------------
% 7.69/2.44 # User time : 0.013 s
% 7.69/2.44 # System time : 0.006 s
% 7.69/2.44 # Total time : 0.019 s
% 7.69/2.44 # ...preprocessing : 0.019 s
% 7.69/2.44 # ...main loop : 0.000 s
% 7.69/2.44 # Maximum resident set size: 7124 pages
% 7.69/2.44
%------------------------------------------------------------------------------