TSTP Solution File: GRP183-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP183-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:39:11 EDT 2023
% Result : Unsatisfiable 8.71s 1.61s
% Output : CNFRefutation 8.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of clauses : 71 ( 71 unt; 0 nHn; 4 RR)
% Number of literals : 71 ( 70 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 124 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',left_identity) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',monotony_lub2) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',symmetry_of_lub) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',symmetry_of_glb) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',monotony_glb1) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',associativity_of_glb) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',idempotence_of_gld) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',glb_absorbtion) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',lub_absorbtion) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',associativity_of_lub) ).
cnf(prove_p20,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != identity,
file('/export/starexec/sandbox/tmp/tmp.ZxJ7B6yJ2u/E---3.1_21912.p',prove_p20) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_18]) ).
cnf(c_0_21,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_22,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_23,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_24,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_25,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_26,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_27,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_28,plain,
least_upper_bound(X1,multiply(X2,X1)) = multiply(least_upper_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_23]) ).
cnf(c_0_29,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_30,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_31,axiom,
greatest_lower_bound(X1,X1) = X1,
idempotence_of_gld ).
cnf(c_0_32,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_25]) ).
cnf(c_0_33,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_27]) ).
cnf(c_0_34,plain,
multiply(least_upper_bound(identity,inverse(X1)),X1) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_23]) ).
cnf(c_0_35,plain,
greatest_lower_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_25]) ).
cnf(c_0_36,plain,
greatest_lower_bound(X1,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_38,plain,
multiply(greatest_lower_bound(identity,inverse(X1)),X1) = greatest_lower_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_15]),c_0_25]) ).
cnf(c_0_39,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_33]),c_0_20]) ).
cnf(c_0_40,plain,
multiply(least_upper_bound(identity,X1),inverse(X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_23]) ).
cnf(c_0_41,plain,
greatest_lower_bound(identity,multiply(inverse(greatest_lower_bound(X1,X2)),X1)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_15]) ).
cnf(c_0_42,plain,
greatest_lower_bound(identity,multiply(X1,inverse(X2))) = multiply(greatest_lower_bound(X2,X1),inverse(X2)),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_43,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
cnf(c_0_44,plain,
multiply(greatest_lower_bound(identity,X1),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_20]),c_0_25]) ).
cnf(c_0_45,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X3,greatest_lower_bound(X1,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_46,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_47,plain,
multiply(inverse(least_upper_bound(identity,inverse(X1))),least_upper_bound(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_20]) ).
cnf(c_0_48,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_49,plain,
multiply(inverse(X1),greatest_lower_bound(X2,multiply(X1,X3))) = greatest_lower_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_50,plain,
greatest_lower_bound(identity,multiply(X1,inverse(greatest_lower_bound(X1,X2)))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_27]) ).
cnf(c_0_51,plain,
multiply(greatest_lower_bound(X1,greatest_lower_bound(identity,X2)),inverse(greatest_lower_bound(X2,X1))) = greatest_lower_bound(identity,inverse(greatest_lower_bound(X2,X1))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
greatest_lower_bound(X1,inverse(least_upper_bound(identity,inverse(X1)))) = inverse(least_upper_bound(identity,inverse(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_48]),c_0_27]),c_0_25]) ).
cnf(c_0_53,plain,
multiply(greatest_lower_bound(inverse(X1),X2),X1) = greatest_lower_bound(identity,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_54,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_55,plain,
greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X1,X2))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_27]),c_0_27]) ).
cnf(c_0_56,plain,
greatest_lower_bound(identity,multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1)))) = identity,
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_20]),c_0_53]),c_0_20]),c_0_48]) ).
cnf(c_0_57,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_54,c_0_25]) ).
cnf(c_0_58,plain,
greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X2,X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_55,c_0_25]) ).
cnf(c_0_59,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_21]) ).
cnf(c_0_60,plain,
greatest_lower_bound(inverse(greatest_lower_bound(identity,X1)),least_upper_bound(identity,inverse(X1))) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_56]),c_0_27]),c_0_27]) ).
cnf(c_0_61,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_62,plain,
least_upper_bound(inverse(X1),inverse(greatest_lower_bound(X2,X1))) = inverse(greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_23]) ).
cnf(c_0_63,plain,
least_upper_bound(identity,inverse(greatest_lower_bound(identity,X1))) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_59]),c_0_23]) ).
cnf(c_0_64,plain,
least_upper_bound(identity,multiply(X1,inverse(X2))) = multiply(least_upper_bound(X1,X2),inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_23]) ).
cnf(c_0_65,plain,
least_upper_bound(identity,inverse(X1)) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_60]),c_0_61]),c_0_62]),c_0_63]) ).
cnf(c_0_66,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != identity,
prove_p20 ).
cnf(c_0_67,plain,
multiply(inverse(greatest_lower_bound(identity,X1)),X1) = least_upper_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_20]),c_0_16]),c_0_20]) ).
cnf(c_0_68,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))) != identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_23]),c_0_25]) ).
cnf(c_0_69,plain,
greatest_lower_bound(least_upper_bound(identity,X1),inverse(greatest_lower_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_67]),c_0_15]),c_0_25]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP183-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n013.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Oct 3 02:57:14 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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.ZxJ7B6yJ2u/E---3.1_21912.p
% 8.71/1.61 # Version: 3.1pre001
% 8.71/1.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.71/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.71/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.71/1.61 # Starting new_bool_3 with 300s (1) cores
% 8.71/1.61 # Starting new_bool_1 with 300s (1) cores
% 8.71/1.61 # Starting sh5l with 300s (1) cores
% 8.71/1.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21994 completed with status 0
% 8.71/1.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.71/1.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.71/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.71/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.71/1.61 # No SInE strategy applied
% 8.71/1.61 # Search class: FUUPM-FFSF21-MFFFFFNN
% 8.71/1.61 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.71/1.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 8.71/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.71/1.61 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 8.71/1.61 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 8.71/1.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 8.71/1.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22000 completed with status 0
% 8.71/1.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.71/1.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.71/1.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.71/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.71/1.61 # No SInE strategy applied
% 8.71/1.61 # Search class: FUUPM-FFSF21-MFFFFFNN
% 8.71/1.61 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.71/1.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 8.71/1.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.71/1.61 # Preprocessing time : 0.001 s
% 8.71/1.61 # Presaturation interreduction done
% 8.71/1.61
% 8.71/1.61 # Proof found!
% 8.71/1.61 # SZS status Unsatisfiable
% 8.71/1.61 # SZS output start CNFRefutation
% See solution above
% 8.71/1.61 # Parsed axioms : 16
% 8.71/1.61 # Removed by relevancy pruning/SinE : 0
% 8.71/1.61 # Initial clauses : 16
% 8.71/1.61 # Removed in clause preprocessing : 0
% 8.71/1.61 # Initial clauses in saturation : 16
% 8.71/1.61 # Processed clauses : 3601
% 8.71/1.61 # ...of these trivial : 1645
% 8.71/1.61 # ...subsumed : 1438
% 8.71/1.61 # ...remaining for further processing : 518
% 8.71/1.61 # Other redundant clauses eliminated : 0
% 8.71/1.61 # Clauses deleted for lack of memory : 0
% 8.71/1.61 # Backward-subsumed : 0
% 8.71/1.61 # Backward-rewritten : 118
% 8.71/1.61 # Generated clauses : 98389
% 8.71/1.61 # ...of the previous two non-redundant : 57524
% 8.71/1.61 # ...aggressively subsumed : 0
% 8.71/1.61 # Contextual simplify-reflections : 0
% 8.71/1.61 # Paramodulations : 98389
% 8.71/1.61 # Factorizations : 0
% 8.71/1.61 # NegExts : 0
% 8.71/1.61 # Equation resolutions : 0
% 8.71/1.61 # Total rewrite steps : 144017
% 8.71/1.61 # Propositional unsat checks : 0
% 8.71/1.61 # Propositional check models : 0
% 8.71/1.61 # Propositional check unsatisfiable : 0
% 8.71/1.61 # Propositional clauses : 0
% 8.71/1.61 # Propositional clauses after purity: 0
% 8.71/1.61 # Propositional unsat core size : 0
% 8.71/1.61 # Propositional preprocessing time : 0.000
% 8.71/1.61 # Propositional encoding time : 0.000
% 8.71/1.61 # Propositional solver time : 0.000
% 8.71/1.61 # Success case prop preproc time : 0.000
% 8.71/1.61 # Success case prop encoding time : 0.000
% 8.71/1.61 # Success case prop solver time : 0.000
% 8.71/1.61 # Current number of processed clauses : 384
% 8.71/1.61 # Positive orientable unit clauses : 351
% 8.71/1.61 # Positive unorientable unit clauses: 33
% 8.71/1.61 # Negative unit clauses : 0
% 8.71/1.61 # Non-unit-clauses : 0
% 8.71/1.61 # Current number of unprocessed clauses: 53835
% 8.71/1.61 # ...number of literals in the above : 53835
% 8.71/1.61 # Current number of archived formulas : 0
% 8.71/1.61 # Current number of archived clauses : 134
% 8.71/1.61 # Clause-clause subsumption calls (NU) : 0
% 8.71/1.61 # Rec. Clause-clause subsumption calls : 0
% 8.71/1.61 # Non-unit clause-clause subsumptions : 0
% 8.71/1.61 # Unit Clause-clause subsumption calls : 171
% 8.71/1.61 # Rewrite failures with RHS unbound : 0
% 8.71/1.61 # BW rewrite match attempts : 2046
% 8.71/1.61 # BW rewrite match successes : 344
% 8.71/1.61 # Condensation attempts : 0
% 8.71/1.61 # Condensation successes : 0
% 8.71/1.61 # Termbank termtop insertions : 1174993
% 8.71/1.61
% 8.71/1.61 # -------------------------------------------------
% 8.71/1.61 # User time : 0.909 s
% 8.71/1.61 # System time : 0.032 s
% 8.71/1.61 # Total time : 0.941 s
% 8.71/1.61 # Maximum resident set size: 1520 pages
% 8.71/1.61
% 8.71/1.61 # -------------------------------------------------
% 8.71/1.61 # User time : 5.227 s
% 8.71/1.61 # System time : 0.234 s
% 8.71/1.61 # Total time : 5.461 s
% 8.71/1.61 # Maximum resident set size: 1676 pages
% 8.71/1.61 % E---3.1 exiting
% 8.71/1.61 % E---3.1 exiting
%------------------------------------------------------------------------------