%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV399+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:06 EDT 2022
% Result : Theorem 8.34s 2.45s
% Output : CNFRefutation 8.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 9 unt; 4 nHn; 26 RR)
% Number of literals : 56 ( 0 equ; 30 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,negated_conjecture,
( ~ strictly_less_than(X1,X2)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0h_1b0hm/input.p',i_0_20) ).
cnf(i_0_23,lemma,
( pair_in_list(update_slb(X1,X2),X3,X4)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0h_1b0hm/input.p',i_0_23) ).
cnf(i_0_28,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0h_1b0hm/input.p',i_0_28) ).
cnf(i_0_21,negated_conjecture,
strictly_less_than(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0h_1b0hm/input.p',i_0_21) ).
cnf(i_0_24,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ pair_in_list(X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0h_1b0hm/input.p',i_0_24) ).
cnf(i_0_22,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0h_1b0hm/input.p',i_0_22) ).
cnf(i_0_30,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0h_1b0hm/input.p',i_0_30) ).
cnf(i_0_26,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0h_1b0hm/input.p',i_0_26) ).
cnf(i_0_29,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0h_1b0hm/input.p',i_0_29) ).
cnf(c_0_40,negated_conjecture,
( ~ strictly_less_than(X1,X2)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),X1,X2) ),
i_0_20 ).
cnf(c_0_41,lemma,
( pair_in_list(update_slb(X1,X2),X3,X4)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
i_0_23 ).
cnf(c_0_42,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
i_0_28 ).
cnf(c_0_43,negated_conjecture,
strictly_less_than(esk2_0,esk3_0),
i_0_21 ).
cnf(c_0_44,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ pair_in_list(X1,X3,X4) ),
i_0_24 ).
cnf(c_0_45,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
i_0_22 ).
cnf(c_0_46,negated_conjecture,
( ~ pair_in_list(esk1_0,X1,X2)
| ~ less_than(esk4_0,X2)
| ~ strictly_less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
i_0_30 ).
cnf(c_0_48,negated_conjecture,
less_than(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| ~ strictly_less_than(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
~ less_than(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_43]),c_0_45])]) ).
cnf(c_0_51,plain,
( less_than(X1,esk3_0)
| ~ less_than(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( ~ strictly_less_than(esk2_0,esk4_0)
| ~ strictly_less_than(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_49]) ).
cnf(c_0_53,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_26 ).
cnf(c_0_54,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_29 ).
cnf(c_0_55,plain,
~ less_than(esk4_0,esk2_0),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( less_than(esk4_0,esk3_0)
| ~ strictly_less_than(esk2_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_57,plain,
less_than(esk2_0,esk4_0),
inference(spm,[status(thm)],[c_0_55,c_0_54]) ).
cnf(c_0_58,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_53]),c_0_57])]),c_0_50]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV399+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n007.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 17:58:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.46 # 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.34/2.45 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.34/2.45 # Version: 2.1pre011
% 8.34/2.45 # Preprocessing time : 0.011 s
% 8.34/2.45
% 8.34/2.45 # Proof found!
% 8.34/2.45 # SZS status Theorem
% 8.34/2.45 # SZS output start CNFRefutation
% See solution above
% 8.34/2.45 # Proof object total steps : 28
% 8.34/2.45 # Proof object clause steps : 19
% 8.34/2.45 # Proof object formula steps : 9
% 8.34/2.45 # Proof object conjectures : 11
% 8.34/2.45 # Proof object clause conjectures : 8
% 8.34/2.45 # Proof object formula conjectures : 3
% 8.34/2.45 # Proof object initial clauses used : 9
% 8.34/2.45 # Proof object initial formulas used : 9
% 8.34/2.45 # Proof object generating inferences : 10
% 8.34/2.45 # Proof object simplifying inferences : 7
% 8.34/2.45 # Training examples: 0 positive, 0 negative
% 8.34/2.45 # Parsed axioms : 30
% 8.34/2.45 # Removed by relevancy pruning/SinE : 0
% 8.34/2.45 # Initial clauses : 30
% 8.34/2.45 # Removed in clause preprocessing : 0
% 8.34/2.45 # Initial clauses in saturation : 30
% 8.34/2.45 # Processed clauses : 51
% 8.34/2.45 # ...of these trivial : 4
% 8.34/2.45 # ...subsumed : 0
% 8.34/2.45 # ...remaining for further processing : 46
% 8.34/2.45 # Other redundant clauses eliminated : 3
% 8.34/2.45 # Clauses deleted for lack of memory : 0
% 8.34/2.45 # Backward-subsumed : 0
% 8.34/2.45 # Backward-rewritten : 0
% 8.34/2.45 # Generated clauses : 80
% 8.34/2.45 # ...of the previous two non-trivial : 65
% 8.34/2.45 # Contextual simplify-reflections : 1
% 8.34/2.45 # Paramodulations : 76
% 8.34/2.45 # Factorizations : 2
% 8.34/2.45 # Equation resolutions : 3
% 8.34/2.45 # Propositional unsat checks : 0
% 8.34/2.45 # Propositional unsat check successes : 0
% 8.34/2.45 # Current number of processed clauses : 44
% 8.34/2.45 # Positive orientable unit clauses : 12
% 8.34/2.45 # Positive unorientable unit clauses: 0
% 8.34/2.45 # Negative unit clauses : 6
% 8.34/2.45 # Non-unit-clauses : 26
% 8.34/2.45 # Current number of unprocessed clauses: 44
% 8.34/2.45 # ...number of literals in the above : 131
% 8.34/2.45 # Current number of archived formulas : 0
% 8.34/2.45 # Current number of archived clauses : 0
% 8.34/2.45 # Clause-clause subsumption calls (NU) : 58
% 8.34/2.45 # Rec. Clause-clause subsumption calls : 52
% 8.34/2.45 # Non-unit clause-clause subsumptions : 1
% 8.34/2.45 # Unit Clause-clause subsumption calls : 35
% 8.34/2.45 # Rewrite failures with RHS unbound : 0
% 8.34/2.45 # BW rewrite match attempts : 4
% 8.34/2.45 # BW rewrite match successes : 0
% 8.34/2.45 # Condensation attempts : 0
% 8.34/2.45 # Condensation successes : 0
% 8.34/2.45 # Termbank termtop insertions : 1316
% 8.34/2.45
% 8.34/2.45 # -------------------------------------------------
% 8.34/2.45 # User time : 0.010 s
% 8.34/2.45 # System time : 0.003 s
% 8.34/2.45 # Total time : 0.013 s
% 8.34/2.45 # ...preprocessing : 0.011 s
% 8.34/2.45 # ...main loop : 0.002 s
% 8.34/2.45 # Maximum resident set size: 7132 pages
% 8.34/2.45
%------------------------------------------------------------------------------