TSTP Solution File: BOO015-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : BOO015-2 : TPTP v8.1.2. Bugfixed v1.0.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:18:31 EDT 2023
% Result : Unsatisfiable 0.16s 0.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of clauses : 83 ( 83 unt; 0 nHn; 34 RR)
% Number of literals : 83 ( 82 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 81 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity2,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',distributivity2) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',multiplicative_id1) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',additive_id1) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',commutativity_of_multiply) ).
cnf(multiplicative_id2,axiom,
multiply(multiplicative_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',multiplicative_id2) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',commutativity_of_add) ).
cnf(distributivity4,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',distributivity4) ).
cnf(a_inverse_plus_b_inverse_is_d,hypothesis,
add(inverse(a),inverse(b)) = d,
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',a_inverse_plus_b_inverse_is_d) ).
cnf(additive_id2,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',additive_id2) ).
cnf(multiplicative_inverse1,axiom,
multiply(X1,inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',multiplicative_inverse1) ).
cnf(a_times_b_is_c,hypothesis,
multiply(a,b) = c,
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',a_times_b_is_c) ).
cnf(prove_c_inverse_is_d,negated_conjecture,
inverse(c) != d,
file('/export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p',prove_c_inverse_is_d) ).
cnf(c_0_13,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity2 ).
cnf(c_0_14,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_15,axiom,
multiply(X1,multiplicative_identity) = X1,
multiplicative_id1 ).
cnf(c_0_16,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_17,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_18,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,axiom,
multiply(multiplicative_identity,X1) = X1,
multiplicative_id2 ).
cnf(c_0_20,plain,
multiply(X1,add(X1,X2)) = add(X1,multiply(X2,additive_identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_17]) ).
cnf(c_0_21,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_22,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity4 ).
cnf(c_0_23,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_14]) ).
cnf(c_0_24,plain,
multiply(X1,add(X2,X1)) = add(X1,multiply(X2,additive_identity)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
add(inverse(a),inverse(b)) = d,
a_inverse_plus_b_inverse_is_d ).
cnf(c_0_26,axiom,
add(additive_identity,X1) = X1,
additive_id2 ).
cnf(c_0_27,plain,
add(X1,multiply(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_23]),c_0_15]),c_0_21]) ).
cnf(c_0_28,hypothesis,
add(inverse(b),multiply(additive_identity,inverse(a))) = multiply(d,inverse(b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17]),c_0_17]) ).
cnf(c_0_29,plain,
multiply(additive_identity,X1) = additive_identity,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,hypothesis,
add(inverse(a),multiply(additive_identity,inverse(b))) = multiply(d,inverse(a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_17]),c_0_17]) ).
cnf(c_0_31,hypothesis,
multiply(d,inverse(b)) = inverse(b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_16]) ).
cnf(c_0_32,hypothesis,
multiply(d,inverse(a)) = inverse(a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_29]),c_0_16]) ).
cnf(c_0_33,plain,
multiply(X1,additive_identity) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_26]) ).
cnf(c_0_34,plain,
add(X1,multiply(inverse(X1),X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_19]) ).
cnf(c_0_35,axiom,
multiply(X1,inverse(X1)) = additive_identity,
multiplicative_inverse1 ).
cnf(c_0_36,hypothesis,
add(b,d) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_31]),c_0_14]) ).
cnf(c_0_37,hypothesis,
add(a,d) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_14]) ).
cnf(c_0_38,plain,
multiply(X1,add(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_33]),c_0_16]) ).
cnf(c_0_39,plain,
add(X1,inverse(inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_16]) ).
cnf(c_0_40,plain,
multiply(X1,add(X2,inverse(X1))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_35]),c_0_16]) ).
cnf(c_0_41,hypothesis,
multiply(a,b) = c,
a_times_b_is_c ).
cnf(c_0_42,hypothesis,
add(b,multiply(d,X1)) = add(b,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_36]),c_0_19]) ).
cnf(c_0_43,hypothesis,
add(a,multiply(d,X1)) = add(a,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_37]),c_0_19]) ).
cnf(c_0_44,plain,
multiply(X1,add(inverse(X1),X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_35]),c_0_26]) ).
cnf(c_0_45,plain,
add(X1,multiply(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_46,plain,
multiply(X1,inverse(inverse(X1))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_17]) ).
cnf(c_0_47,hypothesis,
multiply(b,inverse(a)) = multiply(b,d),
inference(spm,[status(thm)],[c_0_40,c_0_25]) ).
cnf(c_0_48,hypothesis,
multiply(a,add(b,X1)) = add(c,multiply(a,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_41]) ).
cnf(c_0_49,hypothesis,
add(b,inverse(d)) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_35]),c_0_16]) ).
cnf(c_0_50,hypothesis,
add(a,inverse(d)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_35]),c_0_16]) ).
cnf(c_0_51,plain,
multiply(X1,multiply(X2,inverse(X1))) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_35]) ).
cnf(c_0_52,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_14]),c_0_15]),c_0_46]) ).
cnf(c_0_53,plain,
multiply(X1,add(add(X2,X1),X3)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_38]),c_0_27]) ).
cnf(c_0_54,hypothesis,
add(a,c) = a,
inference(spm,[status(thm)],[c_0_27,c_0_41]) ).
cnf(c_0_55,hypothesis,
add(inverse(a),multiply(b,d)) = inverse(a),
inference(spm,[status(thm)],[c_0_45,c_0_47]) ).
cnf(c_0_56,hypothesis,
add(c,multiply(a,inverse(d))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_41]) ).
cnf(c_0_57,hypothesis,
multiply(a,inverse(d)) = inverse(d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_50]),c_0_17]) ).
cnf(c_0_58,plain,
multiply(inverse(X1),multiply(X2,X1)) = additive_identity,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,hypothesis,
multiply(c,add(a,X1)) = c,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
add(inverse(X1),multiply(X2,X1)) = add(inverse(X1),X2),
inference(spm,[status(thm)],[c_0_18,c_0_52]) ).
cnf(c_0_61,hypothesis,
multiply(a,multiply(b,d)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_55]),c_0_35]) ).
cnf(c_0_62,plain,
multiply(X1,multiply(inverse(X1),X2)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_27]),c_0_35]) ).
cnf(c_0_63,hypothesis,
add(c,inverse(d)) = c,
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,hypothesis,
multiply(c,inverse(add(a,X1))) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_17]) ).
cnf(c_0_65,hypothesis,
add(a,inverse(multiply(b,d))) = inverse(multiply(b,d)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_16]),c_0_21]) ).
cnf(c_0_66,plain,
multiply(inverse(X1),multiply(X1,X2)) = additive_identity,
inference(spm,[status(thm)],[c_0_62,c_0_52]) ).
cnf(c_0_67,hypothesis,
multiply(c,inverse(d)) = inverse(d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_63]),c_0_17]) ).
cnf(c_0_68,hypothesis,
add(b,c) = b,
inference(spm,[status(thm)],[c_0_45,c_0_41]) ).
cnf(c_0_69,plain,
multiply(X1,multiply(X1,X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_27]),c_0_17]) ).
cnf(c_0_70,plain,
add(inverse(X1),multiply(X1,X2)) = add(inverse(X1),X2),
inference(spm,[status(thm)],[c_0_34,c_0_52]) ).
cnf(c_0_71,hypothesis,
multiply(c,multiply(b,d)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_52]) ).
cnf(c_0_72,hypothesis,
multiply(inverse(c),inverse(d)) = additive_identity,
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_73,hypothesis,
multiply(b,c) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_68]),c_0_17]) ).
cnf(c_0_74,plain,
multiply(X1,add(X2,multiply(X1,X3))) = multiply(X1,add(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_69]),c_0_22]) ).
cnf(c_0_75,hypothesis,
add(inverse(c),multiply(b,d)) = inverse(c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_16]) ).
cnf(c_0_76,hypothesis,
add(d,inverse(c)) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_72]),c_0_16]) ).
cnf(c_0_77,hypothesis,
multiply(c,inverse(b)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_73]),c_0_17]) ).
cnf(c_0_78,hypothesis,
multiply(b,inverse(c)) = multiply(b,d),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_21]),c_0_76]) ).
cnf(c_0_79,hypothesis,
add(d,inverse(b)) = d,
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_80,hypothesis,
add(inverse(b),inverse(c)) = inverse(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_77]),c_0_16]),c_0_21]) ).
cnf(c_0_81,negated_conjecture,
inverse(c) != d,
prove_c_inverse_is_d ).
cnf(c_0_82,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_78]),c_0_70]),c_0_21]),c_0_79]),c_0_80]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : BOO015-2 : TPTP v8.1.2. Bugfixed v1.0.1.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 20:35:34 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ZSF6211dba/E---3.1_23063.p
% 0.16/0.48 # Version: 3.1pre001
% 0.16/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 # Starting sh5l with 300s (1) cores
% 0.16/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23140 completed with status 0
% 0.16/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 # No SInE strategy applied
% 0.16/0.48 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.48 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.48 # Starting sh5l with 136s (1) cores
% 0.16/0.48 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 23144 completed with status 0
% 0.16/0.48 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.48 # No SInE strategy applied
% 0.16/0.48 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.48 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.48 # Preprocessing time : 0.001 s
% 0.16/0.48 # Presaturation interreduction done
% 0.16/0.48
% 0.16/0.48 # Proof found!
% 0.16/0.48 # SZS status Unsatisfiable
% 0.16/0.48 # SZS output start CNFRefutation
% See solution above
% 0.16/0.48 # Parsed axioms : 17
% 0.16/0.48 # Removed by relevancy pruning/SinE : 0
% 0.16/0.48 # Initial clauses : 17
% 0.16/0.48 # Removed in clause preprocessing : 0
% 0.16/0.48 # Initial clauses in saturation : 17
% 0.16/0.48 # Processed clauses : 738
% 0.16/0.48 # ...of these trivial : 411
% 0.16/0.48 # ...subsumed : 69
% 0.16/0.48 # ...remaining for further processing : 258
% 0.16/0.48 # Other redundant clauses eliminated : 0
% 0.16/0.48 # Clauses deleted for lack of memory : 0
% 0.16/0.48 # Backward-subsumed : 0
% 0.16/0.48 # Backward-rewritten : 24
% 0.16/0.48 # Generated clauses : 10170
% 0.16/0.48 # ...of the previous two non-redundant : 4548
% 0.16/0.48 # ...aggressively subsumed : 0
% 0.16/0.48 # Contextual simplify-reflections : 0
% 0.16/0.48 # Paramodulations : 10170
% 0.16/0.48 # Factorizations : 0
% 0.16/0.48 # NegExts : 0
% 0.16/0.48 # Equation resolutions : 0
% 0.16/0.48 # Total rewrite steps : 11262
% 0.16/0.48 # Propositional unsat checks : 0
% 0.16/0.48 # Propositional check models : 0
% 0.16/0.48 # Propositional check unsatisfiable : 0
% 0.16/0.48 # Propositional clauses : 0
% 0.16/0.48 # Propositional clauses after purity: 0
% 0.16/0.48 # Propositional unsat core size : 0
% 0.16/0.48 # Propositional preprocessing time : 0.000
% 0.16/0.48 # Propositional encoding time : 0.000
% 0.16/0.48 # Propositional solver time : 0.000
% 0.16/0.48 # Success case prop preproc time : 0.000
% 0.16/0.48 # Success case prop encoding time : 0.000
% 0.16/0.48 # Success case prop solver time : 0.000
% 0.16/0.48 # Current number of processed clauses : 219
% 0.16/0.48 # Positive orientable unit clauses : 216
% 0.16/0.48 # Positive unorientable unit clauses: 2
% 0.16/0.48 # Negative unit clauses : 1
% 0.16/0.48 # Non-unit-clauses : 0
% 0.16/0.48 # Current number of unprocessed clauses: 3822
% 0.16/0.48 # ...number of literals in the above : 3822
% 0.16/0.48 # Current number of archived formulas : 0
% 0.16/0.48 # Current number of archived clauses : 39
% 0.16/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.48 # Non-unit clause-clause subsumptions : 0
% 0.16/0.48 # Unit Clause-clause subsumption calls : 1
% 0.16/0.48 # Rewrite failures with RHS unbound : 0
% 0.16/0.48 # BW rewrite match attempts : 233
% 0.16/0.48 # BW rewrite match successes : 56
% 0.16/0.48 # Condensation attempts : 0
% 0.16/0.48 # Condensation successes : 0
% 0.16/0.48 # Termbank termtop insertions : 74867
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.039 s
% 0.16/0.48 # System time : 0.003 s
% 0.16/0.48 # Total time : 0.042 s
% 0.16/0.48 # Maximum resident set size: 1524 pages
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.205 s
% 0.16/0.48 # System time : 0.007 s
% 0.16/0.48 # Total time : 0.212 s
% 0.16/0.48 # Maximum resident set size: 1680 pages
% 0.16/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------