%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP707-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:44:59 PM UTC 2026
% Result : Unsatisfiable 1.52s 0.90s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of clauses : 89 ( 89 unt; 0 nHn; 4 RR)
% Number of literals : 89 ( 88 equ; 3 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 146 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c09,axiom,
mult(mult(X1,X1),X2) = mult(X2,mult(X1,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(c08,axiom,
mult(X1,mult(X1,mult(X1,X1))) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),a) != mult(a,mult(b,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_10,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_11,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
c07 ).
cnf(c_0_12,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_10]) ).
cnf(c_0_13,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_14,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_15,plain,
mult(rd(X1,X2),mult(X2,X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
mult(mult(X1,X1),X2) = mult(X2,mult(X1,X1)),
c09 ).
cnf(c_0_17,axiom,
mult(X1,mult(X1,mult(X1,X1))) = unit,
c08 ).
cnf(c_0_18,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_19,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_20,plain,
ld(rd(X1,X2),mult(X1,X2)) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_22,plain,
mult(mult(X1,X1),rd(X2,mult(X1,X1))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_23,plain,
ld(X1,unit) = mult(X1,mult(X1,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_24,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
ld(rd(unit,X1),X1) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
rd(X1,mult(X2,X2)) = ld(mult(X2,X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_27,plain,
ld(X1,ld(X1,unit)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_28,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_29,plain,
ld(mult(X1,X1),mult(X2,mult(X1,X1))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_30,plain,
ld(mult(X1,X1),X1) = rd(unit,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
mult(rd(unit,X1),rd(unit,X1)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25]) ).
cnf(c_0_32,plain,
ld(mult(X1,X1),ld(X1,unit)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_33,plain,
rd(mult(X1,mult(X2,X2)),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_34,plain,
ld(mult(X1,X1),rd(unit,X1)) = rd(unit,rd(unit,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
ld(X1,mult(mult(X2,X2),X1)) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_36,plain,
rd(ld(X1,unit),X1) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_37,plain,
mult(ld(mult(X1,X1),X2),X1) = rd(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_13]),c_0_26]) ).
cnf(c_0_38,plain,
mult(mult(X1,X1),rd(unit,rd(unit,X1))) = rd(unit,X1),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_39,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_40,plain,
ld(ld(mult(X1,X1),X2),X2) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_41,plain,
mult(ld(X1,unit),ld(X1,unit)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_27]) ).
cnf(c_0_42,plain,
mult(mult(X1,X1),mult(X1,X1)) = mult(ld(X1,unit),X1),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_43,plain,
ld(ld(mult(X1,X1),X2),rd(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_37]) ).
cnf(c_0_44,plain,
ld(mult(X1,X1),unit) = mult(X1,X1),
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_38,c_0_39]),c_0_26]),c_0_24]),c_0_17]),c_0_10]),c_0_26]) ).
cnf(c_0_45,plain,
ld(ld(mult(X1,X1),unit),mult(X1,X1)) = mult(mult(X1,X1),mult(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_40]),c_0_41]) ).
cnf(c_0_46,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_47,plain,
mult(mult(X1,X1),mult(X1,X1)) = mult(X1,rd(unit,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_31]),c_0_28]) ).
cnf(c_0_48,plain,
rd(unit,rd(unit,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_34]) ).
cnf(c_0_49,plain,
mult(mult(X1,X1),mult(X1,X1)) = unit,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_44]),c_0_46]) ).
cnf(c_0_50,plain,
mult(ld(X1,unit),X1) = mult(X1,rd(unit,X1)),
inference(spm,[status(thm)],[c_0_42,c_0_47]) ).
cnf(c_0_51,plain,
mult(X1,rd(unit,X1)) = unit,
inference(spm,[status(thm)],[c_0_13,c_0_48]) ).
cnf(c_0_52,plain,
mult(mult(X1,X1),mult(X2,mult(X1,X1))) = mult(X2,mult(mult(X1,X1),mult(X1,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_53,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_21]),c_0_21]) ).
cnf(c_0_54,plain,
ld(mult(X1,X1),X2) = mult(X2,mult(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_12]),c_0_49]),c_0_10]) ).
cnf(c_0_55,plain,
rd(unit,X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_28,c_0_48]) ).
cnf(c_0_56,plain,
mult(ld(X1,unit),X1) = unit,
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
mult(X1,mult(X1,mult(X2,mult(X1,X1)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_49]),c_0_10]),c_0_53]) ).
cnf(c_0_58,plain,
mult(X1,mult(X2,mult(X2,X2))) = rd(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_54]),c_0_39]) ).
cnf(c_0_59,plain,
mult(ld(X1,unit),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_55]),c_0_21]) ).
cnf(c_0_60,plain,
rd(mult(mult(X1,X1),X2),X1) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_61,plain,
mult(X1,mult(X1,mult(X1,mult(X1,X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_56]),c_0_21]),c_0_44]),c_0_53]) ).
cnf(c_0_62,plain,
mult(X1,mult(X2,mult(X1,X1))) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_57]) ).
cnf(c_0_63,plain,
rd(mult(X1,mult(X2,X2)),X1) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_64,plain,
rd(X1,ld(X2,unit)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_41]),c_0_59]) ).
cnf(c_0_65,plain,
mult(X1,mult(X1,X2)) = mult(X2,mult(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_39]),c_0_26]),c_0_14]) ).
cnf(c_0_66,plain,
mult(X1,mult(X1,mult(X1,X2))) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_61]) ).
cnf(c_0_67,plain,
ld(mult(X1,mult(X1,X1)),X2) = mult(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_58]),c_0_63]),c_0_39]),c_0_62]),c_0_19]) ).
cnf(c_0_68,plain,
mult(X1,ld(X2,unit)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_58,c_0_23]) ).
cnf(c_0_69,plain,
ld(mult(X1,X2),X1) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_28,c_0_64]) ).
cnf(c_0_70,plain,
ld(mult(X1,X2),mult(X1,mult(X2,X2))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_71,plain,
ld(mult(X1,X1),mult(X2,X1)) = rd(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_26]) ).
cnf(c_0_72,plain,
mult(X1,mult(mult(X1,X2),mult(X1,X2))) = mult(X2,ld(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_65]),c_0_39]),c_0_66]) ).
cnf(c_0_73,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_36]),c_0_65]),c_0_19]),c_0_10]) ).
cnf(c_0_74,plain,
ld(ld(X1,X2),unit) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_69,c_0_19]) ).
cnf(c_0_75,plain,
mult(X1,mult(X1,rd(X2,X1))) = mult(X2,X1),
inference(rw,[status(thm)],[c_0_15,c_0_65]) ).
cnf(c_0_76,plain,
mult(X1,mult(ld(X1,X2),ld(X1,X2))) = mult(X2,ld(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_77,plain,
ld(mult(X1,X2),mult(X2,mult(X2,X1))) = X2,
inference(spm,[status(thm)],[c_0_70,c_0_65]) ).
cnf(c_0_78,plain,
mult(X1,mult(X1,mult(X2,X1))) = rd(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_54]),c_0_65]) ).
cnf(c_0_79,plain,
mult(X1,ld(mult(X2,X1),X1)) = ld(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_12]),c_0_39]),c_0_57]),c_0_65]),c_0_66]) ).
cnf(c_0_80,plain,
ld(ld(X1,X2),X3) = mult(ld(X2,X1),X3),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_81,plain,
ld(X1,mult(X2,X1)) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_75]) ).
cnf(c_0_82,plain,
mult(mult(X1,mult(X1,X2)),X1) = rd(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_65]),c_0_78]) ).
cnf(c_0_83,negated_conjecture,
mult(mult(a,b),a) != mult(a,mult(b,a)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_84,plain,
mult(ld(X1,X2),X1) = mult(X1,rd(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_79]),c_0_80]),c_0_80]),c_0_81]),c_0_10]) ).
cnf(c_0_85,plain,
rd(ld(X1,X2),X1) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_82,c_0_19]) ).
cnf(c_0_86,negated_conjecture,
mult(mult(a,b),a) != mult(a,mult(b,a)),
c_0_83 ).
cnf(c_0_87,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_84]),c_0_75]),c_0_85]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP707-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.48 % Computer : n002.cluster.edu
% 0.19/0.48 % Model : x86_64 x86_64
% 0.19/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.48 % Memory : 8046.5625MB
% 0.19/0.48 % OS : Linux 6.8.0-71-generic
% 0.19/0.48 % CPULimit : 300
% 0.19/0.48 % WCLimit : 300
% 0.19/0.48 % DateTime : Sun Sep 20 20:37:20 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.57 Running first-order theorem proving
% 0.23/0.57 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
% 1.52/0.90 % Version: 3.5.1
% 1.52/0.90 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.52/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.52/0.90 % Starting new_bool_3 with 300s (1) cores
% 1.52/0.90 % Starting new_bool_1 with 300s (1) cores
% 1.52/0.90 % Starting sh5l with 300s (1) cores
% 1.52/0.90 % sh5l with pid 1671884 completed with status 0
% 1.52/0.90 % Result found by sh5l
% 1.52/0.90 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.52/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.52/0.90 % Starting new_bool_3 with 300s (1) cores
% 1.52/0.90 % Starting new_bool_1 with 300s (1) cores
% 1.52/0.90 % Starting sh5l with 300s (1) cores
% 1.52/0.90 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.52/0.90 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.52/0.90 % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.52/0.90 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 1.52/0.90 % Starting SubtermCWHack with 28s (1) cores
% 1.52/0.90 % SubtermCWHack with pid 1671890 completed with status 0
% 1.52/0.90 % Result found by SubtermCWHack
% 1.52/0.90 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.52/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/0.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.52/0.90 % Starting new_bool_3 with 300s (1) cores
% 1.52/0.90 % Starting new_bool_1 with 300s (1) cores
% 1.52/0.90 % Starting sh5l with 300s (1) cores
% 1.52/0.90 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.52/0.90 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.52/0.90 % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.52/0.90 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 1.52/0.90 % Starting SubtermCWHack with 28s (1) cores
% 1.52/0.90 % Preprocessing time : 0.002 s
% 1.52/0.90
% 1.52/0.90 % Proof found!
% 1.52/0.90 % SZS status Unsatisfiable
% 1.52/0.90 % SZS output start CNFRefutation
% See solution above
% 1.52/0.90 % Parsed axioms : 10
% 1.52/0.90 % Removed by relevancy pruning/SinE : 0
% 1.52/0.90 % Initial clauses : 10
% 1.52/0.90 % Removed in clause preprocessing : 0
% 1.52/0.90 % Initial clauses in saturation : 10
% 1.52/0.90 % Processed clauses : 864
% 1.52/0.90 % ...of these trivial : 316
% 1.52/0.90 % ...subsumed : 312
% 1.52/0.90 % ...remaining for further processing : 236
% 1.52/0.90 % Other redundant clauses eliminated : 0
% 1.52/0.90 % Clauses deleted for lack of memory : 0
% 1.52/0.90 % Backward-subsumed : 0
% 1.52/0.90 % Backward-rewritten : 116
% 1.52/0.90 % Generated clauses : 15078
% 1.52/0.90 % ...of the previous two non-redundant : 9394
% 1.52/0.90 % ...aggressively subsumed : 0
% 1.52/0.90 % Contextual simplify-reflections : 0
% 1.52/0.90 % Paramodulations : 15078
% 1.52/0.90 % Factorizations : 0
% 1.52/0.90 % NegExts : 0
% 1.52/0.90 % Equation resolutions : 0
% 1.52/0.90 % Disequality decompositions : 0
% 1.52/0.90 % Total rewrite steps : 37889
% 1.52/0.90 % ...of those cached : 34132
% 1.52/0.90 % Propositional unsat checks : 0
% 1.52/0.90 % Propositional check models : 0
% 1.52/0.90 % Propositional check unsatisfiable : 0
% 1.52/0.90 % Propositional clauses : 0
% 1.52/0.90 % Propositional clauses after purity: 0
% 1.52/0.90 % Propositional unsat core size : 0
% 1.52/0.90 % Propositional preprocessing time : 0.000
% 1.52/0.90 % Propositional encoding time : 0.000
% 1.52/0.90 % Propositional solver time : 0.000
% 1.52/0.90 % Success case prop preproc time : 0.000
% 1.52/0.90 % Success case prop encoding time : 0.000
% 1.52/0.90 % Success case prop solver time : 0.000
% 1.52/0.90 % Current number of processed clauses : 120
% 1.52/0.90 % Positive orientable unit clauses : 115
% 1.52/0.90 % Positive unorientable unit clauses: 5
% 1.52/0.90 % Negative unit clauses : 0
% 1.52/0.90 % Non-unit-clauses : 0
% 1.52/0.90 % Current number of unprocessed clauses: 7614
% 1.52/0.90 % ...number of literals in the above : 7614
% 1.52/0.90 % Current number of archived formulas : 0
% 1.52/0.90 % Current number of archived clauses : 116
% 1.52/0.90 % Clause-clause subsumption calls (NU) : 0
% 1.52/0.90 % Rec. Clause-clause subsumption calls : 0
% 1.52/0.90 % Non-unit clause-clause subsumptions : 0
% 1.52/0.90 % Unit Clause-clause subsumption calls : 35
% 1.52/0.90 % Rewrite failures with RHS unbound : 0
% 1.52/0.90 % BW rewrite match attempts : 634
% 1.52/0.90 % BW rewrite match successes : 116
% 1.52/0.90 % Condensation attempts : 0
% 1.52/0.90 % Condensation successes : 0
% 1.52/0.90 % Termbank termtop insertions : 170467
% 1.52/0.90 % Search garbage collected termcells : 2
% 1.52/0.90
% 1.52/0.90 % -------------------------------------------------
% 1.52/0.90 % User time : 0.244 s
% 1.52/0.90 % System time : 0.012 s
% 1.52/0.90 % Total time : 0.256 s
% 1.52/0.90 % Maximum resident set size: 3888 pages
% 1.52/0.90
% 1.52/0.90 % -------------------------------------------------
% 1.52/0.90 % User time : 0.246 s
% 1.52/0.90 % System time : 0.019 s
% 1.52/0.90 % Total time : 0.264 s
% 1.52/0.90 % Maximum resident set size: 4864 pages
% 1.52/0.90 % E exiting
%------------------------------------------------------------------------------