TSTP Solution File: KLE033+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE033+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 01:49:45 EDT 2022
% Result : Theorem 7.81s 2.37s
% Output : CNFRefutation 7.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 93 ( 65 unt; 0 def)
% Number of atoms : 178 ( 72 equ)
% Maximal formula atoms : 20 ( 1 avg)
% Number of connectives : 135 ( 50 ~; 53 |; 23 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 136 ( 4 sgn 71 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X6)
& test(X5)
& ismeet(zero,X5,X6) )
=> ismeet(zero,multiplication(X5,X4),multiplication(X6,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(ismeet,axiom,
! [X4,X5,X6] :
( ismeet(X6,X4,X5)
<=> ( leq(X6,X4)
& leq(X6,X5)
& ! [X7] :
( ( leq(X7,X4)
& leq(X7,X5) )
=> leq(X7,X6) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+3.ax',ismeet) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(c_0_16,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X6)
& test(X5)
& ismeet(zero,X5,X6) )
=> ismeet(zero,multiplication(X5,X4),multiplication(X6,X4)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_17,plain,
! [X30,X32,X33] :
( ( ~ test(X30)
| complement(esk1_1(X30),X30) )
& ( ~ complement(X33,X32)
| test(X32) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])]) ).
fof(c_0_18,negated_conjecture,
( test(esk6_0)
& test(esk5_0)
& ismeet(zero,esk5_0,esk6_0)
& ~ ismeet(zero,multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_19,plain,
! [X10,X11,X12] : addition(X12,addition(X11,X10)) = addition(addition(X12,X11),X10),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_20,plain,
! [X14] : addition(X14,X14) = X14,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_21,plain,
! [X34,X35] :
( ( multiplication(X34,X35) = zero
| ~ complement(X35,X34) )
& ( multiplication(X35,X34) = zero
| ~ complement(X35,X34) )
& ( addition(X34,X35) = one
| ~ complement(X35,X34) )
& ( multiplication(X34,X35) != zero
| multiplication(X35,X34) != zero
| addition(X34,X35) != one
| complement(X35,X34) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_22,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
test(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X13] : addition(X13,zero) = X13,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_26,plain,
! [X8,X9] : addition(X8,X9) = addition(X9,X8),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_27,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
complement(esk1_1(esk5_0),esk5_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
complement(esk1_1(esk6_0),esk6_0),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
fof(c_0_32,plain,
! [X28,X29] :
( ( ~ leq(X28,X29)
| addition(X28,X29) = X29 )
& ( addition(X28,X29) != X29
| leq(X28,X29) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_33,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_35,plain,
! [X23,X24,X25] : multiplication(addition(X23,X24),X25) = addition(multiplication(X23,X25),multiplication(X24,X25)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_36,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,negated_conjecture,
addition(esk5_0,esk1_1(esk5_0)) = one,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_38,plain,
! [X19] : multiplication(one,X19) = X19,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_39,plain,
! [X20,X21,X22] : multiplication(X20,addition(X21,X22)) = addition(multiplication(X20,X21),multiplication(X20,X22)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_40,negated_conjecture,
addition(esk6_0,esk1_1(esk6_0)) = one,
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
fof(c_0_41,plain,
! [X18] : multiplication(X18,one) = X18,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_42,plain,
! [X39,X40,X41,X42,X43,X44,X45] :
( ( leq(X41,X39)
| ~ ismeet(X41,X39,X40) )
& ( leq(X41,X40)
| ~ ismeet(X41,X39,X40) )
& ( ~ leq(X42,X39)
| ~ leq(X42,X40)
| leq(X42,X41)
| ~ ismeet(X41,X39,X40) )
& ( leq(esk2_3(X43,X44,X45),X43)
| ~ leq(X45,X43)
| ~ leq(X45,X44)
| ismeet(X45,X43,X44) )
& ( leq(esk2_3(X43,X44,X45),X44)
| ~ leq(X45,X43)
| ~ leq(X45,X44)
| ismeet(X45,X43,X44) )
& ( ~ leq(esk2_3(X43,X44,X45),X45)
| ~ leq(X45,X43)
| ~ leq(X45,X44)
| ismeet(X45,X43,X44) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[ismeet])])])])])]) ).
cnf(c_0_43,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_45,plain,
! [X36,X37] :
( ( c(X36) != X37
| complement(X36,X37)
| ~ test(X36) )
& ( ~ complement(X36,X37)
| c(X36) = X37
| ~ test(X36) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
cnf(c_0_46,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_47,negated_conjecture,
addition(one,esk5_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34]) ).
cnf(c_0_48,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_50,negated_conjecture,
addition(one,esk6_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_40]),c_0_34]) ).
cnf(c_0_51,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,plain,
( leq(esk2_3(X1,X2,X3),X1)
| ismeet(X3,X1,X2)
| ~ leq(X3,X1)
| ~ leq(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_53,plain,
leq(zero,X1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_54,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_55,plain,
( leq(esk2_3(X1,X2,X3),X2)
| ismeet(X3,X1,X2)
| ~ leq(X3,X1)
| ~ leq(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_56,plain,
( leq(X1,X4)
| ~ leq(X1,X2)
| ~ leq(X1,X3)
| ~ ismeet(X4,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_57,negated_conjecture,
ismeet(zero,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_58,plain,
( leq(X1,X2)
| addition(X2,X1) != X2 ),
inference(spm,[status(thm)],[c_0_43,c_0_34]) ).
cnf(c_0_59,negated_conjecture,
addition(X1,multiplication(esk5_0,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_48]) ).
cnf(c_0_60,negated_conjecture,
addition(X1,multiplication(X1,esk6_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_51]) ).
cnf(c_0_61,negated_conjecture,
~ ismeet(zero,multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_62,plain,
( ismeet(zero,X1,X2)
| leq(esk2_3(X1,X2,zero),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_53])]) ).
cnf(c_0_63,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_64,plain,
( ismeet(zero,X1,X2)
| leq(esk2_3(X1,X2,zero),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_53]),c_0_53])]) ).
cnf(c_0_65,negated_conjecture,
( leq(X1,zero)
| ~ leq(X1,esk6_0)
| ~ leq(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_66,negated_conjecture,
leq(multiplication(esk5_0,X1),X1),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
leq(multiplication(X1,esk6_0),X1),
inference(spm,[status(thm)],[c_0_58,c_0_60]) ).
cnf(c_0_68,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_69,negated_conjecture,
leq(esk2_3(multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0),zero),multiplication(esk5_0,esk4_0)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
fof(c_0_70,plain,
! [X15,X16,X17] : multiplication(X15,multiplication(X16,X17)) = multiplication(multiplication(X15,X16),X17),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_71,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_72,negated_conjecture,
complement(esk5_0,c(esk5_0)),
inference(spm,[status(thm)],[c_0_63,c_0_23]) ).
fof(c_0_73,plain,
! [X27] : multiplication(zero,X27) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_74,negated_conjecture,
leq(esk2_3(multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0),zero),multiplication(esk6_0,esk4_0)),
inference(spm,[status(thm)],[c_0_61,c_0_64]) ).
cnf(c_0_75,negated_conjecture,
leq(multiplication(esk5_0,esk6_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_76,negated_conjecture,
addition(multiplication(esk5_0,esk4_0),esk2_3(multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0),zero)) = multiplication(esk5_0,esk4_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_34]) ).
cnf(c_0_77,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_78,negated_conjecture,
multiplication(c(esk5_0),esk5_0) = zero,
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_79,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_80,negated_conjecture,
addition(multiplication(esk6_0,esk4_0),esk2_3(multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0),zero)) = multiplication(esk6_0,esk4_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_74]),c_0_34]) ).
cnf(c_0_81,negated_conjecture,
multiplication(esk5_0,esk6_0) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_75]),c_0_33]) ).
cnf(c_0_82,negated_conjecture,
addition(esk5_0,c(esk5_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_72]),c_0_34]) ).
cnf(c_0_83,negated_conjecture,
addition(multiplication(X1,multiplication(esk5_0,esk4_0)),multiplication(X1,esk2_3(multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0),zero))) = multiplication(X1,multiplication(esk5_0,esk4_0)),
inference(spm,[status(thm)],[c_0_49,c_0_76]) ).
cnf(c_0_84,negated_conjecture,
multiplication(c(esk5_0),multiplication(esk5_0,X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_85,negated_conjecture,
addition(multiplication(X1,multiplication(esk6_0,esk4_0)),multiplication(X1,esk2_3(multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0),zero))) = multiplication(X1,multiplication(esk6_0,esk4_0)),
inference(spm,[status(thm)],[c_0_49,c_0_80]) ).
cnf(c_0_86,negated_conjecture,
multiplication(esk5_0,multiplication(esk6_0,X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_81]),c_0_79]) ).
cnf(c_0_87,negated_conjecture,
addition(multiplication(esk5_0,X1),multiplication(c(esk5_0),X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_82]),c_0_48]) ).
cnf(c_0_88,negated_conjecture,
multiplication(c(esk5_0),esk2_3(multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0),zero)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_44]) ).
cnf(c_0_89,negated_conjecture,
multiplication(esk5_0,esk2_3(multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0),zero)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_44]) ).
cnf(c_0_90,plain,
( ismeet(X3,X1,X2)
| ~ leq(esk2_3(X1,X2,X3),X3)
| ~ leq(X3,X1)
| ~ leq(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_91,negated_conjecture,
esk2_3(multiplication(esk5_0,esk4_0),multiplication(esk6_0,esk4_0),zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_33]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_53]),c_0_53]),c_0_53])]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE033+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n018.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 : Thu Jun 16 07:38:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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
% 7.81/2.37 # ENIGMATIC: Solved by autoschedule:
% 7.81/2.37 # No SInE strategy applied
% 7.81/2.37 # Trying AutoSched0 for 150 seconds
% 7.81/2.37 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S002A
% 7.81/2.37 # and selection function SelectNegativeLiterals.
% 7.81/2.37 #
% 7.81/2.37 # Preprocessing time : 0.026 s
% 7.81/2.37 # Presaturation interreduction done
% 7.81/2.37
% 7.81/2.37 # Proof found!
% 7.81/2.37 # SZS status Theorem
% 7.81/2.37 # SZS output start CNFRefutation
% See solution above
% 7.81/2.37 # Training examples: 0 positive, 1 negative
% 7.81/2.37
% 7.81/2.37 # -------------------------------------------------
% 7.81/2.37 # User time : 0.071 s
% 7.81/2.37 # System time : 0.009 s
% 7.81/2.37 # Total time : 0.080 s
% 7.81/2.37 # Maximum resident set size: 7120 pages
% 7.81/2.37
%------------------------------------------------------------------------------