TSTP Solution File: SWV389+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV389+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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 8.05s 2.51s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 7 ( 7 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(remove_cpq(findmin_cpq_eff(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y_hh4w25/input.p',i_0_48) ).
cnf(i_0_45,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y_hh4w25/input.p',i_0_45) ).
cnf(i_0_46,negated_conjecture,
check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y_hh4w25/input.p',i_0_46) ).
cnf(i_0_47,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y_hh4w25/input.p',i_0_47) ).
cnf(c_0_53,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))) ),
i_0_48 ).
cnf(c_0_54,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
i_0_45 ).
cnf(c_0_55,negated_conjecture,
check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
i_0_46 ).
cnf(c_0_56,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
i_0_47 ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV389+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n012.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 13:13:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.05/2.51 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.05/2.51 # Version: 2.1pre011
% 8.05/2.51 # Preprocessing time : 0.014 s
% 8.05/2.51
% 8.05/2.51 # Proof found!
% 8.05/2.51 # SZS status Theorem
% 8.05/2.51 # SZS output start CNFRefutation
% See solution above
% 8.05/2.51 # Proof object total steps : 9
% 8.05/2.51 # Proof object clause steps : 5
% 8.05/2.51 # Proof object formula steps : 4
% 8.05/2.51 # Proof object conjectures : 7
% 8.05/2.51 # Proof object clause conjectures : 4
% 8.05/2.51 # Proof object formula conjectures : 3
% 8.05/2.51 # Proof object initial clauses used : 4
% 8.05/2.51 # Proof object initial formulas used : 4
% 8.05/2.51 # Proof object generating inferences : 1
% 8.05/2.51 # Proof object simplifying inferences : 3
% 8.05/2.51 # Training examples: 0 positive, 0 negative
% 8.05/2.51 # Parsed axioms : 52
% 8.05/2.51 # Removed by relevancy pruning/SinE : 0
% 8.05/2.51 # Initial clauses : 52
% 8.05/2.51 # Removed in clause preprocessing : 0
% 8.05/2.51 # Initial clauses in saturation : 52
% 8.05/2.51 # Processed clauses : 13
% 8.05/2.51 # ...of these trivial : 0
% 8.05/2.51 # ...subsumed : 0
% 8.05/2.51 # ...remaining for further processing : 13
% 8.05/2.51 # Other redundant clauses eliminated : 0
% 8.05/2.51 # Clauses deleted for lack of memory : 0
% 8.05/2.51 # Backward-subsumed : 0
% 8.05/2.51 # Backward-rewritten : 0
% 8.05/2.51 # Generated clauses : 3
% 8.05/2.51 # ...of the previous two non-trivial : 0
% 8.05/2.51 # Contextual simplify-reflections : 0
% 8.05/2.51 # Paramodulations : 1
% 8.05/2.51 # Factorizations : 2
% 8.05/2.51 # Equation resolutions : 0
% 8.05/2.51 # Propositional unsat checks : 0
% 8.05/2.51 # Propositional unsat check successes : 0
% 8.05/2.51 # Current number of processed clauses : 13
% 8.05/2.51 # Positive orientable unit clauses : 6
% 8.05/2.51 # Positive unorientable unit clauses: 0
% 8.05/2.51 # Negative unit clauses : 5
% 8.05/2.51 # Non-unit-clauses : 2
% 8.05/2.51 # Current number of unprocessed clauses: 39
% 8.05/2.51 # ...number of literals in the above : 88
% 8.05/2.51 # Current number of archived formulas : 0
% 8.05/2.51 # Current number of archived clauses : 0
% 8.05/2.51 # Clause-clause subsumption calls (NU) : 0
% 8.05/2.51 # Rec. Clause-clause subsumption calls : 0
% 8.05/2.51 # Non-unit clause-clause subsumptions : 0
% 8.05/2.51 # Unit Clause-clause subsumption calls : 2
% 8.05/2.51 # Rewrite failures with RHS unbound : 0
% 8.05/2.51 # BW rewrite match attempts : 0
% 8.05/2.51 # BW rewrite match successes : 0
% 8.05/2.51 # Condensation attempts : 0
% 8.05/2.51 # Condensation successes : 0
% 8.05/2.51 # Termbank termtop insertions : 886
% 8.05/2.51
% 8.05/2.51 # -------------------------------------------------
% 8.05/2.51 # User time : 0.013 s
% 8.05/2.51 # System time : 0.002 s
% 8.05/2.51 # Total time : 0.015 s
% 8.05/2.51 # ...preprocessing : 0.014 s
% 8.05/2.51 # ...main loop : 0.000 s
% 8.05/2.51 # Maximum resident set size: 7128 pages
% 8.05/2.51
%------------------------------------------------------------------------------