TSTP Solution File: MGT005+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : Sun Jul 17 22:06:13 EDT 2022
% Result : Theorem 7.48s 2.34s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 24
% Syntax : Number of clauses : 71 ( 46 unt; 11 nHn; 71 RR)
% Number of literals : 257 ( 15 equ; 179 neg)
% Maximal clause size : 19 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 125 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X1)
| ~ organization(X5,X6)
| ~ organization(X7,X6)
| ~ reorganization(X5,X6,X1)
| ~ reorganization(X7,X6,X2)
| ~ class(X5,X8,X6)
| ~ class(X7,X8,X6)
| ~ reorganization_type(X5,X9,X6)
| ~ reorganization_type(X7,X9,X6)
| ~ complexity(X5,X3,X6)
| ~ complexity(X7,X4,X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_10) ).
cnf(i_0_23,negated_conjecture,
complexity(esk5_0,esk12_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_23) ).
cnf(i_0_38,negated_conjecture,
organization(esk5_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_38) ).
cnf(i_0_37,negated_conjecture,
organization(esk6_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_37) ).
cnf(i_0_35,negated_conjecture,
organization(esk6_0,esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_35) ).
cnf(i_0_29,negated_conjecture,
reorganization(esk6_0,esk15_0,esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_29) ).
cnf(i_0_21,negated_conjecture,
greater(esk13_0,esk12_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_21) ).
cnf(i_0_22,negated_conjecture,
complexity(esk6_0,esk13_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_22) ).
cnf(i_0_28,negated_conjecture,
reorganization_type(esk5_0,esk7_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_28) ).
cnf(i_0_27,negated_conjecture,
reorganization_type(esk6_0,esk7_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_27) ).
cnf(i_0_34,negated_conjecture,
class(esk5_0,esk8_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_34) ).
cnf(i_0_33,negated_conjecture,
class(esk6_0,esk8_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_33) ).
cnf(i_0_30,negated_conjecture,
reorganization(esk5_0,esk15_0,esk16_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_30) ).
cnf(i_0_19,negated_conjecture,
esk16_0 = esk14_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_19) ).
cnf(i_0_6,plain,
( organization(X1,X2)
| ~ greater(X2,X3)
| ~ greater(X4,X2)
| ~ organization(X1,X4)
| ~ organization(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_6) ).
cnf(i_0_7,plain,
( greater(X1,X2)
| ~ reorganization(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_7) ).
cnf(i_0_11,hypothesis,
( X1 = X2
| greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X6)
| ~ organization(X5,X7)
| ~ organization(X8,X6)
| ~ organization(X8,X7)
| ~ survival_chance(X5,X2,X6)
| ~ survival_chance(X5,X9,X7)
| ~ survival_chance(X8,X1,X6)
| ~ survival_chance(X8,X9,X7)
| ~ reorganization(X5,X7,X10)
| ~ reorganization(X8,X7,X6)
| ~ class(X5,X11,X7)
| ~ class(X8,X11,X7)
| ~ reorganization_type(X5,X12,X7)
| ~ reorganization_type(X8,X12,X7)
| ~ complexity(X5,X3,X7)
| ~ complexity(X8,X4,X7) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_11) ).
cnf(i_0_36,negated_conjecture,
organization(esk5_0,esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_36) ).
cnf(i_0_32,negated_conjecture,
survival_chance(esk5_0,esk9_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_32) ).
cnf(i_0_31,negated_conjecture,
survival_chance(esk6_0,esk9_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_31) ).
cnf(i_0_25,negated_conjecture,
survival_chance(esk5_0,esk10_0,esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_25) ).
cnf(i_0_24,negated_conjecture,
survival_chance(esk6_0,esk11_0,esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_24) ).
cnf(i_0_17,negated_conjecture,
esk11_0 != esk10_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_17) ).
cnf(i_0_18,negated_conjecture,
~ greater(esk10_0,esk11_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-odxmy_fq/lgb.p',i_0_18) ).
cnf(c_0_63,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X1)
| ~ organization(X5,X6)
| ~ organization(X7,X6)
| ~ reorganization(X5,X6,X1)
| ~ reorganization(X7,X6,X2)
| ~ class(X5,X8,X6)
| ~ class(X7,X8,X6)
| ~ reorganization_type(X5,X9,X6)
| ~ reorganization_type(X7,X9,X6)
| ~ complexity(X5,X3,X6)
| ~ complexity(X7,X4,X6) ),
i_0_10 ).
cnf(c_0_64,negated_conjecture,
complexity(esk5_0,esk12_0,esk15_0),
i_0_23 ).
cnf(c_0_65,negated_conjecture,
organization(esk5_0,esk15_0),
i_0_38 ).
cnf(c_0_66,negated_conjecture,
( greater(X1,X2)
| ~ complexity(X3,X4,esk15_0)
| ~ reorganization_type(esk5_0,X5,esk15_0)
| ~ reorganization_type(X3,X5,esk15_0)
| ~ class(esk5_0,X6,esk15_0)
| ~ class(X3,X6,esk15_0)
| ~ reorganization(esk5_0,esk15_0,X2)
| ~ reorganization(X3,esk15_0,X1)
| ~ greater(X4,esk12_0)
| ~ organization(X3,esk15_0)
| ~ organization(X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_67,negated_conjecture,
organization(esk6_0,esk15_0),
i_0_37 ).
cnf(c_0_68,negated_conjecture,
( greater(X1,X2)
| ~ complexity(esk6_0,X3,esk15_0)
| ~ reorganization_type(esk5_0,X4,esk15_0)
| ~ reorganization_type(esk6_0,X4,esk15_0)
| ~ class(esk5_0,X5,esk15_0)
| ~ class(esk6_0,X5,esk15_0)
| ~ reorganization(esk5_0,esk15_0,X2)
| ~ reorganization(esk6_0,esk15_0,X1)
| ~ greater(X3,esk12_0)
| ~ organization(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_69,negated_conjecture,
organization(esk6_0,esk17_0),
i_0_35 ).
cnf(c_0_70,negated_conjecture,
reorganization(esk6_0,esk15_0,esk17_0),
i_0_29 ).
cnf(c_0_71,negated_conjecture,
( greater(esk17_0,X1)
| ~ complexity(esk6_0,X2,esk15_0)
| ~ reorganization_type(esk5_0,X3,esk15_0)
| ~ reorganization_type(esk6_0,X3,esk15_0)
| ~ class(esk5_0,X4,esk15_0)
| ~ class(esk6_0,X4,esk15_0)
| ~ reorganization(esk5_0,esk15_0,X1)
| ~ greater(X2,esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_72,negated_conjecture,
greater(esk13_0,esk12_0),
i_0_21 ).
cnf(c_0_73,negated_conjecture,
complexity(esk6_0,esk13_0,esk15_0),
i_0_22 ).
cnf(c_0_74,negated_conjecture,
( greater(esk17_0,X1)
| ~ reorganization_type(esk5_0,X2,esk15_0)
| ~ reorganization_type(esk6_0,X2,esk15_0)
| ~ class(esk5_0,X3,esk15_0)
| ~ class(esk6_0,X3,esk15_0)
| ~ reorganization(esk5_0,esk15_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).
cnf(c_0_75,negated_conjecture,
reorganization_type(esk5_0,esk7_0,esk15_0),
i_0_28 ).
cnf(c_0_76,negated_conjecture,
reorganization_type(esk6_0,esk7_0,esk15_0),
i_0_27 ).
cnf(c_0_77,negated_conjecture,
( greater(esk17_0,X1)
| ~ class(esk5_0,X2,esk15_0)
| ~ class(esk6_0,X2,esk15_0)
| ~ reorganization(esk5_0,esk15_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])]) ).
cnf(c_0_78,negated_conjecture,
class(esk5_0,esk8_0,esk15_0),
i_0_34 ).
cnf(c_0_79,negated_conjecture,
class(esk6_0,esk8_0,esk15_0),
i_0_33 ).
cnf(c_0_80,negated_conjecture,
reorganization(esk5_0,esk15_0,esk16_0),
i_0_30 ).
cnf(c_0_81,negated_conjecture,
esk16_0 = esk14_0,
i_0_19 ).
cnf(c_0_82,negated_conjecture,
( greater(esk17_0,X1)
| ~ reorganization(esk5_0,esk15_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]) ).
cnf(c_0_83,negated_conjecture,
reorganization(esk5_0,esk15_0,esk14_0),
inference(rw,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_84,plain,
( organization(X1,X2)
| ~ greater(X2,X3)
| ~ greater(X4,X2)
| ~ organization(X1,X4)
| ~ organization(X1,X3) ),
i_0_6 ).
cnf(c_0_85,negated_conjecture,
greater(esk17_0,esk14_0),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,plain,
( greater(X1,X2)
| ~ reorganization(X3,X2,X1) ),
i_0_7 ).
cnf(c_0_87,plain,
( organization(X1,esk14_0)
| ~ greater(esk14_0,X2)
| ~ organization(X1,esk17_0)
| ~ organization(X1,X2) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_88,plain,
greater(esk14_0,esk15_0),
inference(spm,[status(thm)],[c_0_86,c_0_83]) ).
cnf(c_0_89,hypothesis,
( X1 = X2
| greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X6)
| ~ organization(X5,X7)
| ~ organization(X8,X6)
| ~ organization(X8,X7)
| ~ survival_chance(X5,X2,X6)
| ~ survival_chance(X5,X9,X7)
| ~ survival_chance(X8,X1,X6)
| ~ survival_chance(X8,X9,X7)
| ~ reorganization(X5,X7,X10)
| ~ reorganization(X8,X7,X6)
| ~ class(X5,X11,X7)
| ~ class(X8,X11,X7)
| ~ reorganization_type(X5,X12,X7)
| ~ reorganization_type(X8,X12,X7)
| ~ complexity(X5,X3,X7)
| ~ complexity(X8,X4,X7) ),
i_0_11 ).
cnf(c_0_90,plain,
( organization(X1,esk14_0)
| ~ organization(X1,esk17_0)
| ~ organization(X1,esk15_0) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_91,negated_conjecture,
organization(esk5_0,esk17_0),
i_0_36 ).
cnf(c_0_92,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ complexity(X3,X4,esk15_0)
| ~ reorganization_type(esk5_0,X5,esk15_0)
| ~ reorganization_type(X3,X5,esk15_0)
| ~ class(esk5_0,X6,esk15_0)
| ~ class(X3,X6,esk15_0)
| ~ reorganization(esk5_0,esk15_0,X7)
| ~ reorganization(X3,esk15_0,X8)
| ~ survival_chance(esk5_0,X9,esk15_0)
| ~ survival_chance(esk5_0,X1,X7)
| ~ survival_chance(X3,X9,esk15_0)
| ~ survival_chance(X3,X2,X7)
| ~ greater(X4,esk12_0)
| ~ organization(esk5_0,X7)
| ~ organization(X3,esk15_0)
| ~ organization(X3,X7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_64]),c_0_65])]) ).
cnf(c_0_93,negated_conjecture,
organization(esk5_0,esk14_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_65])]) ).
cnf(c_0_94,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ complexity(X3,X4,esk15_0)
| ~ reorganization_type(esk5_0,X5,esk15_0)
| ~ reorganization_type(X3,X5,esk15_0)
| ~ class(esk5_0,X6,esk15_0)
| ~ class(X3,X6,esk15_0)
| ~ reorganization(X3,esk15_0,X7)
| ~ survival_chance(esk5_0,X8,esk15_0)
| ~ survival_chance(esk5_0,X1,esk14_0)
| ~ survival_chance(X3,X8,esk15_0)
| ~ survival_chance(X3,X2,esk14_0)
| ~ greater(X4,esk12_0)
| ~ organization(X3,esk15_0)
| ~ organization(X3,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_83])]) ).
cnf(c_0_95,negated_conjecture,
organization(esk6_0,esk14_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_69]),c_0_67])]) ).
cnf(c_0_96,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ complexity(esk6_0,X3,esk15_0)
| ~ reorganization_type(esk5_0,X4,esk15_0)
| ~ reorganization_type(esk6_0,X4,esk15_0)
| ~ class(esk5_0,X5,esk15_0)
| ~ class(esk6_0,X5,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X6)
| ~ survival_chance(esk5_0,X7,esk15_0)
| ~ survival_chance(esk5_0,X1,esk14_0)
| ~ survival_chance(esk6_0,X7,esk15_0)
| ~ survival_chance(esk6_0,X2,esk14_0)
| ~ greater(X3,esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_67]),c_0_95])]) ).
cnf(c_0_97,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ reorganization_type(esk5_0,X3,esk15_0)
| ~ reorganization_type(esk6_0,X3,esk15_0)
| ~ class(esk5_0,X4,esk15_0)
| ~ class(esk6_0,X4,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X5)
| ~ survival_chance(esk5_0,X6,esk15_0)
| ~ survival_chance(esk5_0,X1,esk14_0)
| ~ survival_chance(esk6_0,X6,esk15_0)
| ~ survival_chance(esk6_0,X2,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_72]),c_0_73])]) ).
cnf(c_0_98,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ class(esk5_0,X3,esk15_0)
| ~ class(esk6_0,X3,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X4)
| ~ survival_chance(esk5_0,X5,esk15_0)
| ~ survival_chance(esk5_0,X1,esk14_0)
| ~ survival_chance(esk6_0,X5,esk15_0)
| ~ survival_chance(esk6_0,X2,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_75]),c_0_76])]) ).
cnf(c_0_99,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ reorganization(esk6_0,esk15_0,X3)
| ~ survival_chance(esk5_0,X4,esk15_0)
| ~ survival_chance(esk5_0,X1,esk14_0)
| ~ survival_chance(esk6_0,X4,esk15_0)
| ~ survival_chance(esk6_0,X2,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_78]),c_0_79])]) ).
cnf(c_0_100,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ survival_chance(esk5_0,X3,esk15_0)
| ~ survival_chance(esk5_0,X1,esk14_0)
| ~ survival_chance(esk6_0,X3,esk15_0)
| ~ survival_chance(esk6_0,X2,esk14_0) ),
inference(spm,[status(thm)],[c_0_99,c_0_70]) ).
cnf(c_0_101,negated_conjecture,
survival_chance(esk5_0,esk9_0,esk15_0),
i_0_32 ).
cnf(c_0_102,negated_conjecture,
survival_chance(esk6_0,esk9_0,esk15_0),
i_0_31 ).
cnf(c_0_103,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ survival_chance(esk5_0,X1,esk14_0)
| ~ survival_chance(esk6_0,X2,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102])]) ).
cnf(c_0_104,negated_conjecture,
survival_chance(esk5_0,esk10_0,esk14_0),
i_0_25 ).
cnf(c_0_105,negated_conjecture,
( esk10_0 = X1
| greater(esk10_0,X1)
| ~ survival_chance(esk6_0,X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_106,negated_conjecture,
survival_chance(esk6_0,esk11_0,esk14_0),
i_0_24 ).
cnf(c_0_107,negated_conjecture,
esk11_0 != esk10_0,
i_0_17 ).
cnf(c_0_108,negated_conjecture,
~ greater(esk10_0,esk11_0),
i_0_18 ).
cnf(c_0_109,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107]),c_0_108]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jun 9 09:03:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.48/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.48/2.34 # No SInE strategy applied
% 7.48/2.34 # Trying AutoSched0 for 150 seconds
% 7.48/2.34 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 7.48/2.34 # and selection function PSelectNewComplexAHP.
% 7.48/2.34 #
% 7.48/2.34 # Preprocessing time : 0.024 s
% 7.48/2.34 # Presaturation interreduction done
% 7.48/2.34
% 7.48/2.34 # Proof found!
% 7.48/2.34 # SZS status Theorem
% 7.48/2.34 # SZS output start CNFRefutation
% See solution above
% 7.48/2.34 # Training examples: 0 positive, 0 negative
% 7.48/2.34
% 7.48/2.34 # -------------------------------------------------
% 7.48/2.34 # User time : 0.035 s
% 7.48/2.34 # System time : 0.007 s
% 7.48/2.34 # Total time : 0.043 s
% 7.48/2.34 # Maximum resident set size: 7124 pages
% 7.48/2.34
%------------------------------------------------------------------------------