%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP660-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:40:39 PM UTC 2026
% Result : Unsatisfiable 3.68s 1.01s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 6
% Syntax : Number of clauses : 73 ( 73 unt; 0 nHn; 4 RR)
% Number of literals : 73 ( 72 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 144 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(f05,axiom,
mult(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,mult(X3,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(goal,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_0_6,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_7,axiom,
mult(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,mult(X3,X1))),
f05 ).
cnf(c_0_8,plain,
rd(mult(X1,mult(X2,mult(X3,X1))),X1) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_10,plain,
rd(mult(X1,mult(X2,X3)),X1) = mult(mult(X1,X2),rd(X3,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_12,plain,
mult(mult(mult(X1,X2),X1),rd(X2,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_14,plain,
mult(X1,mult(X2,mult(ld(mult(X1,X2),X3),X1))) = mult(X3,X1),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_15,plain,
mult(mult(X1,rd(X1,X2)),rd(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_16,plain,
mult(X1,mult(ld(mult(X2,X1),X3),X2)) = ld(X2,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
rd(X1,rd(X2,X1)) = mult(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_18,plain,
ld(X1,ld(X2,mult(X3,X2))) = mult(ld(mult(X2,X1),X3),X2),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_19,plain,
mult(X1,rd(X1,mult(X2,X1))) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_6]) ).
cnf(c_0_20,plain,
mult(X1,mult(ld(X1,X2),mult(X3,X1))) = mult(mult(X2,X3),X1),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_21,plain,
ld(mult(X1,rd(X1,X2)),X1) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_22,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_23,plain,
mult(ld(mult(X1,X2),rd(X3,X1)),X1) = ld(X2,ld(X1,X3)),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_24,plain,
ld(X1,rd(X1,X2)) = rd(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_25,plain,
ld(X1,mult(mult(X2,X3),X1)) = mult(ld(X1,X2),mult(X3,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_26,plain,
rd(ld(X1,X2),X2) = ld(mult(X2,X1),X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
mult(rd(mult(X1,X2),mult(X1,mult(X1,X2))),X1) = ld(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_13]) ).
cnf(c_0_28,plain,
mult(ld(X1,X2),mult(ld(X2,X3),X1)) = ld(X1,mult(X3,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_29,plain,
mult(ld(mult(X1,X2),X1),X1) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_26]) ).
cnf(c_0_30,plain,
mult(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_13]),c_0_6]) ).
cnf(c_0_31,plain,
ld(ld(X1,X2),X1) = mult(ld(X2,X1),X1),
inference(spm,[status(thm)],[c_0_29,c_0_11]) ).
cnf(c_0_32,plain,
mult(mult(ld(X1,X1),X1),ld(X1,X1)) = mult(ld(X1,X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_30]),c_0_31]),c_0_11]),c_0_31]) ).
cnf(c_0_33,plain,
ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_34,plain,
mult(ld(X1,X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_32]),c_0_13]),c_0_33]),c_0_11]) ).
cnf(c_0_35,plain,
rd(mult(X1,X2),mult(X2,mult(X1,X2))) = ld(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_24,c_0_6]) ).
cnf(c_0_36,plain,
mult(mult(X1,ld(X2,X2)),X2) = mult(X2,mult(ld(X2,X1),X2)),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_37,plain,
ld(X1,ld(X1,X1)) = rd(X1,mult(X1,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_38,plain,
ld(mult(mult(X1,X2),X1),mult(X1,X2)) = rd(X2,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_39,plain,
mult(X1,mult(rd(X1,mult(X1,X1)),X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_34]),c_0_34]),c_0_33]),c_0_37]) ).
cnf(c_0_40,plain,
rd(X1,mult(X1,X1)) = ld(mult(X1,X1),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_6]) ).
cnf(c_0_41,plain,
mult(mult(X1,rd(X2,X3)),rd(X3,X1)) = rd(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_42,plain,
mult(ld(mult(X1,X1),X1),mult(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_40]) ).
cnf(c_0_43,plain,
mult(mult(X1,rd(X2,mult(X3,X1))),X3) = rd(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_41,c_0_6]) ).
cnf(c_0_44,plain,
mult(ld(X1,X1),mult(X1,X1)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_42]),c_0_22]),c_0_29]),c_0_22]) ).
cnf(c_0_45,plain,
mult(mult(X1,rd(X2,X3)),X3) = mult(X3,mult(ld(X3,X1),X2)),
inference(spm,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_46,plain,
rd(rd(mult(X1,X2),X1),X3) = mult(X1,rd(X2,mult(X3,X1))),
inference(spm,[status(thm)],[c_0_6,c_0_43]) ).
cnf(c_0_47,plain,
mult(mult(X1,X1),X1) = mult(X1,mult(X1,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_44]) ).
cnf(c_0_48,plain,
ld(mult(X1,rd(X2,X3)),mult(X3,mult(ld(X3,X1),X2))) = X3,
inference(spm,[status(thm)],[c_0_13,c_0_45]) ).
cnf(c_0_49,plain,
mult(mult(X1,X1),rd(X1,mult(X2,mult(X1,X1)))) = rd(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_6]) ).
cnf(c_0_50,plain,
ld(mult(mult(X1,X2),X3),mult(X1,mult(X2,mult(X3,X1)))) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_51,plain,
mult(ld(X1,X2),mult(mult(ld(X2,X1),X3),X1)) = mult(rd(X3,X2),mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_48]),c_0_25]) ).
cnf(c_0_52,plain,
ld(X1,ld(X1,X1)) = ld(mult(X1,X1),X1),
inference(rw,[status(thm)],[c_0_37,c_0_40]) ).
cnf(c_0_53,plain,
mult(rd(X1,mult(X2,X1)),rd(X1,X2)) = ld(X2,rd(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_9]),c_0_24]) ).
cnf(c_0_54,plain,
rd(X1,X1) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_6,c_0_34]) ).
cnf(c_0_55,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_56,plain,
ld(mult(X1,X1),rd(X1,X2)) = rd(X1,mult(X2,mult(X1,X1))),
inference(spm,[status(thm)],[c_0_13,c_0_49]) ).
cnf(c_0_57,plain,
ld(mult(X1,X1),mult(X1,mult(X1,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_44]),c_0_11]) ).
cnf(c_0_58,plain,
mult(X1,mult(mult(ld(mult(X1,X1),X1),X2),ld(X1,X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_31]),c_0_34]),c_0_11]),c_0_9]) ).
cnf(c_0_59,plain,
mult(mult(X1,mult(ld(X1,X2),X3)),X2) = mult(X2,mult(rd(X3,X1),mult(X1,X2))),
inference(spm,[status(thm)],[c_0_7,c_0_45]) ).
cnf(c_0_60,plain,
mult(ld(mult(X1,X1),X1),ld(X1,X1)) = ld(mult(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_53,c_0_40]),c_0_54]),c_0_54]),c_0_37]),c_0_40]) ).
cnf(c_0_61,plain,
ld(ld(mult(X1,X2),X1),ld(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_55,c_0_26]) ).
cnf(c_0_62,plain,
mult(rd(X1,mult(X1,mult(X1,X1))),X1) = ld(mult(X1,X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_56]),c_0_37]),c_0_40]) ).
cnf(c_0_63,plain,
mult(ld(mult(mult(X1,X1),X2),X1),mult(X1,X1)) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_18,c_0_57]) ).
cnf(c_0_64,plain,
mult(X1,mult(ld(X1,X1),X2)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_9]),c_0_61]) ).
cnf(c_0_65,plain,
ld(ld(X1,X2),ld(X1,X3)) = mult(ld(X2,rd(X3,X1)),X1),
inference(spm,[status(thm)],[c_0_23,c_0_11]) ).
cnf(c_0_66,plain,
rd(X1,mult(X1,mult(X1,X1))) = ld(mult(X1,mult(X1,X1)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_62]),c_0_26]) ).
cnf(c_0_67,plain,
mult(ld(mult(X1,mult(X1,X1)),X1),mult(X1,X1)) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_63,c_0_47]) ).
cnf(c_0_68,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_69,plain,
mult(ld(X1,X1),X2) = X2,
inference(rw,[status(thm)],[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_58,c_0_64]),c_0_58]),c_0_65]),c_0_24]),c_0_47]),c_0_66]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
c_0_68 ).
cnf(c_0_71,plain,
mult(X1,ld(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_58,c_0_69]),c_0_69]),c_0_65]),c_0_54]),c_0_37]),c_0_40]),c_0_29]),c_0_69]),c_0_65]),c_0_54]),c_0_37]),c_0_40]),c_0_29]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP660-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n006.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 20:29:44 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 3.68/1.01 % Version: 3.5.1
% 3.68/1.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.68/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.68/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.68/1.01 % Starting new_bool_3 with 300s (1) cores
% 3.68/1.01 % Starting new_bool_1 with 300s (1) cores
% 3.68/1.01 % Starting sh5l with 300s (1) cores
% 3.68/1.01 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1213116 completed with status 0
% 3.68/1.01 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.68/1.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.68/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.68/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.68/1.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.68/1.01 % No SInE strategy applied
% 3.68/1.01 % Search class: FUUPM-FFSF21-MFFFFFNN
% 3.68/1.01 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 3.68/1.01 % Starting SubtermCWHack with 136s (1) cores
% 3.68/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.68/1.01 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 3.68/1.01 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 3.68/1.01 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 3.68/1.01 % G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 1213125 completed with status 0
% 3.68/1.01 % Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 3.68/1.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.68/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.68/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.68/1.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.68/1.01 % No SInE strategy applied
% 3.68/1.01 % Search class: FUUPM-FFSF21-MFFFFFNN
% 3.68/1.01 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 3.68/1.01 % Starting SubtermCWHack with 136s (1) cores
% 3.68/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.68/1.01 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 3.68/1.01 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 3.68/1.01 % Preprocessing time : 0.001 s
% 3.68/1.01
% 3.68/1.01 % Proof found!
% 3.68/1.01 % SZS status Unsatisfiable
% 3.68/1.01 % SZS output start CNFRefutation
% See solution above
% 3.68/1.01 % Parsed axioms : 6
% 3.68/1.01 % Removed by relevancy pruning/SinE : 0
% 3.68/1.01 % Initial clauses : 6
% 3.68/1.01 % Removed in clause preprocessing : 0
% 3.68/1.01 % Initial clauses in saturation : 6
% 3.68/1.01 % Processed clauses : 786
% 3.68/1.01 % ...of these trivial : 463
% 3.68/1.01 % ...subsumed : 18
% 3.68/1.01 % ...remaining for further processing : 305
% 3.68/1.01 % Other redundant clauses eliminated : 0
% 3.68/1.01 % Clauses deleted for lack of memory : 0
% 3.68/1.01 % Backward-subsumed : 0
% 3.68/1.01 % Backward-rewritten : 70
% 3.68/1.01 % Generated clauses : 30107
% 3.68/1.01 % ...of the previous two non-redundant : 25606
% 3.68/1.01 % ...aggressively subsumed : 0
% 3.68/1.01 % Contextual simplify-reflections : 0
% 3.68/1.01 % Paramodulations : 30107
% 3.68/1.01 % Factorizations : 0
% 3.68/1.01 % NegExts : 0
% 3.68/1.01 % Equation resolutions : 0
% 3.68/1.01 % Disequality decompositions : 0
% 3.68/1.01 % Total rewrite steps : 43169
% 3.68/1.01 % ...of those cached : 40171
% 3.68/1.01 % Propositional unsat checks : 0
% 3.68/1.01 % Propositional check models : 0
% 3.68/1.01 % Propositional check unsatisfiable : 0
% 3.68/1.01 % Propositional clauses : 0
% 3.68/1.01 % Propositional clauses after purity: 0
% 3.68/1.01 % Propositional unsat core size : 0
% 3.68/1.01 % Propositional preprocessing time : 0.000
% 3.68/1.01 % Propositional encoding time : 0.000
% 3.68/1.01 % Propositional solver time : 0.000
% 3.68/1.01 % Success case prop preproc time : 0.000
% 3.68/1.01 % Success case prop encoding time : 0.000
% 3.68/1.01 % Success case prop solver time : 0.000
% 3.68/1.01 % Current number of processed clauses : 235
% 3.68/1.01 % Positive orientable unit clauses : 232
% 3.68/1.01 % Positive unorientable unit clauses: 2
% 3.68/1.01 % Negative unit clauses : 1
% 3.68/1.01 % Non-unit-clauses : 0
% 3.68/1.01 % Current number of unprocessed clauses: 24728
% 3.68/1.01 % ...number of literals in the above : 24728
% 3.68/1.01 % Current number of archived formulas : 0
% 3.68/1.01 % Current number of archived clauses : 70
% 3.68/1.01 % Clause-clause subsumption calls (NU) : 0
% 3.68/1.01 % Rec. Clause-clause subsumption calls : 0
% 3.68/1.01 % Non-unit clause-clause subsumptions : 0
% 3.68/1.01 % Unit Clause-clause subsumption calls : 12
% 3.68/1.01 % Rewrite failures with RHS unbound : 0
% 3.68/1.01 % BW rewrite match attempts : 549
% 3.68/1.01 % BW rewrite match successes : 61
% 3.68/1.01 % Condensation attempts : 786
% 3.68/1.01 % Condensation successes : 0
% 3.68/1.01 % Termbank termtop insertions : 482578
% 3.68/1.01 % Search garbage collected termcells : 2
% 3.68/1.01
% 3.68/1.01 % -------------------------------------------------
% 3.68/1.01 % User time : 0.470 s
% 3.68/1.01 % System time : 0.026 s
% 3.68/1.01 % Total time : 0.496 s
% 3.68/1.01 % Maximum resident set size: 3376 pages
% 3.68/1.01
% 3.68/1.01 % -------------------------------------------------
% 3.68/1.01 % User time : 2.621 s
% 3.68/1.01 % System time : 0.100 s
% 3.68/1.01 % Total time : 2.721 s
% 3.68/1.01 % Maximum resident set size: 4608 pages
% 3.68/1.01 % E exiting
%------------------------------------------------------------------------------