TSTP Solution File: SWV398+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV398+1 : 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:06 EDT 2022
% Result : Theorem 11.88s 2.88s
% Output : CNFRefutation 11.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of clauses : 58 ( 15 unt; 33 nHn; 29 RR)
% Number of literals : 137 ( 38 equ; 42 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 107 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_37,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| contains_slb(X1,findmin_pqp_res(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_37) ).
cnf(i_0_45,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_45) ).
cnf(i_0_46,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_46) ).
cnf(i_0_47,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk5_2(X1,X2),esk4_2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_47) ).
cnf(i_0_53,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_53) ).
cnf(i_0_56,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_56) ).
cnf(i_0_48,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(X2,esk4_2(X1,X2),esk5_2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_48) ).
cnf(i_0_49,lemma,
( less_than(X1,X2)
| ~ pair_in_list(X3,X2,X1)
| ~ check_cpq(triple(X4,X3,X5)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_49) ).
cnf(i_0_51,lemma,
( pair_in_list(update_slb(X1,X2),esk6_2(X1,X2),esk7_2(X1,X2))
| ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_51) ).
cnf(i_0_50,lemma,
( strictly_less_than(esk6_2(X1,X2),esk7_2(X1,X2))
| ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_50) ).
cnf(i_0_39,plain,
( X1 = create_slb
| triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3) = findmin_cpq_eff(triple(X2,X1,X3))
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_39) ).
cnf(i_0_54,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_54) ).
cnf(i_0_38,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_38) ).
cnf(i_0_7,plain,
~ pair_in_list(create_slb,X1,X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a561run4/lgb.p',i_0_7) ).
cnf(c_0_71,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| contains_slb(X1,findmin_pqp_res(X2)) ),
i_0_37 ).
cnf(c_0_72,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
i_0_45 ).
cnf(c_0_73,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = findmin_cpq_eff(triple(X1,X2,X4))
| X2 = create_slb
| contains_slb(X2,findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_71,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
i_0_46 ).
cnf(c_0_75,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk5_2(X1,X2),esk4_2(X1,X2)) ),
i_0_47 ).
cnf(c_0_76,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_53 ).
cnf(c_0_77,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_56 ).
cnf(c_0_78,negated_conjecture,
( create_slb = esk2_0
| contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1))) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_79,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(X2,esk4_2(X1,X2),esk5_2(X1,X2)) ),
i_0_48 ).
cnf(c_0_80,negated_conjecture,
~ less_than(esk5_2(esk1_0,esk2_0),esk4_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_81,plain,
( less_than(X1,X2)
| strictly_less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_82,lemma,
( less_than(X1,X2)
| ~ pair_in_list(X3,X2,X1)
| ~ check_cpq(triple(X4,X3,X5)) ),
i_0_49 ).
cnf(c_0_83,plain,
( create_slb = esk2_0
| contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| check_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad)) ),
inference(spm,[status(thm)],[c_0_78,c_0_71]) ).
cnf(c_0_84,lemma,
( pair_in_list(update_slb(X1,X2),esk6_2(X1,X2),esk7_2(X1,X2))
| ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4) ),
i_0_51 ).
cnf(c_0_85,negated_conjecture,
pair_in_list(esk2_0,esk4_2(esk1_0,esk2_0),esk5_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_74,c_0_79]) ).
cnf(c_0_86,plain,
strictly_less_than(esk4_2(esk1_0,esk2_0),esk5_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_87,lemma,
( create_slb = esk2_0
| less_than(X1,X2)
| contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_88,negated_conjecture,
pair_in_list(update_slb(esk2_0,X1),esk6_2(esk2_0,X1),esk7_2(esk2_0,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86])]) ).
cnf(c_0_89,lemma,
( strictly_less_than(esk6_2(X1,X2),esk7_2(X1,X2))
| ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4) ),
i_0_50 ).
cnf(c_0_90,plain,
( X1 = create_slb
| triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3) = findmin_cpq_eff(triple(X2,X1,X3))
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2)) ),
i_0_39 ).
cnf(c_0_91,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
i_0_54 ).
cnf(c_0_92,negated_conjecture,
( create_slb = esk2_0
| less_than(esk7_2(esk2_0,findmin_pqp_res(esk1_0)),esk6_2(esk2_0,findmin_pqp_res(esk1_0)))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_93,negated_conjecture,
strictly_less_than(esk6_2(esk2_0,X1),esk7_2(esk2_0,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_85]),c_0_86])]) ).
cnf(c_0_94,plain,
( triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) = findmin_cpq_eff(triple(X1,X2,X3))
| X2 = create_slb
| strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_90,c_0_81]) ).
cnf(c_0_95,plain,
( create_slb = esk2_0
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93])]) ).
cnf(c_0_96,plain,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| create_slb = esk2_0
| strictly_less_than(findmin_pqp_res(esk1_0),lookup_slb(esk2_0,findmin_pqp_res(esk1_0))) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_97,lemma,
( create_slb = esk2_0
| less_than(X1,X2)
| strictly_less_than(findmin_pqp_res(esk1_0),lookup_slb(esk2_0,findmin_pqp_res(esk1_0)))
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2,X1)
| ~ check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X3))) ),
inference(spm,[status(thm)],[c_0_82,c_0_96]) ).
cnf(c_0_98,negated_conjecture,
( create_slb = esk2_0
| less_than(esk7_2(esk2_0,findmin_pqp_res(esk1_0)),esk6_2(esk2_0,findmin_pqp_res(esk1_0)))
| strictly_less_than(findmin_pqp_res(esk1_0),lookup_slb(esk2_0,findmin_pqp_res(esk1_0)))
| ~ check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1))) ),
inference(spm,[status(thm)],[c_0_97,c_0_88]) ).
cnf(c_0_99,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))) ),
i_0_38 ).
cnf(c_0_100,negated_conjecture,
( create_slb = esk2_0
| less_than(esk7_2(esk2_0,findmin_pqp_res(esk1_0)),esk6_2(esk2_0,findmin_pqp_res(esk1_0)))
| strictly_less_than(findmin_pqp_res(esk1_0),lookup_slb(esk2_0,findmin_pqp_res(esk1_0))) ),
inference(spm,[status(thm)],[c_0_98,c_0_72]) ).
cnf(c_0_101,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) ),
inference(csr,[status(thm)],[c_0_99,c_0_71]) ).
cnf(c_0_102,plain,
( create_slb = esk2_0
| strictly_less_than(findmin_pqp_res(esk1_0),lookup_slb(esk2_0,findmin_pqp_res(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_100]),c_0_93])]) ).
cnf(c_0_103,plain,
( findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) = triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad)
| create_slb = esk2_0 ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_104,plain,
( findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) = findmin_cpq_eff(triple(esk1_0,esk2_0,X2))
| create_slb = esk2_0 ),
inference(spm,[status(thm)],[c_0_103,c_0_103]) ).
cnf(c_0_105,negated_conjecture,
( create_slb = esk2_0
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1))) ),
inference(spm,[status(thm)],[c_0_72,c_0_104]) ).
cnf(c_0_106,plain,
( create_slb = esk2_0
| check_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad)) ),
inference(spm,[status(thm)],[c_0_105,c_0_103]) ).
cnf(c_0_107,lemma,
( create_slb = esk2_0
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_106]) ).
cnf(c_0_108,negated_conjecture,
( create_slb = esk2_0
| less_than(esk7_2(esk2_0,findmin_pqp_res(esk1_0)),esk6_2(esk2_0,findmin_pqp_res(esk1_0))) ),
inference(spm,[status(thm)],[c_0_107,c_0_88]) ).
cnf(c_0_109,lemma,
( less_than(X1,X2)
| pair_in_list(X3,esk4_2(X4,X3),esk5_2(X4,X3))
| ~ pair_in_list(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_79]) ).
cnf(c_0_110,plain,
~ pair_in_list(create_slb,X1,X2),
i_0_7 ).
cnf(c_0_111,plain,
create_slb = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_108]),c_0_93])]) ).
cnf(c_0_112,negated_conjecture,
pair_in_list(esk2_0,esk4_2(X1,esk2_0),esk5_2(X1,esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_85]),c_0_80]) ).
cnf(c_0_113,plain,
~ pair_in_list(esk2_0,X1,X2),
inference(rw,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_114,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_112,c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV398+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Wed Jun 15 17:04:15 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.14/0.38 # ENIGMATIC: Selected SinE mode:
% 0.14/0.38 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.14/0.38 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.14/0.38 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.88/2.88 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.88/2.88 # No SInE strategy applied
% 11.88/2.88 # Trying AutoSched0 for 150 seconds
% 11.88/2.88 # AutoSched0-Mode selected heuristic G_E___208_B01_00_F1_SE_CS_SP_PS_S04AN
% 11.88/2.88 # and selection function SelectComplexExceptUniqMaxHorn.
% 11.88/2.88 #
% 11.88/2.88 # Preprocessing time : 0.012 s
% 11.88/2.88 # Presaturation interreduction done
% 11.88/2.88
% 11.88/2.88 # Proof found!
% 11.88/2.88 # SZS status Theorem
% 11.88/2.88 # SZS output start CNFRefutation
% See solution above
% 11.88/2.88 # Training examples: 0 positive, 0 negative
% 11.88/2.88
% 11.88/2.88 # -------------------------------------------------
% 11.88/2.88 # User time : 0.487 s
% 11.88/2.88 # System time : 0.020 s
% 11.88/2.88 # Total time : 0.507 s
% 11.88/2.88 # Maximum resident set size: 7120 pages
% 11.88/2.88
%------------------------------------------------------------------------------