TSTP Solution File: SWV406+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV406+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:07 EDT 2022
% Result : Theorem 8.63s 2.53s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of clauses : 53 ( 10 unt; 20 nHn; 40 RR)
% Number of literals : 115 ( 13 equ; 50 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 113 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
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-k64ombzq/input.p',i_0_8) ).
cnf(i_0_45,negated_conjecture,
( less_than(X1,X2)
| check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| ~ pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_45) ).
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-k64ombzq/input.p',i_0_9) ).
cnf(i_0_52,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_52) ).
cnf(i_0_55,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_55) ).
cnf(i_0_49,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| pair_in_list(esk1_0,esk2_2(X1,X2),esk3_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_49) ).
cnf(i_0_48,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| ~ less_than(esk3_2(X1,X2),esk2_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_48) ).
cnf(i_0_46,negated_conjecture,
( ~ less_than(esk9_0,esk8_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_46) ).
cnf(i_0_25,plain,
( check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ less_than(X4,X3)
| ~ check_cpq(triple(X1,X2,X5)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_25) ).
cnf(i_0_27,plain,
( ~ strictly_less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X1,X2)),X5)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_27) ).
cnf(i_0_47,negated_conjecture,
( pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_47) ).
cnf(i_0_26,plain,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(X4,X5)
| ~ check_cpq(triple(X1,insert_slb(X2,pair(X5,X4)),X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_26) ).
cnf(i_0_50,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(esk1_0,X2,X1)
| ~ check_cpq(triple(X3,esk1_0,X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k64ombzq/input.p',i_0_50) ).
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-k64ombzq/input.p',i_0_11) ).
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-k64ombzq/input.p',i_0_10) ).
cnf(c_0_71,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
i_0_8 ).
cnf(c_0_72,negated_conjecture,
( less_than(X1,X2)
| check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| ~ pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),X2,X1) ),
i_0_45 ).
cnf(c_0_73,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
i_0_9 ).
cnf(c_0_74,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_71])]) ).
cnf(c_0_75,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_52 ).
cnf(c_0_76,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_55 ).
cnf(c_0_77,negated_conjecture,
( check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| less_than(X1,X2)
| ~ pair_in_list(esk1_0,X2,X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| pair_in_list(esk1_0,esk2_2(X1,X2),esk3_2(X1,X2)) ),
i_0_49 ).
cnf(c_0_79,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| ~ less_than(esk3_2(X1,X2),esk2_2(X1,X2)) ),
i_0_48 ).
cnf(c_0_80,negated_conjecture,
( ~ less_than(esk9_0,esk8_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
i_0_46 ).
cnf(c_0_81,plain,
( check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ less_than(X4,X3)
| ~ check_cpq(triple(X1,X2,X5)) ),
i_0_25 ).
cnf(c_0_82,plain,
( ~ strictly_less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X1,X2)),X5)) ),
i_0_27 ).
cnf(c_0_83,negated_conjecture,
( check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| less_than(esk7_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_72,c_0_74]) ).
cnf(c_0_84,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_85,negated_conjecture,
( pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)
| ~ check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)) ),
i_0_47 ).
cnf(c_0_86,negated_conjecture,
( check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0))
| check_cpq(triple(X1,esk1_0,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_87,negated_conjecture,
( ~ check_cpq(triple(esk4_0,esk1_0,esk5_0))
| ~ less_than(esk9_0,esk8_0)
| ~ less_than(esk7_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_88,plain,
less_than(esk7_0,esk6_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]) ).
cnf(c_0_89,negated_conjecture,
( pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)
| ~ check_cpq(triple(esk4_0,esk1_0,esk5_0))
| ~ less_than(esk7_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_85,c_0_81]) ).
cnf(c_0_90,negated_conjecture,
( pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0)
| check_cpq(triple(X1,esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,negated_conjecture,
( ~ check_cpq(triple(esk4_0,esk1_0,esk5_0))
| ~ less_than(esk9_0,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_92,negated_conjecture,
( check_cpq(triple(X1,esk1_0,X2))
| ~ less_than(esk9_0,esk8_0) ),
inference(spm,[status(thm)],[c_0_80,c_0_86]) ).
cnf(c_0_93,negated_conjecture,
pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk8_0,esk9_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_88])]),c_0_90]) ).
cnf(c_0_94,negated_conjecture,
~ less_than(esk9_0,esk8_0),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_95,plain,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(X4,X5)
| ~ check_cpq(triple(X1,insert_slb(X2,pair(X5,X4)),X3)) ),
i_0_26 ).
cnf(c_0_96,negated_conjecture,
check_cpq(triple(esk4_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk5_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_93]),c_0_94]) ).
cnf(c_0_97,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(esk1_0,X2,X1)
| ~ check_cpq(triple(X3,esk1_0,X4)) ),
i_0_50 ).
cnf(c_0_98,plain,
check_cpq(triple(esk4_0,esk1_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_88])]) ).
cnf(c_0_99,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_100,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_101,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(esk1_0,X2,X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_102,plain,
( esk8_0 = esk6_0
| pair_in_list(esk1_0,esk8_0,esk9_0) ),
inference(spm,[status(thm)],[c_0_99,c_0_93]) ).
cnf(c_0_103,plain,
( esk9_0 = esk7_0
| pair_in_list(esk1_0,esk8_0,esk9_0) ),
inference(spm,[status(thm)],[c_0_100,c_0_93]) ).
cnf(c_0_104,plain,
esk8_0 = esk6_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_94]) ).
cnf(c_0_105,plain,
( esk9_0 = esk7_0
| pair_in_list(esk1_0,esk6_0,esk9_0) ),
inference(rw,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_106,negated_conjecture,
~ less_than(esk9_0,esk6_0),
inference(rw,[status(thm)],[c_0_94,c_0_104]) ).
cnf(c_0_107,negated_conjecture,
esk9_0 = esk7_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_105]),c_0_106]) ).
cnf(c_0_108,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_107]),c_0_88])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV406+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 : n005.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:39:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/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
% 8.63/2.53 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.63/2.53 # Version: 2.1pre011
% 8.63/2.53 # Preprocessing time : 0.014 s
% 8.63/2.53
% 8.63/2.53 # Proof found!
% 8.63/2.53 # SZS status Theorem
% 8.63/2.53 # SZS output start CNFRefutation
% See solution above
% 8.63/2.53 # Proof object total steps : 53
% 8.63/2.53 # Proof object clause steps : 38
% 8.63/2.53 # Proof object formula steps : 15
% 8.63/2.53 # Proof object conjectures : 27
% 8.63/2.53 # Proof object clause conjectures : 21
% 8.63/2.53 # Proof object formula conjectures : 6
% 8.63/2.53 # Proof object initial clauses used : 15
% 8.63/2.53 # Proof object initial formulas used : 15
% 8.63/2.53 # Proof object generating inferences : 16
% 8.63/2.53 # Proof object simplifying inferences : 20
% 8.63/2.53 # Training examples: 0 positive, 0 negative
% 8.63/2.53 # Parsed axioms : 54
% 8.63/2.53 # Removed by relevancy pruning/SinE : 0
% 8.63/2.53 # Initial clauses : 54
% 8.63/2.53 # Removed in clause preprocessing : 0
% 8.63/2.53 # Initial clauses in saturation : 54
% 8.63/2.53 # Processed clauses : 129
% 8.63/2.53 # ...of these trivial : 2
% 8.63/2.53 # ...subsumed : 16
% 8.63/2.53 # ...remaining for further processing : 111
% 8.63/2.53 # Other redundant clauses eliminated : 3
% 8.63/2.53 # Clauses deleted for lack of memory : 0
% 8.63/2.53 # Backward-subsumed : 5
% 8.63/2.53 # Backward-rewritten : 26
% 8.63/2.53 # Generated clauses : 288
% 8.63/2.53 # ...of the previous two non-trivial : 257
% 8.63/2.53 # Contextual simplify-reflections : 8
% 8.63/2.53 # Paramodulations : 278
% 8.63/2.53 # Factorizations : 8
% 8.63/2.53 # Equation resolutions : 3
% 8.63/2.53 # Propositional unsat checks : 0
% 8.63/2.53 # Propositional unsat check successes : 0
% 8.63/2.53 # Current number of processed clauses : 78
% 8.63/2.53 # Positive orientable unit clauses : 18
% 8.63/2.53 # Positive unorientable unit clauses: 0
% 8.63/2.53 # Negative unit clauses : 6
% 8.63/2.53 # Non-unit-clauses : 54
% 8.63/2.53 # Current number of unprocessed clauses: 143
% 8.63/2.53 # ...number of literals in the above : 512
% 8.63/2.53 # Current number of archived formulas : 0
% 8.63/2.53 # Current number of archived clauses : 31
% 8.63/2.53 # Clause-clause subsumption calls (NU) : 586
% 8.63/2.53 # Rec. Clause-clause subsumption calls : 442
% 8.63/2.53 # Non-unit clause-clause subsumptions : 22
% 8.63/2.53 # Unit Clause-clause subsumption calls : 253
% 8.63/2.53 # Rewrite failures with RHS unbound : 0
% 8.63/2.53 # BW rewrite match attempts : 15
% 8.63/2.53 # BW rewrite match successes : 6
% 8.63/2.53 # Condensation attempts : 0
% 8.63/2.53 # Condensation successes : 0
% 8.63/2.53 # Termbank termtop insertions : 4851
% 8.63/2.53
% 8.63/2.53 # -------------------------------------------------
% 8.63/2.53 # User time : 0.015 s
% 8.63/2.53 # System time : 0.007 s
% 8.63/2.53 # Total time : 0.022 s
% 8.63/2.53 # ...preprocessing : 0.014 s
% 8.63/2.53 # ...main loop : 0.007 s
% 8.63/2.53 # Maximum resident set size: 7132 pages
% 8.63/2.53
%------------------------------------------------------------------------------