TSTP Solution File: SWV401+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV401+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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.65s 2.41s
% Output : CNFRefutation 8.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 13 unt; 10 nHn; 27 RR)
% Number of literals : 75 ( 15 equ; 36 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 75 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,negated_conjecture,
~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_20) ).
cnf(i_0_17,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
| ~ strictly_less_than(X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_17) ).
cnf(i_0_18,plain,
( insert_slb(update_slb(X1,X2),pair(X3,X4)) = update_slb(insert_slb(X1,pair(X3,X4)),X2)
| ~ less_than(X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_18) ).
cnf(i_0_9,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_9) ).
cnf(i_0_23,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X1),X2,X3)
| ~ less_than(X1,X3)
| ~ pair_in_list(esk1_0,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_23) ).
cnf(i_0_21,negated_conjecture,
less_than(esk4_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_21) ).
cnf(i_0_25,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_25) ).
cnf(i_0_28,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_28) ).
cnf(i_0_10,plain,
( X1 = X2
| pair_in_list(X3,X4,X2)
| ~ pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_10) ).
cnf(i_0_22,negated_conjecture,
pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_22) ).
cnf(i_0_11,plain,
( X1 = X2
| pair_in_list(X3,X2,X4)
| ~ pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_11) ).
cnf(i_0_8,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6hi98i5m/input.p',i_0_8) ).
cnf(c_0_41,negated_conjecture,
~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk3_0),
i_0_20 ).
cnf(c_0_42,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
| ~ strictly_less_than(X3,X4) ),
i_0_17 ).
cnf(c_0_43,plain,
( insert_slb(update_slb(X1,X2),pair(X3,X4)) = update_slb(insert_slb(X1,pair(X3,X4)),X2)
| ~ less_than(X2,X4) ),
i_0_18 ).
cnf(c_0_44,negated_conjecture,
( ~ strictly_less_than(esk6_0,esk4_0)
| ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk4_0)),esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
i_0_9 ).
cnf(c_0_46,negated_conjecture,
( ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk6_0)),esk2_0,esk3_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_47,plain,
( ~ strictly_less_than(esk6_0,esk4_0)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X1),X2,X3)
| ~ less_than(X1,X3)
| ~ pair_in_list(esk1_0,X2,X3) ),
i_0_23 ).
cnf(c_0_49,negated_conjecture,
less_than(esk4_0,esk3_0),
i_0_21 ).
cnf(c_0_50,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_25 ).
cnf(c_0_51,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_28 ).
cnf(c_0_52,plain,
( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk3_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_53,plain,
( X1 = X2
| pair_in_list(X3,X4,X2)
| ~ pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2) ),
i_0_10 ).
cnf(c_0_54,negated_conjecture,
pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0),
i_0_22 ).
cnf(c_0_55,negated_conjecture,
( ~ strictly_less_than(esk6_0,esk4_0)
| ~ pair_in_list(esk1_0,esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_56,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( ~ pair_in_list(esk1_0,esk2_0,esk3_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_48]),c_0_49])]) ).
cnf(c_0_58,negated_conjecture,
( esk6_0 = esk3_0
| pair_in_list(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
~ pair_in_list(esk1_0,esk2_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
esk6_0 = esk3_0,
inference(sr,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,plain,
( X1 = X2
| pair_in_list(X3,X2,X4)
| ~ pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4) ),
i_0_11 ).
cnf(c_0_62,negated_conjecture,
pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk3_0)),esk2_0,esk3_0),
inference(rw,[status(thm)],[c_0_54,c_0_60]) ).
cnf(c_0_63,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
i_0_8 ).
cnf(c_0_64,negated_conjecture,
~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk3_0)),esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_60]),c_0_60]),c_0_49])]) ).
cnf(c_0_65,plain,
esk2_0 = esk5_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_59]) ).
cnf(c_0_66,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_63])]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV401+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n004.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 : Tue Jun 14 17:44:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.65/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.65/2.41 # Version: 2.1pre011
% 8.65/2.41 # Preprocessing time : 0.020 s
% 8.65/2.41
% 8.65/2.41 # Proof found!
% 8.65/2.41 # SZS status Theorem
% 8.65/2.41 # SZS output start CNFRefutation
% See solution above
% 8.65/2.41 # Proof object total steps : 39
% 8.65/2.41 # Proof object clause steps : 27
% 8.65/2.41 # Proof object formula steps : 12
% 8.65/2.41 # Proof object conjectures : 17
% 8.65/2.41 # Proof object clause conjectures : 13
% 8.65/2.41 # Proof object formula conjectures : 4
% 8.65/2.41 # Proof object initial clauses used : 12
% 8.65/2.41 # Proof object initial formulas used : 12
% 8.65/2.41 # Proof object generating inferences : 9
% 8.65/2.41 # Proof object simplifying inferences : 18
% 8.65/2.41 # Training examples: 0 positive, 0 negative
% 8.65/2.41 # Parsed axioms : 29
% 8.65/2.41 # Removed by relevancy pruning/SinE : 0
% 8.65/2.41 # Initial clauses : 29
% 8.65/2.41 # Removed in clause preprocessing : 0
% 8.65/2.41 # Initial clauses in saturation : 29
% 8.65/2.41 # Processed clauses : 58
% 8.65/2.41 # ...of these trivial : 0
% 8.65/2.41 # ...subsumed : 9
% 8.65/2.41 # ...remaining for further processing : 49
% 8.65/2.41 # Other redundant clauses eliminated : 3
% 8.65/2.41 # Clauses deleted for lack of memory : 0
% 8.65/2.41 # Backward-subsumed : 0
% 8.65/2.41 # Backward-rewritten : 13
% 8.65/2.41 # Generated clauses : 65
% 8.65/2.41 # ...of the previous two non-trivial : 58
% 8.65/2.41 # Contextual simplify-reflections : 2
% 8.65/2.41 # Paramodulations : 60
% 8.65/2.41 # Factorizations : 2
% 8.65/2.41 # Equation resolutions : 3
% 8.65/2.41 # Propositional unsat checks : 0
% 8.65/2.41 # Propositional unsat check successes : 0
% 8.65/2.41 # Current number of processed clauses : 33
% 8.65/2.41 # Positive orientable unit clauses : 11
% 8.65/2.41 # Positive unorientable unit clauses: 0
% 8.65/2.41 # Negative unit clauses : 3
% 8.65/2.41 # Non-unit-clauses : 19
% 8.65/2.41 # Current number of unprocessed clauses: 28
% 8.65/2.41 # ...number of literals in the above : 79
% 8.65/2.41 # Current number of archived formulas : 0
% 8.65/2.41 # Current number of archived clauses : 14
% 8.65/2.41 # Clause-clause subsumption calls (NU) : 82
% 8.65/2.41 # Rec. Clause-clause subsumption calls : 76
% 8.65/2.41 # Non-unit clause-clause subsumptions : 6
% 8.65/2.41 # Unit Clause-clause subsumption calls : 46
% 8.65/2.41 # Rewrite failures with RHS unbound : 0
% 8.65/2.41 # BW rewrite match attempts : 11
% 8.65/2.41 # BW rewrite match successes : 2
% 8.65/2.41 # Condensation attempts : 0
% 8.65/2.41 # Condensation successes : 0
% 8.65/2.41 # Termbank termtop insertions : 1154
% 8.65/2.41
% 8.65/2.41 # -------------------------------------------------
% 8.65/2.41 # User time : 0.015 s
% 8.65/2.41 # System time : 0.008 s
% 8.65/2.41 # Total time : 0.023 s
% 8.65/2.41 # ...preprocessing : 0.020 s
% 8.65/2.41 # ...main loop : 0.003 s
% 8.65/2.41 # Maximum resident set size: 7124 pages
% 8.65/2.41
%------------------------------------------------------------------------------