%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO026-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:07:01 PM UTC 2026
% Result : Unsatisfiable 0.53s 0.51s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 11
% Syntax : Number of clauses : 99 ( 99 unt; 0 nHn; 23 RR)
% Number of literals : 99 ( 98 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 120 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(add_multiply_property,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X2,X1),add(X3,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_multiply_property) ).
cnf(multiply_add_property,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_add_property) ).
cnf(pixley1_dual,axiom,
multiply(add(X1,inverse(X1)),multiply(add(X1,X2),add(inverse(X1),X2))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pixley1_dual) ).
cnf(additive_inverse,axiom,
add(X1,inverse(X1)) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_inverse) ).
cnf(multiplicative_inverse,axiom,
multiply(X1,inverse(X1)) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_inverse) ).
cnf(pixley1,axiom,
add(multiply(X1,inverse(X1)),add(multiply(X1,X2),multiply(inverse(X1),X2))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pixley1) ).
cnf(pixley2,axiom,
add(multiply(X1,inverse(X2)),add(multiply(X1,X2),multiply(inverse(X2),X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pixley2) ).
cnf(pixley2_dual,axiom,
multiply(add(X1,inverse(X2)),multiply(add(X1,X2),add(inverse(X2),X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pixley2_dual) ).
cnf(pixley3,axiom,
add(multiply(X1,inverse(X2)),add(multiply(X1,X1),multiply(inverse(X2),X1))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pixley3) ).
cnf(pixley3_dual,axiom,
multiply(add(X1,inverse(X2)),multiply(add(X1,X1),add(inverse(X2),X1))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pixley3_dual) ).
cnf(prove_multiply_add,negated_conjecture,
multiply(add(a,b),b) != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_multiply_add) ).
cnf(c_0_11,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X2,X1),add(X3,X1)),
add_multiply_property ).
cnf(c_0_12,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
multiply_add_property ).
cnf(c_0_13,axiom,
multiply(add(X1,inverse(X1)),multiply(add(X1,X2),add(inverse(X1),X2))) = X2,
pixley1_dual ).
cnf(c_0_14,axiom,
add(X1,inverse(X1)) = n1,
additive_inverse ).
cnf(c_0_15,axiom,
multiply(X1,inverse(X1)) = n0,
multiplicative_inverse ).
cnf(c_0_16,plain,
multiply(multiply(X1,add(X2,X3)),add(X4,multiply(X3,X1))) = add(multiply(X3,X1),multiply(multiply(X2,X1),X4)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
multiply(n1,add(X1,n0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_11]),c_0_15]) ).
cnf(c_0_18,axiom,
add(multiply(X1,inverse(X1)),add(multiply(X1,X2),multiply(inverse(X1),X2))) = X2,
pixley1 ).
cnf(c_0_19,plain,
add(multiply(n0,n1),multiply(multiply(X1,n1),X2)) = multiply(X1,add(X2,multiply(n0,n1))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
add(n0,multiply(X1,n1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15]),c_0_12]),c_0_14]) ).
cnf(c_0_21,plain,
multiply(X1,add(n1,multiply(n0,n1))) = multiply(n1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_20]) ).
cnf(c_0_22,plain,
multiply(n1,add(X1,multiply(n0,n1))) = multiply(n1,add(n0,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_21]),c_0_12]) ).
cnf(c_0_23,plain,
multiply(n1,add(n0,n1)) = multiply(n1,n1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
multiply(inverse(X1),add(X2,X1)) = add(multiply(X2,inverse(X1)),n0),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_25,plain,
add(multiply(X1,add(n0,n1)),multiply(n1,n1)) = add(n1,multiply(n0,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_11]) ).
cnf(c_0_26,plain,
add(add(multiply(X1,inverse(X2)),n0),multiply(X3,add(X1,X2))) = multiply(add(X1,X2),add(inverse(X2),X3)),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_27,plain,
multiply(n1,add(n1,n1)) = add(n1,multiply(n0,n1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_12]) ).
cnf(c_0_28,plain,
multiply(X1,add(X2,multiply(X1,n1))) = add(multiply(X1,n1),multiply(n0,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_29,plain,
add(X1,multiply(X2,add(X1,n0))) = multiply(add(X1,n0),add(n1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_30,plain,
multiply(add(n1,multiply(n0,n1)),add(X1,X2)) = add(multiply(n1,X1),multiply(n1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_21]) ).
cnf(c_0_31,plain,
add(add(n0,n0),add(n1,multiply(n0,n1))) = add(n1,n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15]),c_0_11]),c_0_15]) ).
cnf(c_0_32,plain,
multiply(n1,n0) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_12]),c_0_17]) ).
cnf(c_0_33,plain,
add(X1,multiply(n0,add(X1,n0))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_29]),c_0_20]) ).
cnf(c_0_34,plain,
add(multiply(n1,n1),n0) = n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_30]),c_0_32]),c_0_17]),c_0_21]),c_0_20]) ).
cnf(c_0_35,plain,
add(multiply(X1,add(X2,n0)),X2) = multiply(add(X2,n0),add(X1,n1)),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_36,plain,
multiply(inverse(X1),add(X1,X2)) = add(n0,multiply(X2,inverse(X1))),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_37,plain,
multiply(n1,n1) = n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_12]),c_0_17]) ).
cnf(c_0_38,plain,
add(X1,X1) = multiply(add(X1,n0),add(n1,n1)),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_39,plain,
add(n0,multiply(multiply(n0,add(X1,n0)),inverse(X1))) = multiply(inverse(X1),X1),
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_40,plain,
add(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_34,c_0_37]) ).
cnf(c_0_41,plain,
add(n0,multiply(multiply(n0,n1),inverse(n1))) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_21]),c_0_15]) ).
cnf(c_0_42,plain,
multiply(inverse(X1),multiply(add(X1,n0),add(n1,n1))) = add(n0,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_38]),c_0_15]) ).
cnf(c_0_43,axiom,
add(multiply(X1,inverse(X2)),add(multiply(X1,X2),multiply(inverse(X2),X2))) = X1,
pixley2 ).
cnf(c_0_44,plain,
multiply(inverse(n1),n1) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,plain,
add(n0,n0) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_27]),c_0_21]),c_0_15]) ).
cnf(c_0_46,plain,
add(multiply(X1,inverse(X2)),multiply(X2,add(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_43,c_0_12]) ).
cnf(c_0_47,plain,
inverse(n1) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_44]),c_0_45]) ).
cnf(c_0_48,plain,
multiply(add(X1,multiply(X2,n1)),X2) = add(multiply(X2,n1),multiply(X1,n0)),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_49,axiom,
multiply(add(X1,inverse(X2)),multiply(add(X1,X2),add(inverse(X2),X2))) = X1,
pixley2_dual ).
cnf(c_0_50,plain,
add(multiply(X1,n0),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_17]) ).
cnf(c_0_51,plain,
multiply(inverse(n0),n0) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_45]),c_0_15]),c_0_45]) ).
cnf(c_0_52,plain,
add(n0,add(multiply(n1,n1),multiply(X1,n0))) = add(X1,multiply(n1,n1)),
inference(spm,[status(thm)],[c_0_20,c_0_48]) ).
cnf(c_0_53,plain,
multiply(add(X1,inverse(X2)),add(X2,multiply(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_49,c_0_11]) ).
cnf(c_0_54,plain,
inverse(n0) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_14]) ).
cnf(c_0_55,plain,
add(n0,add(multiply(n1,n1),n0)) = add(n1,multiply(n1,n1)),
inference(spm,[status(thm)],[c_0_52,c_0_32]) ).
cnf(c_0_56,plain,
multiply(add(X1,n1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_20]) ).
cnf(c_0_57,plain,
add(n0,n1) = add(n1,n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_34]),c_0_37]) ).
cnf(c_0_58,plain,
multiply(n0,n1) = n0,
inference(rw,[status(thm)],[c_0_44,c_0_47]) ).
cnf(c_0_59,axiom,
add(multiply(X1,inverse(X2)),add(multiply(X1,X1),multiply(inverse(X2),X1))) = X1,
pixley3 ).
cnf(c_0_60,plain,
add(X1,n1) = add(n1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_56]),c_0_56]) ).
cnf(c_0_61,plain,
add(n1,n1) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_37]),c_0_57]) ).
cnf(c_0_62,plain,
multiply(X1,n1) = multiply(n1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_58]),c_0_40]) ).
cnf(c_0_63,plain,
multiply(add(X1,inverse(X2)),n1) = add(inverse(X2),multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_64,plain,
add(multiply(X1,inverse(X2)),multiply(X1,add(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_59,c_0_12]) ).
cnf(c_0_65,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_60]),c_0_17]),c_0_61]),c_0_62]),c_0_17]) ).
cnf(c_0_66,plain,
add(n0,add(inverse(X1),multiply(X2,X1))) = add(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_20,c_0_63]) ).
cnf(c_0_67,axiom,
multiply(add(X1,inverse(X2)),multiply(add(X1,X1),add(inverse(X2),X1))) = X1,
pixley3_dual ).
cnf(c_0_68,plain,
multiply(inverse(X1),inverse(X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_65]) ).
cnf(c_0_69,plain,
add(n0,X1) = add(X1,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_47]),c_0_20]) ).
cnf(c_0_70,plain,
multiply(add(X1,inverse(X2)),add(X1,multiply(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_67,c_0_11]) ).
cnf(c_0_71,plain,
multiply(n1,inverse(X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_68]),c_0_65]),c_0_14]),c_0_62]) ).
cnf(c_0_72,plain,
add(n0,inverse(X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_68]),c_0_65]),c_0_15]),c_0_69]) ).
cnf(c_0_73,plain,
multiply(X1,n0) = multiply(n0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_50]),c_0_50]) ).
cnf(c_0_74,plain,
multiply(add(X1,n0),add(n1,inverse(X1))) = add(X1,add(n0,multiply(n0,inverse(X1)))),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_75,plain,
add(n1,inverse(X1)) = n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_11]),c_0_37]),c_0_60]) ).
cnf(c_0_76,plain,
multiply(n0,inverse(X1)) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_72]),c_0_12]),c_0_65]),c_0_73]) ).
cnf(c_0_77,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_65]),c_0_65]) ).
cnf(c_0_78,plain,
add(X1,n0) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_62]),c_0_17]),c_0_76]),c_0_65]) ).
cnf(c_0_79,plain,
add(X1,multiply(multiply(n0,n1),add(X1,n0))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_29]),c_0_17]) ).
cnf(c_0_80,plain,
add(inverse(X1),multiply(X1,X1)) = multiply(n1,n1),
inference(spm,[status(thm)],[c_0_63,c_0_14]) ).
cnf(c_0_81,plain,
multiply(X1,add(X2,X1)) = add(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_65]),c_0_77]) ).
cnf(c_0_82,plain,
add(n0,X1) = X1,
inference(rw,[status(thm)],[c_0_69,c_0_78]) ).
cnf(c_0_83,plain,
add(X1,multiply(n0,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_78]),c_0_62]),c_0_32]) ).
cnf(c_0_84,plain,
add(n0,multiply(multiply(X1,X1),inverse(inverse(X1)))) = multiply(inverse(inverse(X1)),multiply(n1,n1)),
inference(spm,[status(thm)],[c_0_36,c_0_80]) ).
cnf(c_0_85,plain,
multiply(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]) ).
cnf(c_0_86,plain,
multiply(n1,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_78]) ).
cnf(c_0_87,plain,
multiply(X1,inverse(inverse(X1))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_37]),c_0_85]),c_0_82]),c_0_62]),c_0_86]) ).
cnf(c_0_88,plain,
multiply(add(X1,inverse(inverse(X1))),n1) = add(inverse(inverse(X1)),n0),
inference(spm,[status(thm)],[c_0_63,c_0_15]) ).
cnf(c_0_89,negated_conjecture,
multiply(add(a,b),b) != b,
inference(fof_simplification,[status(thm)],[prove_multiply_add]) ).
cnf(c_0_90,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_87]),c_0_14]),c_0_88]),c_0_69]),c_0_72]) ).
cnf(c_0_91,negated_conjecture,
multiply(add(a,b),b) != b,
c_0_89 ).
cnf(c_0_92,plain,
add(X1,multiply(X2,X1)) = add(X1,multiply(n0,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_82]),c_0_81]) ).
cnf(c_0_93,plain,
multiply(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_76,c_0_90]) ).
cnf(c_0_94,negated_conjecture,
multiply(b,add(a,b)) != b,
inference(rw,[status(thm)],[c_0_91,c_0_77]) ).
cnf(c_0_95,plain,
add(X1,multiply(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93]),c_0_78]) ).
cnf(c_0_96,negated_conjecture,
add(b,multiply(b,a)) != b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_81]),c_0_77]) ).
cnf(c_0_97,plain,
add(X1,multiply(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_95,c_0_77]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : BOO026-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n018.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 21 13:51:00 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.51 % Version: 3.5.1
% 0.53/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.53/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.53/0.51 % Starting sh5l with 300s (1) cores
% 0.53/0.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2054770 completed with status 0
% 0.53/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.53/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.51 % No SInE strategy applied
% 0.53/0.51 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.53/0.51 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.53/0.51 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.53/0.51 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.53/0.51 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.53/0.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2054775 completed with status 0
% 0.53/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.53/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.51 % No SInE strategy applied
% 0.53/0.51 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.53/0.51 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.53/0.51 % Preprocessing time : 0.001 s
% 0.53/0.51 % Presaturation interreduction done
% 0.53/0.51
% 0.53/0.51 % Proof found!
% 0.53/0.51 % SZS status Unsatisfiable
% 0.53/0.51 % SZS output start CNFRefutation
% See solution above
% 0.53/0.51 % Parsed axioms : 11
% 0.53/0.51 % Removed by relevancy pruning/SinE : 0
% 0.53/0.51 % Initial clauses : 11
% 0.53/0.51 % Removed in clause preprocessing : 0
% 0.53/0.51 % Initial clauses in saturation : 11
% 0.53/0.51 % Processed clauses : 335
% 0.53/0.51 % ...of these trivial : 109
% 0.53/0.51 % ...subsumed : 27
% 0.53/0.51 % ...remaining for further processing : 199
% 0.53/0.51 % Other redundant clauses eliminated : 0
% 0.53/0.51 % Clauses deleted for lack of memory : 0
% 0.53/0.51 % Backward-subsumed : 3
% 0.53/0.51 % Backward-rewritten : 153
% 0.53/0.51 % Generated clauses : 3974
% 0.53/0.51 % ...of the previous two non-redundant : 3162
% 0.53/0.51 % ...aggressively subsumed : 0
% 0.53/0.51 % Contextual simplify-reflections : 0
% 0.53/0.51 % Paramodulations : 3974
% 0.53/0.51 % Factorizations : 0
% 0.53/0.51 % NegExts : 0
% 0.53/0.51 % Equation resolutions : 0
% 0.53/0.51 % Disequality decompositions : 0
% 0.53/0.51 % Total rewrite steps : 4311
% 0.53/0.51 % ...of those cached : 3671
% 0.53/0.51 % Propositional unsat checks : 0
% 0.53/0.51 % Propositional check models : 0
% 0.53/0.51 % Propositional check unsatisfiable : 0
% 0.53/0.51 % Propositional clauses : 0
% 0.53/0.51 % Propositional clauses after purity: 0
% 0.53/0.51 % Propositional unsat core size : 0
% 0.53/0.51 % Propositional preprocessing time : 0.000
% 0.53/0.51 % Propositional encoding time : 0.000
% 0.53/0.51 % Propositional solver time : 0.000
% 0.53/0.51 % Success case prop preproc time : 0.000
% 0.53/0.51 % Success case prop encoding time : 0.000
% 0.53/0.51 % Success case prop solver time : 0.000
% 0.53/0.51 % Current number of processed clauses : 32
% 0.53/0.51 % Positive orientable unit clauses : 30
% 0.53/0.51 % Positive unorientable unit clauses: 2
% 0.53/0.51 % Negative unit clauses : 0
% 0.53/0.51 % Non-unit-clauses : 0
% 0.53/0.51 % Current number of unprocessed clauses: 2741
% 0.53/0.51 % ...number of literals in the above : 2741
% 0.53/0.51 % Current number of archived formulas : 0
% 0.53/0.51 % Current number of archived clauses : 167
% 0.53/0.51 % Clause-clause subsumption calls (NU) : 0
% 0.53/0.51 % Rec. Clause-clause subsumption calls : 0
% 0.53/0.51 % Non-unit clause-clause subsumptions : 0
% 0.53/0.51 % Unit Clause-clause subsumption calls : 115
% 0.53/0.51 % Rewrite failures with RHS unbound : 0
% 0.53/0.51 % BW rewrite match attempts : 770
% 0.53/0.51 % BW rewrite match successes : 385
% 0.53/0.51 % Condensation attempts : 0
% 0.53/0.51 % Condensation successes : 0
% 0.53/0.51 % Termbank termtop insertions : 59014
% 0.53/0.51 % Search garbage collected termcells : 2
% 0.53/0.51
% 0.53/0.51 % -------------------------------------------------
% 0.53/0.51 % User time : 0.058 s
% 0.53/0.51 % System time : 0.008 s
% 0.53/0.51 % Total time : 0.066 s
% 0.53/0.51 % Maximum resident set size: 3636 pages
% 0.53/0.51
% 0.53/0.51 % -------------------------------------------------
% 0.53/0.51 % User time : 0.273 s
% 0.53/0.51 % System time : 0.031 s
% 0.53/0.51 % Total time : 0.304 s
% 0.53/0.51 % Maximum resident set size: 4864 pages
% 0.53/0.51 % E exiting
%------------------------------------------------------------------------------