TSTP Solution File: REL011+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : REL011+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 19:13:28 EDT 2023
% Result : Theorem 0.17s 0.52s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of formulae : 79 ( 76 unt; 0 def)
% Number of atoms : 82 ( 81 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 119 ( 5 sgn; 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',composition_identity) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',def_top) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',maddux3_a_kind_of_de_Morgan) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',maddux2_join_associativity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',converse_additivity) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( meet(X1,composition(converse(X2),X3)) = zero
=> meet(composition(X2,X1),X3) = zero ),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',goals) ).
fof(dedekind_law,axiom,
! [X1,X2,X3] : join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))) = composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',dedekind_law) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',composition_distributivity) ).
fof(composition_associativity,axiom,
! [X1,X2,X3] : composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.cfJzQZFkNL/E---3.1_20022.p',composition_associativity) ).
fof(c_0_15,plain,
! [X23,X24] : converse(composition(X23,X24)) = composition(converse(X24),converse(X23)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_16,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_17,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X16] : composition(X16,one) = X16,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_20,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X25,X26] : join(composition(converse(X25),complement(composition(X25,X26))),complement(X26)) = complement(X26),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_23,plain,
! [X4,X5] : join(X4,X5) = join(X5,X4),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_24,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18]) ).
fof(c_0_25,plain,
! [X28] : zero = meet(X28,complement(X28)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_26,plain,
! [X11,X12] : meet(X11,X12) = complement(join(complement(X11),complement(X12))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_27,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_30,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X27] : top = join(X27,complement(X27)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_33,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_35,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_37,plain,
! [X9,X10] : X9 = join(complement(join(complement(X9),complement(X10))),complement(join(complement(X9),X10))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_38,plain,
! [X6,X7,X8] : join(X6,join(X7,X8)) = join(join(X6,X7),X8),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_39,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29]),c_0_34]) ).
cnf(c_0_40,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_45,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_36]),c_0_40]),c_0_28]) ).
cnf(c_0_47,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_48]) ).
fof(c_0_50,plain,
! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_51,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_49]) ).
cnf(c_0_52,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_53,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_51,c_0_36]) ).
cnf(c_0_54,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_52,c_0_18]) ).
fof(c_0_55,negated_conjecture,
~ ! [X1,X2,X3] :
( meet(X1,composition(converse(X2),X3)) = zero
=> meet(composition(X2,X1),X3) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_56,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_28,c_0_53]) ).
cnf(c_0_57,plain,
join(X1,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_54,c_0_53]) ).
fof(c_0_58,plain,
! [X29,X30,X31] : join(meet(composition(X29,X30),X31),composition(meet(X29,composition(X31,converse(X30))),meet(X30,composition(converse(X29),X31)))) = composition(meet(X29,composition(X31,converse(X30))),meet(X30,composition(converse(X29),X31))),
inference(variable_rename,[status(thm)],[dedekind_law]) ).
fof(c_0_59,negated_conjecture,
( meet(esk1_0,composition(converse(esk2_0),esk3_0)) = zero
& meet(composition(esk2_0,esk1_0),esk3_0) != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_55])])]) ).
fof(c_0_60,plain,
! [X17,X18,X19] : composition(join(X17,X18),X19) = join(composition(X17,X19),composition(X18,X19)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_61,plain,
composition(converse(X1),complement(composition(X1,top))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_40]),c_0_47]) ).
cnf(c_0_62,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))) = composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_64,negated_conjecture,
meet(esk1_0,composition(converse(esk2_0),esk3_0)) = zero,
inference(split_conjunct,[status(thm)],[c_0_59]) ).
fof(c_0_65,plain,
! [X13,X14,X15] : composition(X13,composition(X14,X15)) = composition(composition(X13,X14),X15),
inference(variable_rename,[status(thm)],[composition_associativity]) ).
cnf(c_0_66,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_67,plain,
composition(top,complement(composition(top,top))) = zero,
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
meet(composition(esk2_0,esk1_0),esk3_0) != zero,
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_69,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3)))))) = composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_70,negated_conjecture,
complement(join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0)))) = zero,
inference(rw,[status(thm)],[c_0_64,c_0_31]) ).
cnf(c_0_71,plain,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_72,plain,
composition(X1,complement(composition(top,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_47]),c_0_56]),c_0_67]) ).
cnf(c_0_73,negated_conjecture,
complement(join(complement(composition(esk2_0,esk1_0)),complement(esk3_0))) != zero,
inference(rw,[status(thm)],[c_0_68,c_0_31]) ).
cnf(c_0_74,negated_conjecture,
join(complement(join(complement(esk3_0),complement(composition(esk2_0,esk1_0)))),composition(complement(join(complement(esk2_0),complement(composition(esk3_0,converse(esk1_0))))),zero)) = composition(complement(join(complement(esk2_0),complement(composition(esk3_0,converse(esk1_0))))),zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_28]) ).
cnf(c_0_75,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_72]) ).
cnf(c_0_76,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_77,negated_conjecture,
complement(join(complement(esk3_0),complement(composition(esk2_0,esk1_0)))) != zero,
inference(rw,[status(thm)],[c_0_73,c_0_28]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_75]),c_0_77]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : REL011+2 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.12/0.31 % Computer : n019.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 2400
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Mon Oct 2 15:12:36 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 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.cfJzQZFkNL/E---3.1_20022.p
% 0.17/0.52 # Version: 3.1pre001
% 0.17/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.52 # Starting sh5l with 300s (1) cores
% 0.17/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20100 completed with status 0
% 0.17/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.52 # No SInE strategy applied
% 0.17/0.52 # Search class: FUUPM-FFMF21-DFFFFFNN
% 0.17/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.52 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.17/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.52 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.17/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20105 completed with status 0
% 0.17/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.52 # No SInE strategy applied
% 0.17/0.52 # Search class: FUUPM-FFMF21-DFFFFFNN
% 0.17/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.52 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.17/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.52 # Preprocessing time : 0.001 s
% 0.17/0.52 # Presaturation interreduction done
% 0.17/0.52
% 0.17/0.52 # Proof found!
% 0.17/0.52 # SZS status Theorem
% 0.17/0.52 # SZS output start CNFRefutation
% See solution above
% 0.17/0.52 # Parsed axioms : 17
% 0.17/0.52 # Removed by relevancy pruning/SinE : 0
% 0.17/0.52 # Initial clauses : 18
% 0.17/0.52 # Removed in clause preprocessing : 1
% 0.17/0.52 # Initial clauses in saturation : 17
% 0.17/0.52 # Processed clauses : 515
% 0.17/0.52 # ...of these trivial : 262
% 0.17/0.52 # ...subsumed : 35
% 0.17/0.52 # ...remaining for further processing : 218
% 0.17/0.52 # Other redundant clauses eliminated : 0
% 0.17/0.52 # Clauses deleted for lack of memory : 0
% 0.17/0.52 # Backward-subsumed : 0
% 0.17/0.52 # Backward-rewritten : 48
% 0.17/0.52 # Generated clauses : 6478
% 0.17/0.52 # ...of the previous two non-redundant : 3812
% 0.17/0.52 # ...aggressively subsumed : 0
% 0.17/0.52 # Contextual simplify-reflections : 0
% 0.17/0.52 # Paramodulations : 6478
% 0.17/0.52 # Factorizations : 0
% 0.17/0.52 # NegExts : 0
% 0.17/0.52 # Equation resolutions : 0
% 0.17/0.52 # Total rewrite steps : 11629
% 0.17/0.52 # Propositional unsat checks : 0
% 0.17/0.52 # Propositional check models : 0
% 0.17/0.52 # Propositional check unsatisfiable : 0
% 0.17/0.52 # Propositional clauses : 0
% 0.17/0.52 # Propositional clauses after purity: 0
% 0.17/0.52 # Propositional unsat core size : 0
% 0.17/0.52 # Propositional preprocessing time : 0.000
% 0.17/0.52 # Propositional encoding time : 0.000
% 0.17/0.52 # Propositional solver time : 0.000
% 0.17/0.52 # Success case prop preproc time : 0.000
% 0.17/0.52 # Success case prop encoding time : 0.000
% 0.17/0.52 # Success case prop solver time : 0.000
% 0.17/0.52 # Current number of processed clauses : 153
% 0.17/0.52 # Positive orientable unit clauses : 149
% 0.17/0.52 # Positive unorientable unit clauses: 3
% 0.17/0.52 # Negative unit clauses : 1
% 0.17/0.52 # Non-unit-clauses : 0
% 0.17/0.52 # Current number of unprocessed clauses: 3278
% 0.17/0.52 # ...number of literals in the above : 3278
% 0.17/0.52 # Current number of archived formulas : 0
% 0.17/0.52 # Current number of archived clauses : 66
% 0.17/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.52 # Non-unit clause-clause subsumptions : 0
% 0.17/0.52 # Unit Clause-clause subsumption calls : 15
% 0.17/0.52 # Rewrite failures with RHS unbound : 0
% 0.17/0.52 # BW rewrite match attempts : 587
% 0.17/0.52 # BW rewrite match successes : 103
% 0.17/0.52 # Condensation attempts : 0
% 0.17/0.52 # Condensation successes : 0
% 0.17/0.52 # Termbank termtop insertions : 142253
% 0.17/0.52
% 0.17/0.52 # -------------------------------------------------
% 0.17/0.52 # User time : 0.078 s
% 0.17/0.52 # System time : 0.009 s
% 0.17/0.52 # Total time : 0.087 s
% 0.17/0.52 # Maximum resident set size: 1744 pages
% 0.17/0.52
% 0.17/0.52 # -------------------------------------------------
% 0.17/0.52 # User time : 0.414 s
% 0.17/0.52 # System time : 0.020 s
% 0.17/0.52 # Total time : 0.434 s
% 0.17/0.52 # Maximum resident set size: 1688 pages
% 0.17/0.52 % E---3.1 exiting
% 0.17/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------