TSTP Solution File: SWV404+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV404+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:07 EDT 2022
% Result : Theorem 7.91s 2.38s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 54 ( 12 unt; 32 nHn; 30 RR)
% Number of literals : 136 ( 44 equ; 48 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 117 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_38) ).
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/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_37) ).
cnf(i_0_51,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_51) ).
cnf(i_0_54,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_54) ).
cnf(i_0_30,plain,
~ ok(triple(X1,X2,bad)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_30) ).
cnf(i_0_35,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_35) ).
cnf(i_0_34,plain,
( triple(remove_pqp(X1,X2),remove_slb(X3,X2),X4) = remove_cpq(triple(X1,X3,X4),X2)
| ~ contains_slb(X3,X2)
| ~ less_than(lookup_slb(X3,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_34) ).
cnf(i_0_46,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_46) ).
cnf(i_0_41,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_41) ).
cnf(i_0_48,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_48) ).
cnf(i_0_47,negated_conjecture,
check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_47) ).
cnf(i_0_33,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_33) ).
cnf(i_0_49,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_49) ).
cnf(i_0_45,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_45) ).
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/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_39) ).
cnf(i_0_24,plain,
check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25x1zfhw/lgb.p',i_0_24) ).
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))
| ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))) ),
i_0_38 ).
cnf(c_0_72,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_73,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_51 ).
cnf(c_0_74,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_54 ).
cnf(c_0_75,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_71,c_0_72]) ).
cnf(c_0_76,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,plain,
~ ok(triple(X1,X2,bad)),
i_0_30 ).
cnf(c_0_78,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
i_0_35 ).
cnf(c_0_79,plain,
( triple(remove_pqp(X1,X2),remove_slb(X3,X2),X4) = remove_cpq(triple(X1,X3,X4),X2)
| ~ contains_slb(X3,X2)
| ~ less_than(lookup_slb(X3,X2),X2) ),
i_0_34 ).
cnf(c_0_80,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
i_0_46 ).
cnf(c_0_81,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
i_0_41 ).
cnf(c_0_82,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_83,plain,
( ~ strictly_less_than(X1,lookup_slb(X2,X1))
| ~ contains_slb(X2,X1)
| ~ ok(remove_cpq(triple(X3,X2,X4),X1)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_84,plain,
( ~ less_than(lookup_slb(X1,X2),X2)
| ~ contains_slb(X1,X2)
| ~ ok(remove_cpq(triple(X3,X1,bad),X2)) ),
inference(spm,[status(thm)],[c_0_77,c_0_79]) ).
cnf(c_0_85,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_pqp_res(esk1_0))) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_86,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = findmin_cpq_eff(triple(X1,X2,X4))
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_82,c_0_82]) ).
cnf(c_0_87,plain,
( X1 = create_slb
| less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| ~ strictly_less_than(X3,lookup_slb(update_slb(X1,findmin_pqp_res(X2)),X3))
| ~ contains_slb(update_slb(X1,findmin_pqp_res(X2)),X3)
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X2,X1,X4)),X3)) ),
inference(spm,[status(thm)],[c_0_83,c_0_82]) ).
cnf(c_0_88,plain,
( X1 = create_slb
| less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| ~ less_than(lookup_slb(update_slb(X1,findmin_pqp_res(X2)),X3),X3)
| ~ contains_slb(update_slb(X1,findmin_pqp_res(X2)),X3)
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X2,X1,X4)),X3)) ),
inference(spm,[status(thm)],[c_0_84,c_0_82]) ).
cnf(c_0_89,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
i_0_48 ).
cnf(c_0_90,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_pqp_res(esk1_0))) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
( X1 = create_slb
| less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| ~ contains_slb(update_slb(X1,findmin_pqp_res(X2)),X3)
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X2,X1,X4)),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_76]),c_0_88]) ).
cnf(c_0_92,lemma,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| check_cpq(findmin_cpq_eff(triple(X2,X1,X3)))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X2,X1,X3)),X4))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X2,X1,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_89,c_0_72]) ).
cnf(c_0_93,negated_conjecture,
check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
i_0_47 ).
cnf(c_0_94,plain,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| ok(remove_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad),findmin_pqp_res(esk1_0))) ),
inference(spm,[status(thm)],[c_0_90,c_0_82]) ).
cnf(c_0_95,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
i_0_33 ).
cnf(c_0_96,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| ~ contains_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_91,c_0_85]) ).
cnf(c_0_97,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
i_0_49 ).
cnf(c_0_98,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_80]),c_0_93])]) ).
cnf(c_0_99,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
i_0_45 ).
cnf(c_0_100,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_101,plain,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_77]),c_0_96]) ).
cnf(c_0_102,lemma,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]) ).
cnf(c_0_103,plain,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| esk2_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]) ).
cnf(c_0_104,lemma,
( esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_89,c_0_103]) ).
cnf(c_0_105,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_80]),c_0_93])]) ).
cnf(c_0_106,lemma,
esk2_0 = create_slb,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_105]),c_0_99]) ).
cnf(c_0_107,plain,
check_cpq(triple(X1,create_slb,X2)),
i_0_24 ).
cnf(c_0_108,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_106]),c_0_107])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV404+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 : 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 : Wed Jun 15 14:14:55 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.91/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.91/2.38 # No SInE strategy applied
% 7.91/2.38 # Trying AutoSched0 for 150 seconds
% 7.91/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.91/2.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.91/2.38 #
% 7.91/2.38 # Preprocessing time : 0.012 s
% 7.91/2.38 # Presaturation interreduction done
% 7.91/2.38
% 7.91/2.38 # Proof found!
% 7.91/2.38 # SZS status Theorem
% 7.91/2.38 # SZS output start CNFRefutation
% See solution above
% 7.91/2.38 # Training examples: 0 positive, 0 negative
% 7.91/2.38
% 7.91/2.38 # -------------------------------------------------
% 7.91/2.38 # User time : 0.067 s
% 7.91/2.38 # System time : 0.007 s
% 7.91/2.38 # Total time : 0.074 s
% 7.91/2.38 # Maximum resident set size: 7128 pages
% 7.91/2.38
%------------------------------------------------------------------------------