TSTP Solution File: ROB022-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ROB022-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 19:16:06 EDT 2023
% Result : Unsatisfiable 7.65s 1.52s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 5
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 30 RR)
% Number of literals : 61 ( 60 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(robbins_axiom,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
file('/export/starexec/sandbox2/tmp/tmp.KmVaVjZ9qJ/E---3.1_20836.p',robbins_axiom) ).
cnf(condition,hypothesis,
add(c,negate(c)) = c,
file('/export/starexec/sandbox2/tmp/tmp.KmVaVjZ9qJ/E---3.1_20836.p',condition) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.KmVaVjZ9qJ/E---3.1_20836.p',commutativity_of_add) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.KmVaVjZ9qJ/E---3.1_20836.p',associativity_of_add) ).
cnf(prove_huntingtons_axiom,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('/export/starexec/sandbox2/tmp/tmp.KmVaVjZ9qJ/E---3.1_20836.p',prove_huntingtons_axiom) ).
cnf(c_0_5,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_6,hypothesis,
add(c,negate(c)) = c,
condition ).
cnf(c_0_7,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_8,hypothesis,
negate(add(negate(c),negate(add(c,c)))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_9,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_10,hypothesis,
negate(add(c,negate(add(c,c)))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_8]),c_0_7]),c_0_9]),c_0_6]),c_0_7]) ).
cnf(c_0_11,hypothesis,
negate(add(negate(c),negate(add(c,add(c,c))))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_10]),c_0_7]) ).
cnf(c_0_12,plain,
add(X1,add(X2,X3)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,plain,
negate(add(X1,negate(add(negate(add(X1,X2)),negate(negate(add(X1,negate(X2)))))))) = negate(add(X1,X2)),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_14,plain,
negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_15,hypothesis,
negate(add(c,negate(add(c,add(c,c))))) = negate(c),
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_5,c_0_11]),c_0_12]),c_0_7]),c_0_6]),c_0_9]),c_0_7]) ).
cnf(c_0_16,hypothesis,
negate(add(c,c)) = negate(c),
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_13,c_0_8]),c_0_7]),c_0_9]),c_0_6]),c_0_7]),c_0_8]),c_0_7]),c_0_9]),c_0_6]),c_0_7]),c_0_6]) ).
cnf(c_0_17,hypothesis,
negate(add(c,add(c,c))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_7]),c_0_11]),c_0_7]),c_0_6]) ).
cnf(c_0_18,hypothesis,
negate(add(negate(c),negate(c))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_16]),c_0_6]) ).
cnf(c_0_19,hypothesis,
add(c,c) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_9]),c_0_6]),c_0_16]),c_0_18]) ).
cnf(c_0_20,hypothesis,
add(c,add(negate(c),X1)) = add(c,X1),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_21,hypothesis,
negate(add(negate(c),negate(add(c,negate(negate(c)))))) = c,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_22,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_9]) ).
cnf(c_0_23,hypothesis,
add(c,add(c,X1)) = add(c,X1),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_24,hypothesis,
add(c,add(X1,negate(c))) = add(c,X1),
inference(spm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_25,hypothesis,
negate(add(c,negate(add(c,negate(negate(c)))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_21]),c_0_22]),c_0_20]),c_0_7]) ).
cnf(c_0_26,plain,
negate(add(negate(add(X1,X2)),negate(add(X1,add(negate(add(X2,X3)),negate(add(X2,negate(X3)))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_5]),c_0_7]) ).
cnf(c_0_27,hypothesis,
negate(add(negate(add(c,X1)),negate(add(c,X1)))) = add(c,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_9]),c_0_24]) ).
cnf(c_0_28,hypothesis,
negate(add(c,negate(negate(c)))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_7]),c_0_21]),c_0_7]),c_0_6]) ).
cnf(c_0_29,hypothesis,
negate(add(negate(c),negate(add(c,add(negate(add(negate(c),X1)),negate(add(negate(c),negate(X1)))))))) = c,
inference(spm,[status(thm)],[c_0_26,c_0_6]) ).
cnf(c_0_30,hypothesis,
add(c,negate(negate(c))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]) ).
cnf(c_0_31,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_32,hypothesis,
negate(add(negate(c),negate(add(c,negate(add(negate(c),add(negate(c),negate(c)))))))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_30]),c_0_7]),c_0_6]),c_0_24]) ).
cnf(c_0_33,hypothesis,
negate(add(negate(c),negate(add(negate(c),negate(negate(c)))))) = negate(negate(c)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_28]),c_0_7]) ).
cnf(c_0_34,hypothesis,
add(c,add(negate(negate(c)),X1)) = add(c,X1),
inference(spm,[status(thm)],[c_0_9,c_0_30]) ).
cnf(c_0_35,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X1),X2)))) = X2,
inference(spm,[status(thm)],[c_0_31,c_0_7]) ).
cnf(c_0_36,hypothesis,
negate(add(c,negate(add(c,negate(add(negate(c),add(negate(c),negate(c)))))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_32]),c_0_9]),c_0_24]),c_0_7]) ).
cnf(c_0_37,hypothesis,
negate(add(negate(c),negate(add(c,negate(add(negate(c),add(negate(c),negate(negate(c))))))))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_33]),c_0_7]),c_0_34]) ).
cnf(c_0_38,hypothesis,
negate(add(negate(add(c,X1)),negate(add(X1,add(negate(c),negate(c)))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_8]),c_0_16]),c_0_7]) ).
cnf(c_0_39,hypothesis,
negate(add(c,negate(add(negate(c),add(negate(c),negate(c)))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32]),c_0_7]),c_0_6]) ).
cnf(c_0_40,hypothesis,
negate(add(c,negate(add(c,negate(add(negate(c),add(negate(c),negate(negate(c))))))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_37]),c_0_9]),c_0_24]),c_0_7]) ).
cnf(c_0_41,hypothesis,
negate(add(negate(c),negate(add(negate(c),add(negate(c),negate(c)))))) = negate(c),
inference(spm,[status(thm)],[c_0_38,c_0_6]) ).
cnf(c_0_42,hypothesis,
add(c,negate(add(negate(c),add(negate(c),negate(c))))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_39]),c_0_18]) ).
cnf(c_0_43,hypothesis,
negate(add(c,negate(add(negate(c),add(negate(c),negate(negate(c))))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_40]),c_0_37]),c_0_7]),c_0_6]) ).
cnf(c_0_44,hypothesis,
negate(add(negate(c),add(negate(c),negate(c)))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_41]),c_0_7]),c_0_42]),c_0_18]) ).
cnf(c_0_45,hypothesis,
add(c,negate(add(negate(c),add(negate(c),negate(negate(c)))))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_43]),c_0_18]) ).
cnf(c_0_46,plain,
negate(add(negate(add(X1,add(X2,X3))),negate(add(X1,add(X2,negate(X3)))))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_9]) ).
cnf(c_0_47,hypothesis,
add(negate(c),negate(c)) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_44]),c_0_9]),c_0_45]) ).
cnf(c_0_48,hypothesis,
add(X1,negate(c)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_7]),c_0_6]),c_0_5]) ).
cnf(c_0_49,hypothesis,
add(negate(c),X1) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_48]) ).
cnf(c_0_50,hypothesis,
negate(add(X1,negate(X1))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_49]),c_0_49]),c_0_5]),c_0_7]) ).
cnf(c_0_51,hypothesis,
negate(negate(add(X1,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_50]),c_0_48]) ).
cnf(c_0_52,hypothesis,
negate(add(X1,negate(add(X1,X1)))) = negate(c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_7]) ).
cnf(c_0_53,hypothesis,
negate(negate(add(X1,negate(negate(X1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_50]),c_0_49]) ).
cnf(c_0_54,hypothesis,
negate(negate(add(X1,add(X1,X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_52]),c_0_48]) ).
cnf(c_0_55,hypothesis,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_9]),c_0_54]) ).
cnf(c_0_56,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
prove_huntingtons_axiom ).
cnf(c_0_57,hypothesis,
negate(negate(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_55]),c_0_50]),c_0_48]) ).
cnf(c_0_58,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
inference(rw,[status(thm)],[c_0_56,c_0_7]) ).
cnf(c_0_59,hypothesis,
add(negate(add(X1,X2)),negate(add(X2,negate(X1)))) = negate(X2),
inference(spm,[status(thm)],[c_0_57,c_0_14]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : ROB022-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 01:00:07 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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/tmp/tmp.KmVaVjZ9qJ/E---3.1_20836.p
% 7.65/1.52 # Version: 3.1pre001
% 7.65/1.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 7.65/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.65/1.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.65/1.52 # Starting new_bool_3 with 300s (1) cores
% 7.65/1.52 # Starting new_bool_1 with 300s (1) cores
% 7.65/1.52 # Starting sh5l with 300s (1) cores
% 7.65/1.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20914 completed with status 0
% 7.65/1.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 7.65/1.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 7.65/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.65/1.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.65/1.52 # No SInE strategy applied
% 7.65/1.52 # Search class: FUUPS-FFSF21-MFFFFFNN
% 7.65/1.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 7.65/1.52 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 7.65/1.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.65/1.52 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.65/1.52 # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.65/1.52 # Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.65/1.52 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 20922 completed with status 0
% 7.65/1.52 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 7.65/1.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 7.65/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.65/1.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.65/1.52 # No SInE strategy applied
% 7.65/1.52 # Search class: FUUPS-FFSF21-MFFFFFNN
% 7.65/1.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 7.65/1.52 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 7.65/1.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.65/1.52 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.65/1.52 # Preprocessing time : 0.001 s
% 7.65/1.52 # Presaturation interreduction done
% 7.65/1.52
% 7.65/1.52 # Proof found!
% 7.65/1.52 # SZS status Unsatisfiable
% 7.65/1.52 # SZS output start CNFRefutation
% See solution above
% 7.65/1.52 # Parsed axioms : 5
% 7.65/1.52 # Removed by relevancy pruning/SinE : 0
% 7.65/1.52 # Initial clauses : 5
% 7.65/1.52 # Removed in clause preprocessing : 0
% 7.65/1.52 # Initial clauses in saturation : 5
% 7.65/1.52 # Processed clauses : 1623
% 7.65/1.52 # ...of these trivial : 983
% 7.65/1.52 # ...subsumed : 386
% 7.65/1.52 # ...remaining for further processing : 254
% 7.65/1.52 # Other redundant clauses eliminated : 0
% 7.65/1.52 # Clauses deleted for lack of memory : 0
% 7.65/1.52 # Backward-subsumed : 0
% 7.65/1.52 # Backward-rewritten : 134
% 7.65/1.52 # Generated clauses : 56331
% 7.65/1.52 # ...of the previous two non-redundant : 43593
% 7.65/1.52 # ...aggressively subsumed : 0
% 7.65/1.52 # Contextual simplify-reflections : 0
% 7.65/1.52 # Paramodulations : 56331
% 7.65/1.52 # Factorizations : 0
% 7.65/1.52 # NegExts : 0
% 7.65/1.52 # Equation resolutions : 0
% 7.65/1.52 # Total rewrite steps : 153808
% 7.65/1.52 # Propositional unsat checks : 0
% 7.65/1.52 # Propositional check models : 0
% 7.65/1.52 # Propositional check unsatisfiable : 0
% 7.65/1.52 # Propositional clauses : 0
% 7.65/1.52 # Propositional clauses after purity: 0
% 7.65/1.52 # Propositional unsat core size : 0
% 7.65/1.52 # Propositional preprocessing time : 0.000
% 7.65/1.52 # Propositional encoding time : 0.000
% 7.65/1.52 # Propositional solver time : 0.000
% 7.65/1.52 # Success case prop preproc time : 0.000
% 7.65/1.52 # Success case prop encoding time : 0.000
% 7.65/1.52 # Success case prop solver time : 0.000
% 7.65/1.52 # Current number of processed clauses : 115
% 7.65/1.52 # Positive orientable unit clauses : 111
% 7.65/1.52 # Positive unorientable unit clauses: 4
% 7.65/1.52 # Negative unit clauses : 0
% 7.65/1.52 # Non-unit-clauses : 0
% 7.65/1.52 # Current number of unprocessed clauses: 41222
% 7.65/1.52 # ...number of literals in the above : 41222
% 7.65/1.52 # Current number of archived formulas : 0
% 7.65/1.52 # Current number of archived clauses : 139
% 7.65/1.52 # Clause-clause subsumption calls (NU) : 0
% 7.65/1.52 # Rec. Clause-clause subsumption calls : 0
% 7.65/1.52 # Non-unit clause-clause subsumptions : 0
% 7.65/1.52 # Unit Clause-clause subsumption calls : 12
% 7.65/1.52 # Rewrite failures with RHS unbound : 0
% 7.65/1.52 # BW rewrite match attempts : 7900
% 7.65/1.52 # BW rewrite match successes : 154
% 7.65/1.52 # Condensation attempts : 0
% 7.65/1.52 # Condensation successes : 0
% 7.65/1.52 # Termbank termtop insertions : 1764487
% 7.65/1.52
% 7.65/1.52 # -------------------------------------------------
% 7.65/1.52 # User time : 0.891 s
% 7.65/1.52 # System time : 0.033 s
% 7.65/1.52 # Total time : 0.925 s
% 7.65/1.52 # Maximum resident set size: 1512 pages
% 7.65/1.52
% 7.65/1.52 # -------------------------------------------------
% 7.65/1.52 # User time : 4.565 s
% 7.65/1.52 # System time : 0.196 s
% 7.65/1.52 # Total time : 4.761 s
% 7.65/1.52 # Maximum resident set size: 1672 pages
% 7.65/1.52 % E---3.1 exiting
% 7.65/1.52 % E---3.1 exiting
%------------------------------------------------------------------------------