TSTP Solution File: GRP660-11 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP660-11 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:42:38 EDT 2023
% Result : Unsatisfiable 1.22s 0.56s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of clauses : 73 ( 73 unt; 0 nHn; 3 RR)
% Number of literals : 73 ( 72 equ; 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 151 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.pHeewsWACX/E---3.1_31774.p',f04) ).
cnf(f05,axiom,
mult(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,mult(X3,X1))),
file('/export/starexec/sandbox/tmp/tmp.pHeewsWACX/E---3.1_31774.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.pHeewsWACX/E---3.1_31774.p',f03) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.pHeewsWACX/E---3.1_31774.p',f01) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.pHeewsWACX/E---3.1_31774.p',f02) ).
cnf(goal,negated_conjecture,
mult(x0,rd(x1,x1)) != x0,
file('/export/starexec/sandbox/tmp/tmp.pHeewsWACX/E---3.1_31774.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,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_11,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_12,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_13,plain,
mult(X1,mult(ld(X1,X2),mult(X3,X1))) = mult(mult(X2,X3),X1),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_14,plain,
mult(mult(mult(X1,X2),X1),rd(X2,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_15,plain,
mult(ld(X1,X2),mult(X3,X1)) = ld(X1,mult(mult(X2,X3),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
ld(mult(mult(X1,X2),X1),mult(X1,X2)) = rd(X2,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_17,plain,
ld(X1,mult(mult(X2,rd(X3,X1)),X1)) = mult(ld(X1,X2),X3),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_18,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_19,plain,
ld(mult(X1,X2),X1) = rd(ld(X2,X1),X1),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_20,plain,
mult(ld(X1,rd(X2,rd(X3,X1))),X3) = ld(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_21,plain,
rd(X1,rd(ld(X2,X1),X1)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_23,plain,
rd(ld(X1,mult(X2,X1)),X3) = ld(X1,rd(X2,rd(X3,X1))),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_24,plain,
mult(X1,rd(X1,X2)) = rd(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
rd(mult(X1,X2),ld(X2,rd(X1,X1))) = mult(mult(X1,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_23]),c_0_6]) ).
cnf(c_0_26,plain,
ld(X1,rd(X1,rd(X2,X1))) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_27,plain,
rd(X1,ld(ld(X2,X1),rd(X2,X2))) = mult(X1,ld(X2,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_10]) ).
cnf(c_0_28,plain,
ld(X1,rd(X1,X2)) = rd(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_26,c_0_6]) ).
cnf(c_0_29,plain,
mult(rd(X1,X1),rd(X1,mult(X1,X1))) = rd(X1,mult(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_28]),c_0_28]) ).
cnf(c_0_30,plain,
mult(mult(X1,rd(X2,X3)),rd(X3,X1)) = rd(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_31,plain,
mult(ld(mult(X1,X1),rd(X1,X1)),X1) = rd(ld(X1,X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_29]),c_0_9]),c_0_19]) ).
cnf(c_0_32,plain,
rd(rd(mult(X1,X2),X1),rd(X3,X1)) = mult(X1,rd(X2,X3)),
inference(spm,[status(thm)],[c_0_6,c_0_30]) ).
cnf(c_0_33,plain,
mult(X1,mult(X2,mult(ld(mult(X1,X2),X3),X1))) = mult(X3,X1),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_34,plain,
ld(mult(X1,X1),rd(X1,X1)) = rd(rd(ld(X1,X1),X1),X1),
inference(spm,[status(thm)],[c_0_6,c_0_31]) ).
cnf(c_0_35,plain,
mult(X1,rd(ld(X1,X2),X3)) = rd(rd(X2,X1),rd(X3,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_10]) ).
cnf(c_0_36,plain,
mult(mult(X1,X2),rd(ld(X2,X3),X1)) = rd(mult(X1,X3),X1),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_37,plain,
mult(X1,rd(rd(X1,X1),rd(X1,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_9]),c_0_35]),c_0_9]) ).
cnf(c_0_38,plain,
rd(ld(ld(X1,X2),X1),X1) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_39,plain,
mult(X1,rd(X2,mult(X3,X1))) = rd(rd(mult(X1,X2),X1),X3),
inference(spm,[status(thm)],[c_0_32,c_0_6]) ).
cnf(c_0_40,plain,
mult(X1,rd(ld(X2,X3),rd(X1,X2))) = rd(mult(rd(X1,X2),X3),rd(X1,X2)),
inference(spm,[status(thm)],[c_0_36,c_0_9]) ).
cnf(c_0_41,plain,
rd(X1,rd(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_37]),c_0_22]),c_0_37]) ).
cnf(c_0_42,plain,
ld(ld(X1,X2),X1) = mult(ld(X2,X1),X1),
inference(spm,[status(thm)],[c_0_9,c_0_38]) ).
cnf(c_0_43,plain,
ld(X1,rd(rd(mult(X1,X2),X1),X3)) = rd(X2,mult(X3,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_39]) ).
cnf(c_0_44,plain,
rd(mult(rd(X1,X1),X2),rd(X1,X1)) = rd(rd(X2,X1),rd(rd(X1,X1),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_45,plain,
mult(X1,rd(rd(X1,X1),X1)) = rd(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_37]),c_0_24]),c_0_41]) ).
cnf(c_0_46,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_42,c_0_22]),c_0_28]) ).
cnf(c_0_47,plain,
rd(ld(X1,X2),mult(X3,X1)) = ld(X1,rd(rd(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_43,c_0_10]) ).
cnf(c_0_48,plain,
mult(mult(rd(X1,X1),rd(X2,X1)),X1) = rd(rd(X2,X1),rd(rd(X1,X1),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_41]),c_0_44]) ).
cnf(c_0_49,plain,
ld(X1,rd(rd(X2,X1),rd(X3,X1))) = rd(ld(X1,X2),X3),
inference(spm,[status(thm)],[c_0_12,c_0_35]) ).
cnf(c_0_50,plain,
rd(X1,mult(X1,X1)) = rd(rd(X1,X1),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_45]),c_0_28]) ).
cnf(c_0_51,plain,
mult(rd(X1,X1),rd(X1,X1)) = rd(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_45]),c_0_24]),c_0_41]) ).
cnf(c_0_52,plain,
ld(X1,X1) = rd(X1,X1),
inference(spm,[status(thm)],[c_0_22,c_0_41]) ).
cnf(c_0_53,plain,
mult(rd(X1,mult(X1,X1)),rd(X1,X1)) = rd(X1,mult(X1,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_46]) ).
cnf(c_0_54,plain,
ld(ld(X1,rd(rd(X2,X1),X3)),ld(X1,X2)) = mult(X3,X1),
inference(spm,[status(thm)],[c_0_22,c_0_47]) ).
cnf(c_0_55,plain,
ld(mult(X1,X2),rd(mult(X1,X3),X1)) = rd(ld(X2,X3),X1),
inference(spm,[status(thm)],[c_0_12,c_0_36]) ).
cnf(c_0_56,plain,
rd(ld(X1,X2),rd(X1,X1)) = mult(rd(rd(X1,X1),X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_48]),c_0_49]),c_0_28]),c_0_50]) ).
cnf(c_0_57,plain,
rd(rd(X1,X1),rd(X1,X1)) = rd(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_51]),c_0_52]) ).
cnf(c_0_58,plain,
mult(X1,rd(rd(X1,mult(X2,X1)),X3)) = rd(rd(rd(X1,X2),X1),rd(X3,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_59,plain,
mult(rd(rd(X1,X1),X1),rd(X1,X1)) = rd(rd(X1,X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_50]),c_0_50]) ).
cnf(c_0_60,plain,
rd(rd(X1,X1),rd(rd(X1,X1),X1)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_45]) ).
cnf(c_0_61,plain,
ld(ld(X1,X2),ld(X1,X3)) = mult(ld(X2,rd(X3,X1)),X1),
inference(spm,[status(thm)],[c_0_54,c_0_18]) ).
cnf(c_0_62,plain,
rd(ld(X1,ld(X2,X3)),X2) = ld(mult(X2,X1),rd(X3,X2)),
inference(spm,[status(thm)],[c_0_55,c_0_10]) ).
cnf(c_0_63,plain,
rd(ld(rd(X1,X1),X2),rd(X1,X1)) = mult(rd(X1,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_57]) ).
cnf(c_0_64,plain,
mult(rd(X1,X1),rd(X1,X2)) = rd(X1,rd(X2,rd(X1,X1))),
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_60]),c_0_41]) ).
cnf(c_0_65,plain,
mult(X1,rd(rd(X1,X1),X2)) = rd(rd(X1,X1),rd(X2,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_52]) ).
cnf(c_0_66,plain,
ld(rd(X1,X1),ld(X1,X2)) = mult(ld(X1,rd(X2,X1)),X1),
inference(spm,[status(thm)],[c_0_61,c_0_52]) ).
cnf(c_0_67,plain,
ld(rd(X1,X1),rd(X2,rd(X1,X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_10]),c_0_64]),c_0_41]) ).
cnf(c_0_68,plain,
rd(rd(X1,X1),rd(ld(X2,rd(X1,X1)),X1)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_65,c_0_18]) ).
cnf(c_0_69,plain,
ld(rd(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_57]),c_0_67]),c_0_9]) ).
cnf(c_0_70,negated_conjecture,
mult(x0,rd(x1,x1)) != x0,
goal ).
cnf(c_0_71,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_60]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP660-11 : TPTP v8.1.2. Released v8.1.0.
% 0.08/0.09 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n010.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 2400
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Tue Oct 3 02:31:05 EDT 2023
% 0.08/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.pHeewsWACX/E---3.1_31774.p
% 1.22/0.56 # Version: 3.1pre001
% 1.22/0.56 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.22/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.22/0.56 # Starting new_bool_3 with 300s (1) cores
% 1.22/0.56 # Starting new_bool_1 with 300s (1) cores
% 1.22/0.56 # Starting sh5l with 300s (1) cores
% 1.22/0.56 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31852 completed with status 0
% 1.22/0.56 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.22/0.56 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.22/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.22/0.56 # No SInE strategy applied
% 1.22/0.56 # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.22/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.22/0.56 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 1.22/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.22/0.56 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.22/0.56 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.22/0.56 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 1.22/0.56 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 31861 completed with status 0
% 1.22/0.56 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.22/0.56 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.22/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.22/0.56 # No SInE strategy applied
% 1.22/0.56 # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.22/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.22/0.56 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 1.22/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.22/0.56 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.22/0.56 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.22/0.56 # Preprocessing time : 0.001 s
% 1.22/0.56 # Presaturation interreduction done
% 1.22/0.56
% 1.22/0.56 # Proof found!
% 1.22/0.56 # SZS status Unsatisfiable
% 1.22/0.56 # SZS output start CNFRefutation
% See solution above
% 1.22/0.56 # Parsed axioms : 6
% 1.22/0.56 # Removed by relevancy pruning/SinE : 0
% 1.22/0.56 # Initial clauses : 6
% 1.22/0.56 # Removed in clause preprocessing : 0
% 1.22/0.56 # Initial clauses in saturation : 6
% 1.22/0.56 # Processed clauses : 295
% 1.22/0.56 # ...of these trivial : 108
% 1.22/0.56 # ...subsumed : 0
% 1.22/0.56 # ...remaining for further processing : 187
% 1.22/0.56 # Other redundant clauses eliminated : 0
% 1.22/0.56 # Clauses deleted for lack of memory : 0
% 1.22/0.56 # Backward-subsumed : 0
% 1.22/0.56 # Backward-rewritten : 50
% 1.22/0.56 # Generated clauses : 10038
% 1.22/0.56 # ...of the previous two non-redundant : 8417
% 1.22/0.56 # ...aggressively subsumed : 0
% 1.22/0.56 # Contextual simplify-reflections : 0
% 1.22/0.56 # Paramodulations : 10038
% 1.22/0.56 # Factorizations : 0
% 1.22/0.56 # NegExts : 0
% 1.22/0.56 # Equation resolutions : 0
% 1.22/0.56 # Total rewrite steps : 10672
% 1.22/0.56 # Propositional unsat checks : 0
% 1.22/0.56 # Propositional check models : 0
% 1.22/0.56 # Propositional check unsatisfiable : 0
% 1.22/0.56 # Propositional clauses : 0
% 1.22/0.56 # Propositional clauses after purity: 0
% 1.22/0.56 # Propositional unsat core size : 0
% 1.22/0.56 # Propositional preprocessing time : 0.000
% 1.22/0.56 # Propositional encoding time : 0.000
% 1.22/0.56 # Propositional solver time : 0.000
% 1.22/0.56 # Success case prop preproc time : 0.000
% 1.22/0.56 # Success case prop encoding time : 0.000
% 1.22/0.56 # Success case prop solver time : 0.000
% 1.22/0.56 # Current number of processed clauses : 131
% 1.22/0.56 # Positive orientable unit clauses : 130
% 1.22/0.56 # Positive unorientable unit clauses: 1
% 1.22/0.56 # Negative unit clauses : 0
% 1.22/0.56 # Non-unit-clauses : 0
% 1.22/0.56 # Current number of unprocessed clauses: 8091
% 1.22/0.56 # ...number of literals in the above : 8091
% 1.22/0.56 # Current number of archived formulas : 0
% 1.22/0.56 # Current number of archived clauses : 56
% 1.22/0.56 # Clause-clause subsumption calls (NU) : 0
% 1.22/0.56 # Rec. Clause-clause subsumption calls : 0
% 1.22/0.56 # Non-unit clause-clause subsumptions : 0
% 1.22/0.56 # Unit Clause-clause subsumption calls : 1
% 1.22/0.56 # Rewrite failures with RHS unbound : 0
% 1.22/0.56 # BW rewrite match attempts : 323
% 1.22/0.56 # BW rewrite match successes : 43
% 1.22/0.56 # Condensation attempts : 0
% 1.22/0.56 # Condensation successes : 0
% 1.22/0.56 # Termbank termtop insertions : 135677
% 1.22/0.56
% 1.22/0.56 # -------------------------------------------------
% 1.22/0.56 # User time : 0.125 s
% 1.22/0.56 # System time : 0.007 s
% 1.22/0.56 # Total time : 0.133 s
% 1.22/0.56 # Maximum resident set size: 1508 pages
% 1.22/0.56
% 1.22/0.56 # -------------------------------------------------
% 1.22/0.56 # User time : 0.701 s
% 1.22/0.56 # System time : 0.041 s
% 1.22/0.56 # Total time : 0.741 s
% 1.22/0.56 # Maximum resident set size: 1668 pages
% 1.22/0.56 % E---3.1 exiting
% 1.22/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------