TSTP Solution File: SWV417+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:10 EDT 2022
% Result : Theorem 7.41s 2.39s
% Output : CNFRefutation 7.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 3 unt; 0 nHn; 14 RR)
% Number of literals : 27 ( 5 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_81,negated_conjecture,
( findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),X1) != findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))
| ~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if800xdv/input.p',i_0_81) ).
cnf(i_0_7,plain,
( findmin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if800xdv/input.p',i_0_7) ).
cnf(i_0_62,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if800xdv/input.p',i_0_62) ).
cnf(i_0_61,plain,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if800xdv/input.p',i_0_61) ).
cnf(i_0_84,lemma,
( pi_sharp_find_min(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-if800xdv/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-if800xdv/input.p',i_0_82) ).
cnf(c_0_91,negated_conjecture,
( findmin_pq_res(i(triple(esk5_0,esk6_0,esk7_0)),X1) != findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))
| ~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1) ),
i_0_81 ).
cnf(c_0_92,plain,
( findmin_pq_res(X1,X2) = X2
| ~ issmallestelement_pq(X1,X2)
| ~ contains_pq(X1,X2) ),
i_0_7 ).
cnf(c_0_93,plain,
( contains_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
i_0_62 ).
cnf(c_0_94,plain,
( issmallestelement_pq(X1,X2)
| ~ pi_sharp_find_min(X1,X2) ),
i_0_61 ).
cnf(c_0_95,negated_conjecture,
( X1 != findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))
| ~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_94]) ).
cnf(c_0_96,lemma,
( pi_sharp_find_min(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_97,negated_conjecture,
phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
i_0_82 ).
cnf(c_0_98,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 09:32:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.41/2.39 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.41/2.39 # Version: 2.1pre011
% 7.41/2.39 # Preprocessing time : 0.010 s
% 7.41/2.39
% 7.41/2.39 # Proof found!
% 7.41/2.39 # SZS status Theorem
% 7.41/2.39 # SZS output start CNFRefutation
% See solution above
% 7.41/2.39 # Proof object total steps : 14
% 7.41/2.39 # Proof object clause steps : 8
% 7.41/2.39 # Proof object formula steps : 6
% 7.41/2.39 # Proof object conjectures : 5
% 7.41/2.39 # Proof object clause conjectures : 3
% 7.41/2.39 # Proof object formula conjectures : 2
% 7.41/2.39 # Proof object initial clauses used : 6
% 7.41/2.39 # Proof object initial formulas used : 6
% 7.41/2.39 # Proof object generating inferences : 2
% 7.41/2.39 # Proof object simplifying inferences : 4
% 7.41/2.39 # Training examples: 0 positive, 0 negative
% 7.41/2.39 # Parsed axioms : 88
% 7.41/2.39 # Removed by relevancy pruning/SinE : 0
% 7.41/2.39 # Initial clauses : 88
% 7.41/2.39 # Removed in clause preprocessing : 0
% 7.41/2.39 # Initial clauses in saturation : 88
% 7.41/2.39 # Processed clauses : 94
% 7.41/2.39 # ...of these trivial : 0
% 7.41/2.39 # ...subsumed : 2
% 7.41/2.39 # ...remaining for further processing : 92
% 7.41/2.39 # Other redundant clauses eliminated : 4
% 7.41/2.39 # Clauses deleted for lack of memory : 0
% 7.41/2.39 # Backward-subsumed : 0
% 7.41/2.39 # Backward-rewritten : 0
% 7.41/2.39 # Generated clauses : 190
% 7.41/2.39 # ...of the previous two non-trivial : 165
% 7.41/2.39 # Contextual simplify-reflections : 4
% 7.41/2.39 # Paramodulations : 185
% 7.41/2.39 # Factorizations : 2
% 7.41/2.39 # Equation resolutions : 4
% 7.41/2.39 # Propositional unsat checks : 0
% 7.41/2.39 # Propositional unsat check successes : 0
% 7.41/2.39 # Current number of processed clauses : 89
% 7.41/2.39 # Positive orientable unit clauses : 18
% 7.41/2.39 # Positive unorientable unit clauses: 2
% 7.41/2.39 # Negative unit clauses : 6
% 7.41/2.39 # Non-unit-clauses : 63
% 7.41/2.39 # Current number of unprocessed clauses: 156
% 7.41/2.39 # ...number of literals in the above : 431
% 7.41/2.39 # Current number of archived formulas : 0
% 7.41/2.39 # Current number of archived clauses : 0
% 7.41/2.39 # Clause-clause subsumption calls (NU) : 967
% 7.41/2.39 # Rec. Clause-clause subsumption calls : 795
% 7.41/2.39 # Non-unit clause-clause subsumptions : 6
% 7.41/2.39 # Unit Clause-clause subsumption calls : 36
% 7.41/2.39 # Rewrite failures with RHS unbound : 0
% 7.41/2.39 # BW rewrite match attempts : 2
% 7.41/2.39 # BW rewrite match successes : 0
% 7.41/2.39 # Condensation attempts : 0
% 7.41/2.39 # Condensation successes : 0
% 7.41/2.39 # Termbank termtop insertions : 4148
% 7.41/2.39
% 7.41/2.39 # -------------------------------------------------
% 7.41/2.39 # User time : 0.010 s
% 7.41/2.39 # System time : 0.004 s
% 7.41/2.39 # Total time : 0.014 s
% 7.41/2.39 # ...preprocessing : 0.010 s
% 7.41/2.39 # ...main loop : 0.004 s
% 7.41/2.39 # Maximum resident set size: 7140 pages
% 7.41/2.39
%------------------------------------------------------------------------------