TSTP Solution File: GRP667+6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP667+6 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:46 EDT 2023
% Result : Theorem 14.34s 2.48s
% Output : CNFRefutation 14.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 71 ( 68 unt; 0 def)
% Number of atoms : 80 ( 79 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 6 ~; 6 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 155 ( 0 sgn; 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f08,axiom,
! [X1,X2] : mult(mult(X2,X1),X2) = mult(X2,mult(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',f08) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',f01) ).
fof(f07,axiom,
! [X3,X1,X2] : mult(mult(X2,X1),mult(mult(X3,X1),X3)) = mult(mult(X2,mult(mult(X1,X3),X1)),X3),
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',f07) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',f02) ).
fof(f05,axiom,
! [X2] : mult(X2,unit) = X2,
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',f05) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',f04) ).
fof(f06,axiom,
! [X2] : mult(unit,X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',f06) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',f03) ).
fof(f09,axiom,
! [X2] : mult(f(X2),f(X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',f09) ).
fof(goals,conjecture,
( ! [X4,X5,X6] : mult(X6,mult(X4,mult(X6,X5))) = mult(mult(mult(X6,X4),X6),X5)
| ! [X7,X8,X9] : mult(X7,mult(X9,mult(X8,X9))) = mult(mult(mult(X7,X9),X8),X9)
| ! [X10,X11,X12] : mult(mult(X12,X10),mult(X11,X12)) = mult(mult(X12,mult(X10,X11)),X12)
| ! [X13,X14,X15] : mult(mult(X15,X13),mult(X14,X15)) = mult(X15,mult(mult(X13,X14),X15)) ),
file('/export/starexec/sandbox2/tmp/tmp.6C0zuvcPhB/E---3.1_16292.p',goals) ).
fof(c_0_10,plain,
! [X29,X30] : mult(mult(X30,X29),X30) = mult(X30,mult(X29,X30)),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_11,plain,
! [X16,X17] : mult(X17,ld(X17,X16)) = X16,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_12,plain,
! [X26,X27,X28] : mult(mult(X28,X27),mult(mult(X26,X27),X26)) = mult(mult(X28,mult(mult(X27,X26),X27)),X26),
inference(variable_rename,[status(thm)],[f07]) ).
fof(c_0_13,plain,
! [X18,X19] : ld(X19,mult(X19,X18)) = X18,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_14,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X24] : mult(X24,unit) = X24,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_17,plain,
! [X22,X23] : rd(mult(X23,X22),X22) = X23,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_18,plain,
mult(mult(X1,X2),mult(mult(X3,X2),X3)) = mult(mult(X1,mult(mult(X2,X3),X2)),X3),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
mult(X1,mult(ld(X1,X2),X1)) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_21,plain,
! [X25] : mult(unit,X25) = X25,
inference(variable_rename,[status(thm)],[f06]) ).
cnf(c_0_22,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X20,X21] : mult(rd(X21,X20),X20) = X21,
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_25,plain,
mult(mult(X1,mult(X2,mult(X3,X2))),X3) = mult(mult(X1,X2),mult(X3,mult(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_14]),c_0_14]) ).
cnf(c_0_26,plain,
ld(X1,mult(X2,X1)) = mult(ld(X1,X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_29,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_30,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
rd(mult(mult(X1,X2),mult(X3,mult(X2,X3))),X3) = mult(X1,mult(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_32,plain,
mult(ld(X1,unit),X1) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,plain,
rd(mult(X1,X2),X1) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
mult(ld(X1,unit),mult(X1,mult(X2,X1))) = mult(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_33]),c_0_23]) ).
cnf(c_0_35,plain,
mult(ld(X1,rd(X2,X1)),X1) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_30]) ).
cnf(c_0_36,plain,
mult(mult(X1,mult(X2,X1)),X2) = mult(X1,mult(X2,mult(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_27]) ).
cnf(c_0_37,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_22]),c_0_27]),c_0_27]) ).
cnf(c_0_38,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_15]) ).
cnf(c_0_39,plain,
mult(mult(X1,X2),ld(X2,X1)) = mult(X2,mult(ld(X2,X1),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_20]),c_0_15]) ).
cnf(c_0_40,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_41,plain,
ld(X1,mult(X2,X2)) = mult(ld(X1,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_38]) ).
cnf(c_0_42,plain,
mult(mult(X1,rd(X1,X2)),X2) = mult(rd(X1,X2),mult(X2,X1)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
mult(X1,mult(ld(X1,X2),X2)) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_41]) ).
cnf(c_0_44,plain,
rd(mult(rd(X1,X2),mult(X2,X1)),X2) = mult(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_23,c_0_42]) ).
cnf(c_0_45,plain,
mult(rd(X1,X2),mult(X2,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_43,c_0_40]) ).
cnf(c_0_46,plain,
ld(mult(X1,X2),mult(X2,mult(ld(X2,X1),X1))) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_19,c_0_39]) ).
cnf(c_0_47,plain,
rd(mult(X1,X1),X2) = mult(X1,rd(X1,X2)),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
rd(ld(X1,X2),X2) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_23,c_0_38]) ).
cnf(c_0_49,plain,
mult(mult(X1,X2),mult(X1,mult(X2,X1))) = mult(X1,mult(X2,mult(X1,mult(X2,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_36]) ).
cnf(c_0_50,plain,
mult(ld(mult(X1,X2),X1),X1) = ld(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_43]),c_0_41]) ).
cnf(c_0_51,plain,
mult(X1,rd(X1,mult(X2,X1))) = rd(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_45]),c_0_47]) ).
cnf(c_0_52,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_48,c_0_19]) ).
cnf(c_0_53,plain,
mult(mult(ld(X1,X2),X2),X1) = mult(ld(X1,X2),mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_15]),c_0_20]) ).
cnf(c_0_54,plain,
mult(X1,mult(ld(X1,X2),mult(X2,X1))) = mult(X2,mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_20]),c_0_15]) ).
fof(c_0_55,plain,
! [X31] : mult(f(X31),f(X31)) = X31,
inference(variable_rename,[status(thm)],[f09]) ).
cnf(c_0_56,plain,
mult(mult(X1,mult(X2,X3)),ld(X3,X2)) = mult(mult(X1,X3),mult(ld(X3,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_15]) ).
cnf(c_0_57,plain,
ld(mult(X1,X2),X1) = ld(X2,unit),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_50]),c_0_48]) ).
cnf(c_0_58,plain,
mult(X1,ld(X2,unit)) = rd(X1,X2),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_41]),c_0_53]),c_0_54]) ).
cnf(c_0_60,plain,
mult(f(X1),f(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_61,plain,
rd(mult(X1,mult(X2,mult(X2,X3))),X3) = mult(mult(X1,X3),mult(ld(X3,X2),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_38]),c_0_56]) ).
cnf(c_0_62,plain,
mult(f(X1),mult(f(X1),X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
mult(ld(X1,f(X2)),f(X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_41,c_0_60]) ).
fof(c_0_64,negated_conjecture,
~ ( ! [X4,X5,X6] : mult(X6,mult(X4,mult(X6,X5))) = mult(mult(mult(X6,X4),X6),X5)
| ! [X7,X8,X9] : mult(X7,mult(X9,mult(X8,X9))) = mult(mult(mult(X7,X9),X8),X9)
| ! [X10,X11,X12] : mult(mult(X12,X10),mult(X11,X12)) = mult(mult(X12,mult(X10,X11)),X12)
| ! [X13,X14,X15] : mult(mult(X15,X13),mult(X14,X15)) = mult(X15,mult(mult(X13,X14),X15)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_65,plain,
rd(mult(X1,mult(X2,X3)),X3) = mult(mult(X1,X3),ld(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
fof(c_0_66,negated_conjecture,
( mult(esk3_0,mult(esk1_0,mult(esk3_0,esk2_0))) != mult(mult(mult(esk3_0,esk1_0),esk3_0),esk2_0)
& mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))) != mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0)
& mult(mult(esk9_0,esk7_0),mult(esk8_0,esk9_0)) != mult(mult(esk9_0,mult(esk7_0,esk8_0)),esk9_0)
& mult(mult(esk12_0,esk10_0),mult(esk11_0,esk12_0)) != mult(esk12_0,mult(mult(esk10_0,esk11_0),esk12_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])])]) ).
cnf(c_0_67,plain,
mult(mult(mult(X1,X2),ld(X2,X3)),X2) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))) != mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_69,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(X2,mult(X3,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_19]),c_0_14]) ).
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.03/0.13 % Problem : GRP667+6 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 02:27:26 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.6C0zuvcPhB/E---3.1_16292.p
% 14.34/2.48 # Version: 3.1pre001
% 14.34/2.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 14.34/2.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.34/2.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.34/2.48 # Starting new_bool_3 with 300s (1) cores
% 14.34/2.48 # Starting new_bool_1 with 300s (1) cores
% 14.34/2.48 # Starting sh5l with 300s (1) cores
% 14.34/2.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16371 completed with status 0
% 14.34/2.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 14.34/2.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 14.34/2.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.34/2.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.34/2.48 # No SInE strategy applied
% 14.34/2.48 # Search class: FUUPM-FFSF21-MFFFFFNN
% 14.34/2.48 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.34/2.48 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 14.34/2.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.34/2.48 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 14.34/2.48 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 14.34/2.48 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 14.34/2.48 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 16380 completed with status 0
% 14.34/2.48 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 14.34/2.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 14.34/2.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.34/2.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.34/2.48 # No SInE strategy applied
% 14.34/2.48 # Search class: FUUPM-FFSF21-MFFFFFNN
% 14.34/2.48 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.34/2.48 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 14.34/2.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.34/2.48 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 14.34/2.48 # Preprocessing time : 0.001 s
% 14.34/2.48
% 14.34/2.48 # Proof found!
% 14.34/2.48 # SZS status Theorem
% 14.34/2.48 # SZS output start CNFRefutation
% See solution above
% 14.34/2.48 # Parsed axioms : 10
% 14.34/2.48 # Removed by relevancy pruning/SinE : 0
% 14.34/2.48 # Initial clauses : 13
% 14.34/2.48 # Removed in clause preprocessing : 0
% 14.34/2.48 # Initial clauses in saturation : 13
% 14.34/2.48 # Processed clauses : 3306
% 14.34/2.48 # ...of these trivial : 2159
% 14.34/2.48 # ...subsumed : 379
% 14.34/2.48 # ...remaining for further processing : 768
% 14.34/2.48 # Other redundant clauses eliminated : 0
% 14.34/2.48 # Clauses deleted for lack of memory : 0
% 14.34/2.48 # Backward-subsumed : 0
% 14.34/2.48 # Backward-rewritten : 234
% 14.34/2.48 # Generated clauses : 187143
% 14.34/2.48 # ...of the previous two non-redundant : 150137
% 14.34/2.48 # ...aggressively subsumed : 0
% 14.34/2.48 # Contextual simplify-reflections : 0
% 14.34/2.48 # Paramodulations : 187143
% 14.34/2.48 # Factorizations : 0
% 14.34/2.48 # NegExts : 0
% 14.34/2.48 # Equation resolutions : 0
% 14.34/2.48 # Total rewrite steps : 489091
% 14.34/2.48 # Propositional unsat checks : 0
% 14.34/2.48 # Propositional check models : 0
% 14.34/2.48 # Propositional check unsatisfiable : 0
% 14.34/2.48 # Propositional clauses : 0
% 14.34/2.48 # Propositional clauses after purity: 0
% 14.34/2.48 # Propositional unsat core size : 0
% 14.34/2.48 # Propositional preprocessing time : 0.000
% 14.34/2.48 # Propositional encoding time : 0.000
% 14.34/2.48 # Propositional solver time : 0.000
% 14.34/2.48 # Success case prop preproc time : 0.000
% 14.34/2.48 # Success case prop encoding time : 0.000
% 14.34/2.48 # Success case prop solver time : 0.000
% 14.34/2.48 # Current number of processed clauses : 534
% 14.34/2.48 # Positive orientable unit clauses : 526
% 14.34/2.48 # Positive unorientable unit clauses: 5
% 14.34/2.48 # Negative unit clauses : 3
% 14.34/2.48 # Non-unit-clauses : 0
% 14.34/2.48 # Current number of unprocessed clauses: 146319
% 14.34/2.48 # ...number of literals in the above : 146319
% 14.34/2.48 # Current number of archived formulas : 0
% 14.34/2.48 # Current number of archived clauses : 234
% 14.34/2.48 # Clause-clause subsumption calls (NU) : 0
% 14.34/2.48 # Rec. Clause-clause subsumption calls : 0
% 14.34/2.48 # Non-unit clause-clause subsumptions : 0
% 14.34/2.48 # Unit Clause-clause subsumption calls : 468
% 14.34/2.48 # Rewrite failures with RHS unbound : 0
% 14.34/2.48 # BW rewrite match attempts : 3123
% 14.34/2.48 # BW rewrite match successes : 218
% 14.34/2.48 # Condensation attempts : 3306
% 14.34/2.48 # Condensation successes : 0
% 14.34/2.48 # Termbank termtop insertions : 2985327
% 14.34/2.48
% 14.34/2.48 # -------------------------------------------------
% 14.34/2.48 # User time : 1.804 s
% 14.34/2.48 # System time : 0.103 s
% 14.34/2.48 # Total time : 1.906 s
% 14.34/2.48 # Maximum resident set size: 1688 pages
% 14.34/2.48
% 14.34/2.48 # -------------------------------------------------
% 14.34/2.48 # User time : 8.492 s
% 14.34/2.48 # System time : 0.371 s
% 14.34/2.48 # Total time : 8.863 s
% 14.34/2.48 # Maximum resident set size: 1696 pages
% 14.34/2.48 % E---3.1 exiting
% 14.34/2.49 % E---3.1 exiting
%------------------------------------------------------------------------------