TSTP Solution File: SWV408+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV408+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:08 EDT 2022
% Result : Theorem 11.27s 3.14s
% Output : CNFRefutation 11.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 6 unt; 7 nHn; 18 RR)
% Number of literals : 48 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_50,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ pair_in_list(X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-686x860e/input.p',i_0_50) ).
cnf(i_0_49,lemma,
( pair_in_list(X1,X2,esk5_2(X1,X2))
| ~ contains_slb(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-686x860e/input.p',i_0_49) ).
cnf(i_0_53,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-686x860e/input.p',i_0_53) ).
cnf(i_0_56,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-686x860e/input.p',i_0_56) ).
cnf(i_0_45,negated_conjecture,
( ~ less_than(findmin_pqp_res(esk1_0),X1)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-686x860e/input.p',i_0_45) ).
cnf(i_0_51,lemma,
( pair_in_list(update_slb(X1,X2),X3,X4)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-686x860e/input.p',i_0_51) ).
cnf(i_0_48,negated_conjecture,
contains_slb(esk2_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-686x860e/input.p',i_0_48) ).
cnf(i_0_46,negated_conjecture,
~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-686x860e/input.p',i_0_46) ).
cnf(c_0_65,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ pair_in_list(X1,X3,X4) ),
i_0_50 ).
cnf(c_0_66,lemma,
( pair_in_list(X1,X2,esk5_2(X1,X2))
| ~ contains_slb(X1,X2) ),
i_0_49 ).
cnf(c_0_67,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_53 ).
cnf(c_0_68,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_56 ).
cnf(c_0_69,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(esk5_2(X1,X3),X2)
| ~ contains_slb(X1,X3) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
( ~ less_than(findmin_pqp_res(esk1_0),X1)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X1) ),
i_0_45 ).
cnf(c_0_72,lemma,
( pair_in_list(update_slb(X1,X2),X3,X4)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
i_0_51 ).
cnf(c_0_73,plain,
( pair_in_list(update_slb(X1,X2),X3,X2)
| less_than(X2,esk5_2(X1,X3))
| ~ contains_slb(X1,X3) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
contains_slb(esk2_0,esk4_0),
i_0_48 ).
cnf(c_0_75,negated_conjecture,
( ~ pair_in_list(esk2_0,esk4_0,X1)
| ~ less_than(findmin_pqp_res(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_76,negated_conjecture,
( pair_in_list(update_slb(esk2_0,X1),esk4_0,X1)
| less_than(X1,esk5_2(esk2_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0)),
i_0_46 ).
cnf(c_0_78,negated_conjecture,
~ pair_in_list(esk2_0,esk4_0,esk5_2(esk2_0,esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_79,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_66]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWV408+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.31 % Computer : n032.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Wed Jun 15 16:39:15 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.15/0.40 # ENIGMATIC: Selected SinE mode:
% 0.15/0.41 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.15/0.41 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.15/0.41 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.27/3.14 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 11.27/3.14 # Version: 2.1pre011
% 11.27/3.14 # Preprocessing time : 0.019 s
% 11.27/3.14
% 11.27/3.14 # Proof found!
% 11.27/3.14 # SZS status Theorem
% 11.27/3.14 # SZS output start CNFRefutation
% See solution above
% 11.27/3.14 # Proof object total steps : 23
% 11.27/3.14 # Proof object clause steps : 15
% 11.27/3.14 # Proof object formula steps : 8
% 11.27/3.14 # Proof object conjectures : 9
% 11.27/3.14 # Proof object clause conjectures : 6
% 11.27/3.14 # Proof object formula conjectures : 3
% 11.27/3.14 # Proof object initial clauses used : 8
% 11.27/3.14 # Proof object initial formulas used : 8
% 11.27/3.14 # Proof object generating inferences : 6
% 11.27/3.14 # Proof object simplifying inferences : 4
% 11.27/3.14 # Training examples: 0 positive, 0 negative
% 11.27/3.14 # Parsed axioms : 55
% 11.27/3.14 # Removed by relevancy pruning/SinE : 0
% 11.27/3.14 # Initial clauses : 55
% 11.27/3.14 # Removed in clause preprocessing : 0
% 11.27/3.14 # Initial clauses in saturation : 55
% 11.27/3.14 # Processed clauses : 135
% 11.27/3.14 # ...of these trivial : 0
% 11.27/3.14 # ...subsumed : 28
% 11.27/3.14 # ...remaining for further processing : 107
% 11.27/3.14 # Other redundant clauses eliminated : 3
% 11.27/3.14 # Clauses deleted for lack of memory : 0
% 11.27/3.14 # Backward-subsumed : 0
% 11.27/3.14 # Backward-rewritten : 0
% 11.27/3.14 # Generated clauses : 339
% 11.27/3.14 # ...of the previous two non-trivial : 293
% 11.27/3.14 # Contextual simplify-reflections : 6
% 11.27/3.14 # Paramodulations : 323
% 11.27/3.14 # Factorizations : 14
% 11.27/3.14 # Equation resolutions : 3
% 11.27/3.14 # Propositional unsat checks : 0
% 11.27/3.14 # Propositional unsat check successes : 0
% 11.27/3.14 # Current number of processed clauses : 105
% 11.27/3.14 # Positive orientable unit clauses : 17
% 11.27/3.14 # Positive unorientable unit clauses: 0
% 11.27/3.14 # Negative unit clauses : 11
% 11.27/3.14 # Non-unit-clauses : 77
% 11.27/3.14 # Current number of unprocessed clauses: 213
% 11.27/3.14 # ...number of literals in the above : 757
% 11.27/3.14 # Current number of archived formulas : 0
% 11.27/3.14 # Current number of archived clauses : 0
% 11.27/3.14 # Clause-clause subsumption calls (NU) : 1089
% 11.27/3.14 # Rec. Clause-clause subsumption calls : 889
% 11.27/3.14 # Non-unit clause-clause subsumptions : 28
% 11.27/3.14 # Unit Clause-clause subsumption calls : 196
% 11.27/3.14 # Rewrite failures with RHS unbound : 0
% 11.27/3.14 # BW rewrite match attempts : 6
% 11.27/3.14 # BW rewrite match successes : 0
% 11.27/3.14 # Condensation attempts : 0
% 11.27/3.14 # Condensation successes : 0
% 11.27/3.14 # Termbank termtop insertions : 5684
% 11.27/3.14
% 11.27/3.14 # -------------------------------------------------
% 11.27/3.14 # User time : 0.025 s
% 11.27/3.14 # System time : 0.004 s
% 11.27/3.14 # Total time : 0.029 s
% 11.27/3.14 # ...preprocessing : 0.019 s
% 11.27/3.14 # ...main loop : 0.010 s
% 11.27/3.14 # Maximum resident set size: 7132 pages
% 11.27/3.14
%------------------------------------------------------------------------------