%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV380+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:02 EDT 2022
% Result : Theorem 7.60s 2.50s
% Output : CNFRefutation 7.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 15 unt; 26 nHn; 24 RR)
% Number of literals : 92 ( 39 equ; 23 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 83 ( 31 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/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/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/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_37) ).
cnf(i_0_49,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_49) ).
cnf(i_0_52,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_52) ).
cnf(i_0_46,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_46) ).
cnf(i_0_31,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_31) ).
cnf(i_0_30,plain,
~ ok(triple(X1,X2,bad)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_30) ).
cnf(i_0_45,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/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_45) ).
cnf(i_0_47,lemma,
( ok(triple(X1,X2,X3))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_47) ).
cnf(i_0_41,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_41) ).
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-3gw3guxk/lgb.p',i_0_39) ).
cnf(i_0_36,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_36) ).
cnf(i_0_40,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gw3guxk/lgb.p',i_0_40) ).
cnf(c_0_66,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_67,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_68,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_49 ).
cnf(c_0_69,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_52 ).
cnf(c_0_70,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_66,c_0_67]) ).
cnf(c_0_71,plain,
( less_than(X1,X2)
| strictly_less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
i_0_46 ).
cnf(c_0_73,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
i_0_31 ).
cnf(c_0_74,plain,
~ ok(triple(X1,X2,bad)),
i_0_30 ).
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
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,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_45 ).
cnf(c_0_77,negated_conjecture,
esk3_0 = bad,
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,lemma,
( ok(triple(X1,X2,X3))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
i_0_47 ).
cnf(c_0_79,plain,
( X1 = create_slb
| less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_80,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)),findmin_cpq_res(triple(esk1_0,esk2_0,bad)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_77]) ).
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,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[c_0_74,c_0_67]) ).
cnf(c_0_83,lemma,
( X1 = create_slb
| less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X2,X1,X3)),X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_75]),c_0_79]) ).
cnf(c_0_84,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)),findmin_pqp_res(esk1_0))) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,lemma,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X2,X1,X3)),X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_67]),c_0_82]) ).
cnf(c_0_86,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_87,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_85,c_0_84]) ).
cnf(c_0_89,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_86,c_0_87]),c_0_88]) ).
cnf(c_0_90,lemma,
( esk2_0 = create_slb
| ok(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_78,c_0_89]) ).
cnf(c_0_91,plain,
( esk2_0 = create_slb
| ~ ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad))) ),
inference(spm,[status(thm)],[c_0_74,c_0_89]) ).
cnf(c_0_92,negated_conjecture,
esk2_0 = create_slb,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_84]),c_0_91]) ).
cnf(c_0_93,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
i_0_36 ).
cnf(c_0_94,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
i_0_40 ).
cnf(c_0_95,negated_conjecture,
ok(remove_cpq(triple(esk1_0,create_slb,bad),bottom)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_92]),c_0_93]),c_0_92]),c_0_94]) ).
cnf(c_0_96,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_95]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV380+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 07:09:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/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.60/2.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.60/2.50 # No SInE strategy applied
% 7.60/2.50 # Trying AutoSched0 for 150 seconds
% 7.60/2.50 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S069N
% 7.60/2.50 # and selection function SelectComplexAHPExceptRRHorn.
% 7.60/2.50 #
% 7.60/2.50 # Preprocessing time : 0.024 s
% 7.60/2.50 # Presaturation interreduction done
% 7.60/2.50
% 7.60/2.50 # Proof found!
% 7.60/2.50 # SZS status Theorem
% 7.60/2.50 # SZS output start CNFRefutation
% See solution above
% 7.60/2.50 # Training examples: 0 positive, 0 negative
% 7.60/2.50
% 7.60/2.50 # -------------------------------------------------
% 7.60/2.50 # User time : 0.060 s
% 7.60/2.50 # System time : 0.009 s
% 7.60/2.50 # Total time : 0.069 s
% 7.60/2.50 # Maximum resident set size: 7124 pages
% 7.60/2.50
%------------------------------------------------------------------------------