TSTP Solution File: GRP667+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP667+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:45 EDT 2023
% Result : Theorem 10.00s 1.68s
% Output : CNFRefutation 10.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 67 unt; 0 def)
% Number of atoms : 83 ( 82 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 145 ( 0 sgn; 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f04) ).
fof(f08,axiom,
! [X1,X2] : mult(mult(X2,X1),X2) = mult(X2,mult(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f08) ).
fof(f12,axiom,
! [X10,X11,X12] :
( mult(mult(X10,X11),mult(X12,X10)) = mult(X10,mult(mult(X11,X12),X10))
=> mult(X10,mult(X11,mult(X10,X12))) = mult(mult(mult(X10,X11),X10),X12) ),
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f12) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f03) ).
fof(f06,axiom,
! [X2] : mult(unit,X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f06) ).
fof(f05,axiom,
! [X2] : mult(X2,unit) = X2,
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f05) ).
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/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f07) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f02) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f01) ).
fof(f09,axiom,
! [X2] : mult(f(X2),f(X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f09) ).
fof(f10,axiom,
! [X4,X5,X6] :
( mult(X4,mult(X5,mult(X6,X5))) = mult(mult(mult(X4,X5),X6),X5)
=> mult(X5,mult(X4,mult(X5,X6))) = mult(mult(mult(X5,X4),X5),X6) ),
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',f10) ).
fof(goals,conjecture,
mult(a,mult(b,mult(a,c))) = mult(mult(mult(a,b),a),c),
file('/export/starexec/sandbox/tmp/tmp.UAYumfryul/E---3.1_27237.p',goals) ).
fof(c_0_12,plain,
! [X19,X20] : rd(mult(X20,X19),X19) = X20,
inference(variable_rename,[status(thm)],[f04]) ).
fof(c_0_13,plain,
! [X26,X27] : mult(mult(X27,X26),X27) = mult(X27,mult(X26,X27)),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_14,plain,
! [X35,X36,X37] :
( mult(mult(X35,X36),mult(X37,X35)) != mult(X35,mult(mult(X36,X37),X35))
| mult(X35,mult(X36,mult(X35,X37))) = mult(mult(mult(X35,X36),X35),X37) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[f12])]) ).
cnf(c_0_15,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X17,X18] : mult(rd(X18,X17),X17) = X18,
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_18,plain,
! [X22] : mult(unit,X22) = X22,
inference(variable_rename,[status(thm)],[f06]) ).
cnf(c_0_19,plain,
( mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3)
| mult(mult(X1,X2),mult(X3,X1)) != mult(X1,mult(mult(X2,X3),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X21] : mult(X21,unit) = X21,
inference(variable_rename,[status(thm)],[f05]) ).
cnf(c_0_21,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3)))
| mult(mult(X1,X2),mult(X3,X1)) != mult(X1,mult(mult(X2,X3),X1)) ),
inference(rw,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_25,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X23,X24,X25] : mult(mult(X25,X24),mult(mult(X23,X24),X23)) = mult(mult(X25,mult(mult(X24,X23),X24)),X23),
inference(variable_rename,[status(thm)],[f07]) ).
fof(c_0_27,plain,
! [X15,X16] : ld(X16,mult(X16,X15)) = X15,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_28,plain,
rd(mult(X1,X2),X1) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
rd(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_30,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_23]),c_0_25]),c_0_23])]) ).
fof(c_0_31,plain,
! [X13,X14] : mult(X14,ld(X14,X13)) = X13,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_32,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_26]) ).
cnf(c_0_33,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_29]) ).
cnf(c_0_35,plain,
rd(mult(X1,mult(X1,X2)),X2) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_30]) ).
cnf(c_0_36,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,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_32,c_0_16]),c_0_16]) ).
cnf(c_0_38,plain,
rd(unit,X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
rd(mult(X1,X2),ld(X1,X2)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
ld(mult(X1,X2),mult(X1,mult(X2,X1))) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_41,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_15,c_0_37]) ).
cnf(c_0_42,plain,
mult(ld(X1,unit),X1) = unit,
inference(spm,[status(thm)],[c_0_22,c_0_38]) ).
cnf(c_0_43,plain,
mult(mult(X1,X2),mult(X1,X2)) = mult(X1,mult(X2,mult(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,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_41,c_0_42]),c_0_23]),c_0_28]),c_0_15]) ).
cnf(c_0_45,plain,
mult(rd(X1,X2),mult(X2,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_43,c_0_22]) ).
cnf(c_0_46,plain,
rd(mult(X1,mult(X2,mult(X1,X2))),X2) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_23]),c_0_23]) ).
cnf(c_0_47,plain,
mult(rd(X1,X2),mult(X2,rd(X1,X2))) = mult(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_48,plain,
mult(ld(X1,unit),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_44,c_0_22]) ).
cnf(c_0_49,plain,
rd(mult(X1,X1),mult(X2,X1)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_45]) ).
cnf(c_0_50,plain,
rd(mult(X1,X1),X2) = mult(X1,rd(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_22]),c_0_45]),c_0_47]) ).
cnf(c_0_51,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_15,c_0_48]) ).
fof(c_0_52,plain,
! [X28] : mult(f(X28),f(X28)) = X28,
inference(variable_rename,[status(thm)],[f09]) ).
cnf(c_0_53,plain,
mult(X1,ld(X2,unit)) = rd(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_54,plain,
mult(X1,mult(ld(X1,X2),X2)) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_43,c_0_36]) ).
cnf(c_0_55,plain,
mult(X1,mult(ld(X1,X2),X1)) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_56,plain,
mult(f(X1),f(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,plain,
ld(X1,rd(X1,X2)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_33,c_0_53]) ).
cnf(c_0_58,plain,
ld(X1,mult(X2,X2)) = mult(ld(X1,X2),X2),
inference(spm,[status(thm)],[c_0_33,c_0_54]) ).
cnf(c_0_59,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_37,c_0_55]),c_0_36]) ).
cnf(c_0_60,plain,
mult(f(X1),mult(f(X1),X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_56]) ).
cnf(c_0_61,plain,
ld(mult(X1,X2),X1) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_57,c_0_15]) ).
cnf(c_0_62,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_48,c_0_36]) ).
cnf(c_0_63,plain,
mult(ld(X1,f(X2)),f(X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_58,c_0_56]) ).
fof(c_0_64,plain,
! [X29,X30,X31] :
( mult(X29,mult(X30,mult(X31,X30))) != mult(mult(mult(X29,X30),X31),X30)
| mult(X30,mult(X29,mult(X30,X31))) = mult(mult(mult(X30,X29),X30),X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[f10])]) ).
cnf(c_0_65,plain,
rd(mult(X1,mult(X2,X3)),X3) = mult(mult(X1,X3),ld(X3,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(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_53]),c_0_61]),c_0_62]),c_0_59]),c_0_63]) ).
fof(c_0_66,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
cnf(c_0_67,plain,
( mult(X2,mult(X1,mult(X2,X3))) = mult(mult(mult(X2,X1),X2),X3)
| mult(X1,mult(X2,mult(X3,X2))) != mult(mult(mult(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_68,plain,
mult(mult(mult(X1,X2),ld(X2,X3)),X2) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_70,plain,
( mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3)))
| mult(mult(mult(X2,X1),X3),X1) != mult(X2,mult(X1,mult(X3,X1))) ),
inference(rw,[status(thm)],[c_0_67,c_0_16]) ).
cnf(c_0_71,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_68,c_0_33]),c_0_16]) ).
cnf(c_0_72,negated_conjecture,
mult(mult(a,mult(b,a)),c) != mult(a,mult(b,mult(a,c))),
inference(rw,[status(thm)],[c_0_69,c_0_16]) ).
cnf(c_0_73,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GRP667+1 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.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 : Tue Oct 3 02:26:38 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.UAYumfryul/E---3.1_27237.p
% 10.00/1.68 # Version: 3.1pre001
% 10.00/1.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.00/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.00/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.00/1.68 # Starting new_bool_3 with 300s (1) cores
% 10.00/1.68 # Starting new_bool_1 with 300s (1) cores
% 10.00/1.68 # Starting sh5l with 300s (1) cores
% 10.00/1.68 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27315 completed with status 0
% 10.00/1.68 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.00/1.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.00/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.00/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.00/1.68 # No SInE strategy applied
% 10.00/1.68 # Search class: FHUPM-FFSF21-MFFFFFNN
% 10.00/1.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 10.00/1.68 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 10.00/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.00/1.68 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 10.00/1.68 # Starting new_bool_3 with 136s (1) cores
% 10.00/1.68 # Starting new_bool_1 with 136s (1) cores
% 10.00/1.68 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27321 completed with status 0
% 10.00/1.68 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.00/1.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.00/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.00/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.00/1.68 # No SInE strategy applied
% 10.00/1.68 # Search class: FHUPM-FFSF21-MFFFFFNN
% 10.00/1.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 10.00/1.68 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 10.00/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.00/1.68 # Preprocessing time : 0.001 s
% 10.00/1.68 # Presaturation interreduction done
% 10.00/1.68
% 10.00/1.68 # Proof found!
% 10.00/1.68 # SZS status Theorem
% 10.00/1.68 # SZS output start CNFRefutation
% See solution above
% 10.00/1.68 # Parsed axioms : 13
% 10.00/1.68 # Removed by relevancy pruning/SinE : 0
% 10.00/1.68 # Initial clauses : 13
% 10.00/1.68 # Removed in clause preprocessing : 0
% 10.00/1.68 # Initial clauses in saturation : 13
% 10.00/1.68 # Processed clauses : 994
% 10.00/1.68 # ...of these trivial : 455
% 10.00/1.68 # ...subsumed : 115
% 10.00/1.68 # ...remaining for further processing : 424
% 10.00/1.68 # Other redundant clauses eliminated : 0
% 10.00/1.68 # Clauses deleted for lack of memory : 0
% 10.00/1.68 # Backward-subsumed : 1
% 10.00/1.68 # Backward-rewritten : 124
% 10.00/1.68 # Generated clauses : 57964
% 10.00/1.68 # ...of the previous two non-redundant : 48424
% 10.00/1.68 # ...aggressively subsumed : 0
% 10.00/1.68 # Contextual simplify-reflections : 0
% 10.00/1.68 # Paramodulations : 57964
% 10.00/1.68 # Factorizations : 0
% 10.00/1.68 # NegExts : 0
% 10.00/1.68 # Equation resolutions : 0
% 10.00/1.68 # Total rewrite steps : 119153
% 10.00/1.68 # Propositional unsat checks : 0
% 10.00/1.68 # Propositional check models : 0
% 10.00/1.68 # Propositional check unsatisfiable : 0
% 10.00/1.68 # Propositional clauses : 0
% 10.00/1.68 # Propositional clauses after purity: 0
% 10.00/1.68 # Propositional unsat core size : 0
% 10.00/1.68 # Propositional preprocessing time : 0.000
% 10.00/1.68 # Propositional encoding time : 0.000
% 10.00/1.68 # Propositional solver time : 0.000
% 10.00/1.68 # Success case prop preproc time : 0.000
% 10.00/1.68 # Success case prop encoding time : 0.000
% 10.00/1.68 # Success case prop solver time : 0.000
% 10.00/1.68 # Current number of processed clauses : 287
% 10.00/1.68 # Positive orientable unit clauses : 268
% 10.00/1.68 # Positive unorientable unit clauses: 2
% 10.00/1.68 # Negative unit clauses : 1
% 10.00/1.68 # Non-unit-clauses : 16
% 10.00/1.68 # Current number of unprocessed clauses: 47108
% 10.00/1.68 # ...number of literals in the above : 63610
% 10.00/1.68 # Current number of archived formulas : 0
% 10.00/1.68 # Current number of archived clauses : 137
% 10.00/1.68 # Clause-clause subsumption calls (NU) : 188
% 10.00/1.68 # Rec. Clause-clause subsumption calls : 187
% 10.00/1.68 # Non-unit clause-clause subsumptions : 1
% 10.00/1.68 # Unit Clause-clause subsumption calls : 207
% 10.00/1.68 # Rewrite failures with RHS unbound : 0
% 10.00/1.68 # BW rewrite match attempts : 1578
% 10.00/1.68 # BW rewrite match successes : 120
% 10.00/1.68 # Condensation attempts : 0
% 10.00/1.68 # Condensation successes : 0
% 10.00/1.68 # Termbank termtop insertions : 1370381
% 10.00/1.68
% 10.00/1.68 # -------------------------------------------------
% 10.00/1.68 # User time : 1.156 s
% 10.00/1.68 # System time : 0.054 s
% 10.00/1.68 # Total time : 1.210 s
% 10.00/1.68 # Maximum resident set size: 1700 pages
% 10.00/1.68
% 10.00/1.68 # -------------------------------------------------
% 10.00/1.68 # User time : 5.925 s
% 10.00/1.68 # System time : 0.156 s
% 10.00/1.68 # Total time : 6.082 s
% 10.00/1.68 # Maximum resident set size: 1688 pages
% 10.00/1.68 % E---3.1 exiting
% 10.00/1.68 % E---3.1 exiting
%------------------------------------------------------------------------------