TSTP Solution File: GRP705-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP705-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:43:00 EDT 2023
% Result : Unsatisfiable 3.51s 0.95s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of clauses : 74 ( 74 unt; 0 nHn; 21 RR)
% Number of literals : 74 ( 73 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 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 : 106 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p',c05) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p',c07) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p',c06) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p',c02) ).
cnf(c09,axiom,
mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b)))))))) = unit,
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p',c09) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p',c01) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p',c04) ).
cnf(c08,axiom,
mult(op_a,mult(op_a,mult(op_a,op_a))) = unit,
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p',c08) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p',c03) ).
cnf(goals,negated_conjecture,
mult(op_a,mult(op_b,a)) != mult(mult(op_a,op_b),a),
file('/export/starexec/sandbox/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.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,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_14,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_15,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_16,axiom,
mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b)))))))) = unit,
c09 ).
cnf(c_0_17,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_18,plain,
mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b))))))) = ld(op_b,unit),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
mult(mult(X1,mult(X1,X2)),X2) = mult(X1,mult(X1,mult(X2,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_17]) ).
cnf(c_0_20,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_21,plain,
mult(op_b,mult(mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b)))))),mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b)))))))) = mult(ld(op_b,unit),mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b))))))),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_22,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_23,plain,
mult(op_b,mult(ld(op_b,unit),mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b)))))))) = mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]),c_0_14]),c_0_21]) ).
cnf(c_0_24,plain,
rd(mult(X1,mult(X2,mult(X2,X3))),X3) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_25,plain,
mult(ld(op_b,unit),mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b))))))) = mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_15]) ).
cnf(c_0_26,plain,
ld(mult(X1,X2),mult(X1,mult(X2,X2))) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_27,plain,
rd(mult(X1,mult(X2,X2)),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_28,plain,
mult(ld(op_b,unit),mult(op_b,op_b)) = op_b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]) ).
cnf(c_0_29,plain,
rd(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_30,plain,
ld(mult(X1,mult(X2,mult(X2,X3))),mult(X1,mult(X2,mult(X2,mult(X3,X3))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_13]),c_0_13]) ).
cnf(c_0_31,plain,
mult(ld(op_b,unit),op_b) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
mult(mult(X1,mult(X1,mult(X2,X2))),X3) = mult(X1,mult(X1,mult(X2,mult(X2,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_17]) ).
cnf(c_0_33,axiom,
mult(op_a,mult(op_a,mult(op_a,op_a))) = unit,
c08 ).
cnf(c_0_34,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_35,plain,
ld(mult(X1,ld(op_b,unit)),X1) = op_b,
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_28]),c_0_31]),c_0_10]),c_0_31]),c_0_10]) ).
cnf(c_0_36,plain,
mult(mult(X1,mult(X2,mult(X2,X3))),X3) = mult(X1,mult(X2,mult(X2,mult(X3,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_37,plain,
mult(op_a,mult(op_a,mult(op_a,mult(op_a,X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_14]) ).
cnf(c_0_38,plain,
mult(X1,mult(ld(X1,X2),ld(X1,X2))) = mult(X2,ld(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_39,plain,
mult(X1,ld(op_b,unit)) = rd(X1,op_b),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
rd(unit,op_b) = ld(op_b,unit),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_41,plain,
mult(op_a,mult(op_a,mult(op_a,mult(mult(op_a,X1),mult(op_a,X1))))) = mult(X1,mult(op_a,X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
ld(mult(X1,mult(X2,X2)),mult(X1,mult(X2,mult(X2,X3)))) = X3,
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_43,plain,
ld(mult(X1,X1),mult(X1,mult(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_44,plain,
mult(op_b,rd(ld(op_b,unit),op_b)) = ld(op_b,unit),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_40]) ).
cnf(c_0_45,plain,
mult(X1,mult(X2,mult(X2,ld(mult(X1,mult(X2,X2)),X3)))) = X3,
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_46,plain,
mult(mult(op_a,X1),mult(op_a,X1)) = mult(op_a,mult(X1,mult(op_a,X1))),
inference(spm,[status(thm)],[c_0_37,c_0_41]) ).
cnf(c_0_47,plain,
ld(mult(op_a,mult(op_a,op_a)),X1) = mult(op_a,X1),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_48,plain,
ld(X1,rd(X1,op_b)) = ld(op_b,unit),
inference(spm,[status(thm)],[c_0_15,c_0_39]) ).
cnf(c_0_49,plain,
rd(ld(op_b,unit),op_b) = ld(mult(op_b,op_b),unit),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_20]) ).
cnf(c_0_50,plain,
mult(ld(op_b,unit),mult(op_b,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_28]),c_0_20]) ).
cnf(c_0_51,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_52,plain,
mult(mult(op_a,mult(X1,mult(op_a,X1))),X2) = mult(mult(op_a,X1),mult(mult(op_a,X1),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_46]) ).
cnf(c_0_53,plain,
mult(op_a,rd(mult(op_a,mult(op_a,op_a)),op_b)) = ld(op_b,unit),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
rd(rd(X1,op_b),op_b) = mult(X1,ld(mult(op_b,op_b),unit)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_48]),c_0_39]),c_0_49]),c_0_39]) ).
cnf(c_0_55,plain,
mult(ld(op_b,unit),X1) = ld(op_b,X1),
inference(spm,[status(thm)],[c_0_50,c_0_20]) ).
cnf(c_0_56,plain,
mult(rd(X1,X2),mult(X2,X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_51]) ).
cnf(c_0_57,plain,
ld(op_b,ld(op_b,unit)) = mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b)))))),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_58,plain,
ld(op_b,ld(op_b,X1)) = mult(ld(mult(op_b,op_b),unit),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(spm,[status(thm)],[c_0_52,c_0_53]),c_0_39]),c_0_54]),c_0_13]),c_0_37]),c_0_55]),c_0_55]) ).
cnf(c_0_59,plain,
mult(mult(X1,mult(X2,mult(X2,mult(X3,X3)))),X4) = mult(X1,mult(X2,mult(X2,mult(X3,mult(X3,X4))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_13]),c_0_13]) ).
cnf(c_0_60,plain,
mult(rd(X1,X2),mult(X2,mult(X2,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_13,c_0_56]) ).
cnf(c_0_61,plain,
rd(mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b))))),mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b))))))) = ld(op_b,unit),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_62,plain,
mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b)))))) = ld(mult(op_b,op_b),unit),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_10]) ).
cnf(c_0_63,plain,
mult(X1,mult(X1,ld(mult(X1,X1),X2))) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_64,plain,
mult(mult(X1,X2),mult(X2,X2)) = mult(X1,mult(X2,mult(X2,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_12]),c_0_13]) ).
cnf(c_0_65,plain,
mult(mult(X1,mult(rd(X2,X3),mult(X2,X3))),X4) = mult(X1,mult(rd(X2,X3),mult(mult(X2,X3),X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_56]),c_0_60]) ).
cnf(c_0_66,plain,
rd(mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b))))),ld(mult(op_b,op_b),unit)) = ld(op_b,unit),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
mult(mult(X1,mult(X1,mult(X2,mult(X2,mult(X2,X2))))),X3) = mult(X1,mult(X1,mult(X2,mult(X2,mult(X2,mult(X2,X3)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_17]),c_0_32]) ).
cnf(c_0_68,plain,
mult(X1,ld(mult(X1,X1),X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_63]) ).
cnf(c_0_69,plain,
mult(mult(X1,mult(X2,mult(X2,X2))),X3) = mult(mult(X1,X2),mult(X2,mult(X2,X3))),
inference(spm,[status(thm)],[c_0_13,c_0_64]) ).
cnf(c_0_70,plain,
mult(mult(X1,op_b),mult(op_b,mult(op_b,X2))) = mult(X1,mult(op_b,mult(op_b,mult(op_b,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(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_65,c_0_66]),c_0_67]),c_0_68]),c_0_20]),c_0_10]),c_0_50]),c_0_69]),c_0_67]),c_0_68]),c_0_20]),c_0_10]),c_0_32]),c_0_55]),c_0_15]) ).
cnf(c_0_71,negated_conjecture,
mult(op_a,mult(op_b,a)) != mult(mult(op_a,op_b),a),
goals ).
cnf(c_0_72,plain,
mult(mult(X1,op_b),X2) = mult(X1,mult(op_b,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_68]),c_0_20]),c_0_20]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP705-1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 03:15:31 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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/tmp/tmp.Lp5Adn7W9n/E---3.1_24060.p
% 3.51/0.95 # Version: 3.1pre001
% 3.51/0.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.51/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.51/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.51/0.95 # Starting new_bool_3 with 300s (1) cores
% 3.51/0.95 # Starting new_bool_1 with 300s (1) cores
% 3.51/0.95 # Starting sh5l with 300s (1) cores
% 3.51/0.95 # sh5l with pid 24141 completed with status 0
% 3.51/0.95 # Result found by sh5l
% 3.51/0.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.51/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.51/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.51/0.95 # Starting new_bool_3 with 300s (1) cores
% 3.51/0.95 # Starting new_bool_1 with 300s (1) cores
% 3.51/0.95 # Starting sh5l with 300s (1) cores
% 3.51/0.95 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.51/0.95 # Search class: FUUPM-FFSF22-DFFFFFNN
% 3.51/0.95 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.51/0.95 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 75s (1) cores
% 3.51/0.95 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 24147 completed with status 0
% 3.51/0.95 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 3.51/0.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.51/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.51/0.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.51/0.95 # Starting new_bool_3 with 300s (1) cores
% 3.51/0.95 # Starting new_bool_1 with 300s (1) cores
% 3.51/0.95 # Starting sh5l with 300s (1) cores
% 3.51/0.95 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.51/0.95 # Search class: FUUPM-FFSF22-DFFFFFNN
% 3.51/0.95 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.51/0.95 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 75s (1) cores
% 3.51/0.95 # Preprocessing time : 0.001 s
% 3.51/0.95
% 3.51/0.95 # Proof found!
% 3.51/0.95 # SZS status Unsatisfiable
% 3.51/0.95 # SZS output start CNFRefutation
% See solution above
% 3.51/0.95 # Parsed axioms : 10
% 3.51/0.95 # Removed by relevancy pruning/SinE : 0
% 3.51/0.95 # Initial clauses : 10
% 3.51/0.95 # Removed in clause preprocessing : 0
% 3.51/0.95 # Initial clauses in saturation : 10
% 3.51/0.95 # Processed clauses : 466
% 3.51/0.95 # ...of these trivial : 165
% 3.51/0.95 # ...subsumed : 0
% 3.51/0.95 # ...remaining for further processing : 301
% 3.51/0.95 # Other redundant clauses eliminated : 0
% 3.51/0.95 # Clauses deleted for lack of memory : 0
% 3.51/0.95 # Backward-subsumed : 0
% 3.51/0.95 # Backward-rewritten : 93
% 3.51/0.95 # Generated clauses : 23900
% 3.51/0.95 # ...of the previous two non-redundant : 19603
% 3.51/0.95 # ...aggressively subsumed : 0
% 3.51/0.95 # Contextual simplify-reflections : 0
% 3.51/0.95 # Paramodulations : 23900
% 3.51/0.95 # Factorizations : 0
% 3.51/0.95 # NegExts : 0
% 3.51/0.95 # Equation resolutions : 0
% 3.51/0.95 # Total rewrite steps : 60720
% 3.51/0.95 # Propositional unsat checks : 0
% 3.51/0.95 # Propositional check models : 0
% 3.51/0.95 # Propositional check unsatisfiable : 0
% 3.51/0.95 # Propositional clauses : 0
% 3.51/0.95 # Propositional clauses after purity: 0
% 3.51/0.95 # Propositional unsat core size : 0
% 3.51/0.95 # Propositional preprocessing time : 0.000
% 3.51/0.95 # Propositional encoding time : 0.000
% 3.51/0.95 # Propositional solver time : 0.000
% 3.51/0.95 # Success case prop preproc time : 0.000
% 3.51/0.95 # Success case prop encoding time : 0.000
% 3.51/0.95 # Success case prop solver time : 0.000
% 3.51/0.95 # Current number of processed clauses : 208
% 3.51/0.95 # Positive orientable unit clauses : 208
% 3.51/0.95 # Positive unorientable unit clauses: 0
% 3.51/0.95 # Negative unit clauses : 0
% 3.51/0.95 # Non-unit-clauses : 0
% 3.51/0.95 # Current number of unprocessed clauses: 19033
% 3.51/0.95 # ...number of literals in the above : 19033
% 3.51/0.95 # Current number of archived formulas : 0
% 3.51/0.95 # Current number of archived clauses : 93
% 3.51/0.95 # Clause-clause subsumption calls (NU) : 0
% 3.51/0.95 # Rec. Clause-clause subsumption calls : 0
% 3.51/0.95 # Non-unit clause-clause subsumptions : 0
% 3.51/0.95 # Unit Clause-clause subsumption calls : 0
% 3.51/0.95 # Rewrite failures with RHS unbound : 0
% 3.51/0.95 # BW rewrite match attempts : 1315
% 3.51/0.95 # BW rewrite match successes : 79
% 3.51/0.95 # Condensation attempts : 0
% 3.51/0.95 # Condensation successes : 0
% 3.51/0.95 # Termbank termtop insertions : 835840
% 3.51/0.95
% 3.51/0.95 # -------------------------------------------------
% 3.51/0.95 # User time : 0.412 s
% 3.51/0.95 # System time : 0.019 s
% 3.51/0.95 # Total time : 0.431 s
% 3.51/0.95 # Maximum resident set size: 1612 pages
% 3.51/0.95
% 3.51/0.95 # -------------------------------------------------
% 3.51/0.95 # User time : 0.412 s
% 3.51/0.95 # System time : 0.022 s
% 3.51/0.95 # Total time : 0.434 s
% 3.51/0.95 # Maximum resident set size: 1680 pages
% 3.51/0.95 % E---3.1 exiting
% 3.51/0.95 % E---3.1 exiting
%------------------------------------------------------------------------------