TSTP Solution File: SWV371+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV371+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:00 EDT 2022
% Result : Theorem 7.62s 2.31s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 6 unt; 0 nHn; 13 RR)
% Number of literals : 22 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_81,negated_conjecture,
~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ooj0nj6e/input.p',i_0_81) ).
cnf(i_0_60,plain,
( pi_sharp_find_min(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ooj0nj6e/input.p',i_0_60) ).
cnf(i_0_84,lemma,
( issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ooj0nj6e/input.p',i_0_84) ).
cnf(i_0_82,negated_conjecture,
phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ooj0nj6e/input.p',i_0_82) ).
cnf(i_0_83,lemma,
( contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ooj0nj6e/input.p',i_0_83) ).
cnf(c_0_90,negated_conjecture,
~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
i_0_81 ).
cnf(c_0_91,plain,
( pi_sharp_find_min(X1,X2)
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
i_0_60 ).
cnf(c_0_92,negated_conjecture,
( ~ issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))
| ~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_93,lemma,
( issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
i_0_84 ).
cnf(c_0_94,negated_conjecture,
phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
i_0_82 ).
cnf(c_0_95,lemma,
~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94])]) ).
cnf(c_0_96,lemma,
( contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
i_0_83 ).
cnf(c_0_97,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_94])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV371+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 15:31:51 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.62/2.31 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.62/2.31 # Version: 2.1pre011
% 7.62/2.31 # Preprocessing time : 0.012 s
% 7.62/2.31
% 7.62/2.31 # Proof found!
% 7.62/2.31 # SZS status Theorem
% 7.62/2.31 # SZS output start CNFRefutation
% See solution above
% 7.62/2.31 # Proof object total steps : 13
% 7.62/2.31 # Proof object clause steps : 8
% 7.62/2.31 # Proof object formula steps : 5
% 7.62/2.31 # Proof object conjectures : 5
% 7.62/2.31 # Proof object clause conjectures : 3
% 7.62/2.31 # Proof object formula conjectures : 2
% 7.62/2.31 # Proof object initial clauses used : 5
% 7.62/2.31 # Proof object initial formulas used : 5
% 7.62/2.31 # Proof object generating inferences : 3
% 7.62/2.31 # Proof object simplifying inferences : 4
% 7.62/2.31 # Training examples: 0 positive, 0 negative
% 7.62/2.31 # Parsed axioms : 88
% 7.62/2.31 # Removed by relevancy pruning/SinE : 0
% 7.62/2.31 # Initial clauses : 88
% 7.62/2.31 # Removed in clause preprocessing : 0
% 7.62/2.31 # Initial clauses in saturation : 88
% 7.62/2.31 # Processed clauses : 94
% 7.62/2.31 # ...of these trivial : 0
% 7.62/2.31 # ...subsumed : 1
% 7.62/2.31 # ...remaining for further processing : 93
% 7.62/2.31 # Other redundant clauses eliminated : 4
% 7.62/2.31 # Clauses deleted for lack of memory : 0
% 7.62/2.31 # Backward-subsumed : 0
% 7.62/2.31 # Backward-rewritten : 0
% 7.62/2.31 # Generated clauses : 188
% 7.62/2.31 # ...of the previous two non-trivial : 165
% 7.62/2.31 # Contextual simplify-reflections : 2
% 7.62/2.31 # Paramodulations : 183
% 7.62/2.31 # Factorizations : 2
% 7.62/2.31 # Equation resolutions : 4
% 7.62/2.31 # Propositional unsat checks : 0
% 7.62/2.31 # Propositional unsat check successes : 0
% 7.62/2.31 # Current number of processed clauses : 90
% 7.62/2.31 # Positive orientable unit clauses : 17
% 7.62/2.31 # Positive unorientable unit clauses: 2
% 7.62/2.31 # Negative unit clauses : 8
% 7.62/2.31 # Non-unit-clauses : 63
% 7.62/2.31 # Current number of unprocessed clauses: 158
% 7.62/2.31 # ...number of literals in the above : 435
% 7.62/2.31 # Current number of archived formulas : 0
% 7.62/2.31 # Current number of archived clauses : 0
% 7.62/2.31 # Clause-clause subsumption calls (NU) : 604
% 7.62/2.31 # Rec. Clause-clause subsumption calls : 493
% 7.62/2.31 # Non-unit clause-clause subsumptions : 3
% 7.62/2.31 # Unit Clause-clause subsumption calls : 71
% 7.62/2.31 # Rewrite failures with RHS unbound : 0
% 7.62/2.31 # BW rewrite match attempts : 2
% 7.62/2.31 # BW rewrite match successes : 0
% 7.62/2.31 # Condensation attempts : 0
% 7.62/2.31 # Condensation successes : 0
% 7.62/2.31 # Termbank termtop insertions : 4001
% 7.62/2.31
% 7.62/2.31 # -------------------------------------------------
% 7.62/2.31 # User time : 0.012 s
% 7.62/2.31 # System time : 0.004 s
% 7.62/2.31 # Total time : 0.016 s
% 7.62/2.31 # ...preprocessing : 0.012 s
% 7.62/2.31 # ...main loop : 0.004 s
% 7.62/2.31 # Maximum resident set size: 7136 pages
% 7.62/2.31
%------------------------------------------------------------------------------