TSTP Solution File: GRP655+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP655+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:53:45 EDT 2024
% Result : Theorem 109.76s 14.30s
% Output : CNFRefutation 109.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of formulae : 73 ( 69 unt; 0 def)
% Number of atoms : 77 ( 76 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 2 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 158 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f05,axiom,
! [X3,X1,X2] : mult(X2,mult(X1,mult(X3,X1))) = mult(mult(mult(X2,X1),X3),X1),
file('/export/starexec/sandbox/tmp/tmp.SfZmNpVcwT/E---3.1_8119.p',f05) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox/tmp/tmp.SfZmNpVcwT/E---3.1_8119.p',f03) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.SfZmNpVcwT/E---3.1_8119.p',f02) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.SfZmNpVcwT/E---3.1_8119.p',f01) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox/tmp/tmp.SfZmNpVcwT/E---3.1_8119.p',f04) ).
fof(goals,conjecture,
! [X4,X5] :
( mult(X4,rd(X5,X5)) = X4
& mult(rd(X5,X5),X4) = X4 ),
file('/export/starexec/sandbox/tmp/tmp.SfZmNpVcwT/E---3.1_8119.p',goals) ).
fof(c_0_6,plain,
! [X14,X15,X16] : mult(X16,mult(X15,mult(X14,X15))) = mult(mult(mult(X16,X15),X14),X15),
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_7,plain,
! [X10,X11] : mult(rd(X11,X10),X10) = X11,
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_8,plain,
! [X8,X9] : ld(X9,mult(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_9,plain,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
mult(rd(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,X3),X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X6,X7] : mult(X7,ld(X7,X6)) = X6,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_14,plain,
ld(rd(X1,X2),mult(mult(X1,X3),X2)) = mult(X2,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X12,X13] : rd(mult(X13,X12),X12) = X13,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_17,plain,
ld(rd(X1,X2),mult(X3,X2)) = mult(X2,mult(ld(X1,X3),X2)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
mult(X1,mult(ld(X2,rd(X2,X1)),X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_20,plain,
rd(mult(X1,mult(X2,mult(X3,X2))),X2) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_21,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_22,plain,
mult(ld(X1,rd(X1,X2)),X2) = ld(X2,X2),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_23,plain,
rd(mult(X1,mult(X2,X3)),X2) = mult(mult(X1,X2),rd(X3,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_24,plain,
mult(X1,mult(ld(mult(X2,X1),X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_25,plain,
mult(mult(X1,ld(X2,rd(X2,X3))),X3) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_22]),c_0_15]),c_0_10]) ).
cnf(c_0_26,plain,
mult(mult(X1,X2),rd(ld(X2,X3),X2)) = rd(mult(X1,X3),X2),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_27,plain,
mult(ld(mult(X1,X2),X1),X2) = ld(X2,X2),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_28,plain,
mult(X1,ld(X2,rd(X2,X3))) = rd(X1,X3),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_29,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_30,plain,
mult(X1,rd(ld(X2,X3),X2)) = rd(mult(rd(X1,X2),X3),X2),
inference(spm,[status(thm)],[c_0_26,c_0_10]) ).
cnf(c_0_31,plain,
ld(ld(mult(X1,X2),X1),ld(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_32,plain,
rd(X1,ld(X2,X3)) = mult(X1,ld(X3,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
mult(X1,mult(X2,mult(ld(X2,X2),X2))) = mult(X1,mult(X2,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(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_11]),c_0_32]),c_0_11]),c_0_32]),c_0_11]),c_0_9]) ).
cnf(c_0_34,plain,
mult(X1,mult(ld(X1,X1),X1)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_11]) ).
cnf(c_0_35,plain,
mult(ld(X1,X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_34]),c_0_11]) ).
cnf(c_0_36,plain,
ld(X1,X1) = rd(X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_37,plain,
mult(mult(X1,rd(X2,X3)),X3) = mult(rd(X1,X3),mult(X3,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_38,plain,
mult(X1,rd(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_39,plain,
rd(X1,rd(X2,X2)) = mult(X1,rd(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_36]),c_0_36]) ).
cnf(c_0_40,plain,
mult(mult(rd(X1,mult(X2,X3)),X2),rd(X3,X2)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_41,plain,
mult(rd(X1,X1),mult(X1,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
mult(rd(X1,X2),mult(X2,X2)) = mult(mult(X1,X2),rd(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_38]),c_0_10]),c_0_39]),c_0_37]) ).
cnf(c_0_43,plain,
mult(X1,mult(ld(X2,rd(X3,X1)),X1)) = ld(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_44,plain,
rd(rd(X1,X2),rd(X3,X2)) = mult(rd(X1,mult(X2,X3)),X2),
inference(spm,[status(thm)],[c_0_18,c_0_40]) ).
cnf(c_0_45,plain,
mult(mult(X1,ld(X2,X3)),ld(X3,X2)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_46,plain,
ld(X1,rd(mult(rd(X1,X2),X3),X2)) = rd(ld(X2,X3),X2),
inference(spm,[status(thm)],[c_0_11,c_0_30]) ).
cnf(c_0_47,plain,
mult(mult(X1,X1),rd(X1,X1)) = mult(X1,X1),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
mult(X1,mult(mult(rd(X2,mult(X1,X2)),X1),X1)) = ld(rd(rd(X2,X1),X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_44]) ).
cnf(c_0_49,plain,
mult(mult(X1,rd(X2,X2)),rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_36]),c_0_36]) ).
cnf(c_0_50,plain,
ld(mult(X1,X2),rd(mult(X1,X3),X2)) = rd(ld(X2,X3),X2),
inference(spm,[status(thm)],[c_0_46,c_0_18]) ).
cnf(c_0_51,plain,
mult(ld(rd(X1,X1),X2),rd(X1,X1)) = mult(rd(X1,X1),mult(X2,rd(X1,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_39]),c_0_39]),c_0_9]),c_0_11]),c_0_39]) ).
cnf(c_0_52,plain,
mult(rd(X1,mult(X2,mult(X3,X2))),X2) = rd(rd(X1,X2),X3),
inference(spm,[status(thm)],[c_0_44,c_0_18]) ).
cnf(c_0_53,plain,
mult(mult(X1,mult(X2,rd(X3,X3))),rd(X3,X3)) = mult(mult(X1,rd(X3,X3)),mult(rd(X3,X3),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_39]),c_0_39]) ).
cnf(c_0_54,plain,
mult(mult(rd(X1,X2),rd(X1,X2)),mult(rd(X1,mult(X2,X1)),X2)) = mult(rd(X1,X2),rd(X1,X2)),
inference(spm,[status(thm)],[c_0_47,c_0_44]) ).
cnf(c_0_55,plain,
mult(rd(X1,X1),rd(X2,mult(rd(X1,X1),X2))) = rd(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_39]),c_0_39]),c_0_49]),c_0_36]) ).
cnf(c_0_56,plain,
ld(X1,mult(mult(X1,X2),rd(X1,X1))) = mult(rd(X1,X1),mult(X2,rd(X1,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_38]),c_0_39]),c_0_39]),c_0_51]) ).
cnf(c_0_57,plain,
rd(X1,mult(rd(X2,X2),mult(X3,rd(X2,X2)))) = mult(rd(mult(X1,rd(X2,X2)),X3),rd(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_52]),c_0_39]) ).
cnf(c_0_58,plain,
rd(mult(X1,X1),mult(X1,X1)) = rd(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_47]),c_0_36]) ).
cnf(c_0_59,plain,
mult(X1,ld(mult(X2,X3),X2)) = rd(X1,X3),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_60,plain,
mult(rd(X1,X2),rd(X2,X2)) = mult(rd(X1,mult(X2,X2)),X2),
inference(spm,[status(thm)],[c_0_44,c_0_39]) ).
cnf(c_0_61,plain,
mult(rd(mult(X1,X2),mult(X2,X3)),X2) = rd(X1,rd(X3,X2)),
inference(spm,[status(thm)],[c_0_44,c_0_18]) ).
cnf(c_0_62,plain,
mult(mult(X1,mult(rd(X2,X2),X1)),rd(X1,X1)) = mult(X1,mult(rd(X2,X2),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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_39]),c_0_39]),c_0_53]),c_0_49]),c_0_39]),c_0_39]),c_0_53]),c_0_49]),c_0_55]) ).
cnf(c_0_63,plain,
mult(rd(mult(X1,rd(X2,X2)),X3),rd(X2,X2)) = mult(X1,ld(mult(mult(X2,X3),rd(X2,X2)),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_56]),c_0_57]) ).
cnf(c_0_64,plain,
mult(rd(X1,mult(X1,X1)),X1) = rd(X1,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(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_58,c_0_59]),c_0_44]),c_0_59]),c_0_39]),c_0_37]),c_0_42]),c_0_27]),c_0_36]),c_0_60]),c_0_32]),c_0_11]),c_0_27]),c_0_36]) ).
fof(c_0_65,negated_conjecture,
~ ! [X4,X5] :
( mult(X4,rd(X5,X5)) = X4
& mult(rd(X5,X5),X4) = X4 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_66,plain,
mult(rd(X1,mult(rd(X1,X1),X2)),rd(X1,X1)) = rd(X1,mult(X2,rd(X1,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_38]),c_0_39]) ).
cnf(c_0_67,plain,
mult(rd(X1,X1),rd(X2,X2)) = rd(X1,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(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_62,c_0_63]),c_0_53]),c_0_38]),c_0_59]),c_0_55]),c_0_39]),c_0_60]),c_0_64]),c_0_53]),c_0_38]),c_0_59]),c_0_55]) ).
fof(c_0_68,negated_conjecture,
( mult(esk1_0,rd(esk2_0,esk2_0)) != esk1_0
| mult(rd(esk2_0,esk2_0),esk1_0) != esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])])]) ).
cnf(c_0_69,plain,
mult(X1,rd(X2,X2)) = X1,
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_66,c_0_67]),c_0_39]),c_0_38]),c_0_38]),c_0_67]),c_0_39]) ).
cnf(c_0_70,negated_conjecture,
( mult(esk1_0,rd(esk2_0,esk2_0)) != esk1_0
| mult(rd(esk2_0,esk2_0),esk1_0) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_71,plain,
mult(rd(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_69]),c_0_11]),c_0_69]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_69])]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP655+2 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n029.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 : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 16:18:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.SfZmNpVcwT/E---3.1_8119.p
% 109.76/14.30 # Version: 3.1.0
% 109.76/14.30 # Preprocessing class: FSSSSMSSSSSNFFN.
% 109.76/14.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 109.76/14.30 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 109.76/14.30 # Starting new_bool_3 with 300s (1) cores
% 109.76/14.30 # Starting new_bool_1 with 300s (1) cores
% 109.76/14.30 # Starting sh5l with 300s (1) cores
% 109.76/14.30 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8197 completed with status 0
% 109.76/14.30 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 109.76/14.30 # Preprocessing class: FSSSSMSSSSSNFFN.
% 109.76/14.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 109.76/14.30 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 109.76/14.30 # No SInE strategy applied
% 109.76/14.30 # Search class: FUHPM-FFSF22-MFFFFFNN
% 109.76/14.30 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 109.76/14.30 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 811s (1) cores
% 109.76/14.30 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 109.76/14.30 # Starting new_bool_3 with 136s (1) cores
% 109.76/14.30 # Starting new_bool_1 with 136s (1) cores
% 109.76/14.30 # Starting sh5l with 136s (1) cores
% 109.76/14.30 # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 8201 completed with status 0
% 109.76/14.30 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 109.76/14.30 # Preprocessing class: FSSSSMSSSSSNFFN.
% 109.76/14.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 109.76/14.30 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 109.76/14.30 # No SInE strategy applied
% 109.76/14.30 # Search class: FUHPM-FFSF22-MFFFFFNN
% 109.76/14.30 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 109.76/14.30 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 811s (1) cores
% 109.76/14.30 # Preprocessing time : 0.001 s
% 109.76/14.30 # Presaturation interreduction done
% 109.76/14.30
% 109.76/14.30 # Proof found!
% 109.76/14.30 # SZS status Theorem
% 109.76/14.30 # SZS output start CNFRefutation
% See solution above
% 109.76/14.30 # Parsed axioms : 6
% 109.76/14.30 # Removed by relevancy pruning/SinE : 0
% 109.76/14.30 # Initial clauses : 6
% 109.76/14.30 # Removed in clause preprocessing : 0
% 109.76/14.30 # Initial clauses in saturation : 6
% 109.76/14.30 # Processed clauses : 7651
% 109.76/14.30 # ...of these trivial : 3484
% 109.76/14.30 # ...subsumed : 3003
% 109.76/14.30 # ...remaining for further processing : 1163
% 109.76/14.30 # Other redundant clauses eliminated : 0
% 109.76/14.30 # Clauses deleted for lack of memory : 0
% 109.76/14.30 # Backward-subsumed : 4
% 109.76/14.30 # Backward-rewritten : 360
% 109.76/14.30 # Generated clauses : 796973
% 109.76/14.30 # ...of the previous two non-redundant : 700789
% 109.76/14.30 # ...aggressively subsumed : 0
% 109.76/14.30 # Contextual simplify-reflections : 0
% 109.76/14.30 # Paramodulations : 796973
% 109.76/14.30 # Factorizations : 0
% 109.76/14.30 # NegExts : 0
% 109.76/14.30 # Equation resolutions : 0
% 109.76/14.30 # Disequality decompositions : 0
% 109.76/14.30 # Total rewrite steps : 1944195
% 109.76/14.30 # ...of those cached : 1743729
% 109.76/14.30 # Propositional unsat checks : 0
% 109.76/14.30 # Propositional check models : 0
% 109.76/14.30 # Propositional check unsatisfiable : 0
% 109.76/14.30 # Propositional clauses : 0
% 109.76/14.30 # Propositional clauses after purity: 0
% 109.76/14.30 # Propositional unsat core size : 0
% 109.76/14.30 # Propositional preprocessing time : 0.000
% 109.76/14.30 # Propositional encoding time : 0.000
% 109.76/14.30 # Propositional solver time : 0.000
% 109.76/14.30 # Success case prop preproc time : 0.000
% 109.76/14.30 # Success case prop encoding time : 0.000
% 109.76/14.30 # Success case prop solver time : 0.000
% 109.76/14.30 # Current number of processed clauses : 793
% 109.76/14.30 # Positive orientable unit clauses : 749
% 109.76/14.30 # Positive unorientable unit clauses: 44
% 109.76/14.30 # Negative unit clauses : 0
% 109.76/14.30 # Non-unit-clauses : 0
% 109.76/14.30 # Current number of unprocessed clauses: 691166
% 109.76/14.30 # ...number of literals in the above : 691166
% 109.76/14.30 # Current number of archived formulas : 0
% 109.76/14.30 # Current number of archived clauses : 370
% 109.76/14.30 # Clause-clause subsumption calls (NU) : 0
% 109.76/14.30 # Rec. Clause-clause subsumption calls : 0
% 109.76/14.30 # Non-unit clause-clause subsumptions : 0
% 109.76/14.30 # Unit Clause-clause subsumption calls : 1669
% 109.76/14.30 # Rewrite failures with RHS unbound : 5197
% 109.76/14.30 # BW rewrite match attempts : 11750
% 109.76/14.30 # BW rewrite match successes : 686
% 109.76/14.30 # Condensation attempts : 0
% 109.76/14.30 # Condensation successes : 0
% 109.76/14.30 # Termbank termtop insertions : 19698531
% 109.76/14.30 # Search garbage collected termcells : 25
% 109.76/14.30
% 109.76/14.30 # -------------------------------------------------
% 109.76/14.30 # User time : 13.115 s
% 109.76/14.30 # System time : 0.501 s
% 109.76/14.30 # Total time : 13.616 s
% 109.76/14.30 # Maximum resident set size: 1656 pages
% 109.76/14.30
% 109.76/14.30 # -------------------------------------------------
% 109.76/14.30 # User time : 67.351 s
% 109.76/14.30 # System time : 0.932 s
% 109.76/14.30 # Total time : 68.283 s
% 109.76/14.30 # Maximum resident set size: 1688 pages
% 109.76/14.30 % E---3.1 exiting
% 109.76/14.30 % E exiting
%------------------------------------------------------------------------------