TSTP Solution File: REL027+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : REL027+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 09:13:03 EDT 2024
% Result : Theorem 0.74s 0.60s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 71 ( 64 unt; 0 def)
% Number of atoms : 81 ( 80 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 5 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',converse_multiplicativity) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',composition_identity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',converse_idempotence) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',def_top) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',composition_distributivity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',converse_additivity) ).
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/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',maddux3_a_kind_of_de_Morgan) ).
fof(goals,conjecture,
! [X1] :
( join(X1,one) = one
=> ( join(meet(complement(composition(X1,top)),one),meet(complement(X1),one)) = meet(complement(X1),one)
& join(meet(complement(X1),one),meet(complement(composition(X1,top)),one)) = meet(complement(composition(X1,top)),one) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',goals) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.ZlTPLtOhKw/E---3.1_31688.p',maddux2_join_associativity) ).
fof(c_0_13,plain,
! [X23,X24] : converse(composition(X23,X24)) = composition(converse(X24),converse(X23)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_14,plain,
! [X16] : composition(X16,one) = X16,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_15,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_18,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,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_21,plain,
! [X4,X5] : join(X4,X5) = join(X5,X4),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_22,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X28] : zero = meet(X28,complement(X28)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_24,plain,
! [X11,X12] : meet(X11,X12) = complement(join(complement(X11),complement(X12))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_25,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_28,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,plain,
! [X27] : top = join(X27,complement(X27)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_31,plain,
! [X17,X18,X19] : composition(join(X17,X18),X19) = join(composition(X17,X19),composition(X18,X19)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
fof(c_0_32,plain,
! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_33,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_35,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
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]) ).
cnf(c_0_38,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_40,negated_conjecture,
~ ! [X1] :
( join(X1,one) = one
=> ( join(meet(complement(composition(X1,top)),one),meet(complement(X1),one)) = meet(complement(X1),one)
& join(meet(complement(X1),one),meet(complement(composition(X1,top)),one)) = meet(complement(composition(X1,top)),one) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_41,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_42,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_27]),c_0_34]) ).
cnf(c_0_43,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,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_45,plain,
composition(converse(X1),join(converse(X2),converse(X3))) = join(composition(converse(X1),converse(X2)),composition(converse(X1),converse(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_38]),c_0_39]),c_0_15]),c_0_15]),c_0_39]) ).
fof(c_0_46,negated_conjecture,
( join(esk1_0,one) = one
& ( join(meet(complement(composition(esk1_0,top)),one),meet(complement(esk1_0),one)) != meet(complement(esk1_0),one)
| join(meet(complement(esk1_0),one),meet(complement(composition(esk1_0,top)),one)) != meet(complement(composition(esk1_0,top)),one) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])]) ).
cnf(c_0_47,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_44,c_0_26]) ).
cnf(c_0_50,plain,
composition(converse(X1),join(one,converse(X2))) = join(converse(X1),composition(converse(X1),converse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_27]),c_0_16]),c_0_26]),c_0_26]) ).
cnf(c_0_51,negated_conjecture,
( join(meet(complement(composition(esk1_0,top)),one),meet(complement(esk1_0),one)) != meet(complement(esk1_0),one)
| join(meet(complement(esk1_0),one),meet(complement(composition(esk1_0,top)),one)) != meet(complement(composition(esk1_0,top)),one) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,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_49,c_0_42]),c_0_36]),c_0_43]),c_0_26]) ).
cnf(c_0_54,negated_conjecture,
join(esk1_0,one) = one,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_55,plain,
composition(X1,join(one,converse(X2))) = join(X1,composition(X1,converse(X2))),
inference(spm,[status(thm)],[c_0_50,c_0_19]) ).
cnf(c_0_56,plain,
join(composition(X1,X2),composition(complement(X1),X2)) = composition(top,X2),
inference(spm,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_57,negated_conjecture,
( join(complement(join(complement(complement(composition(esk1_0,top))),complement(one))),complement(join(complement(complement(esk1_0)),complement(one)))) != complement(join(complement(complement(esk1_0)),complement(one)))
| join(complement(join(complement(complement(esk1_0)),complement(one))),complement(join(complement(complement(composition(esk1_0,top))),complement(one)))) != complement(join(complement(complement(composition(esk1_0,top))),complement(one))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]) ).
cnf(c_0_58,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_26]),c_0_47]) ).
cnf(c_0_60,negated_conjecture,
join(X1,composition(esk1_0,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_54]),c_0_34]),c_0_26]),c_0_34]) ).
cnf(c_0_61,plain,
composition(X1,join(one,X2)) = join(X1,composition(X1,X2)),
inference(spm,[status(thm)],[c_0_55,c_0_19]) ).
cnf(c_0_62,plain,
join(X1,composition(complement(one),X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_56,c_0_34]) ).
cnf(c_0_63,negated_conjecture,
( join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top)))))) != complement(join(complement(one),complement(complement(composition(esk1_0,top)))))
| join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top)))))) != complement(join(complement(one),complement(complement(esk1_0)))) ),
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)],[c_0_57,c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]) ).
cnf(c_0_64,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_53,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
join(X1,join(X2,composition(esk1_0,X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
join(X1,composition(X1,complement(one))) = composition(X1,top),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_16]),c_0_16]) ).
cnf(c_0_67,negated_conjecture,
( join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top)))) != complement(join(complement(one),composition(esk1_0,top)))
| join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top)))) != complement(join(esk1_0,complement(one))) ),
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_63,c_0_64]),c_0_64]),c_0_64]),c_0_64]),c_0_26]),c_0_26]),c_0_26]) ).
cnf(c_0_68,negated_conjecture,
join(complement(one),composition(esk1_0,top)) = join(esk1_0,complement(one)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_42,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_68]),c_0_68]),c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL027+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:29:03 EDT 2024
% 0.14/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.ZlTPLtOhKw/E---3.1_31688.p
% 0.74/0.60 # Version: 3.1.0
% 0.74/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.74/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.74/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.74/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.74/0.60 # Starting sh5l with 300s (1) cores
% 0.74/0.60 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31813 completed with status 0
% 0.74/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.74/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.74/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.74/0.60 # No SInE strategy applied
% 0.74/0.60 # Search class: FUHPM-FFSF21-DFFFFFNN
% 0.74/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.74/0.60 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 811s (1) cores
% 0.74/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.74/0.60 # Starting new_bool_3 with 136s (1) cores
% 0.74/0.60 # Starting new_bool_1 with 136s (1) cores
% 0.74/0.60 # Starting sh5l with 136s (1) cores
% 0.74/0.60 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 31820 completed with status 0
% 0.74/0.60 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.74/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.74/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.74/0.60 # No SInE strategy applied
% 0.74/0.60 # Search class: FUHPM-FFSF21-DFFFFFNN
% 0.74/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.74/0.60 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 811s (1) cores
% 0.74/0.60 # Preprocessing time : 0.001 s
% 0.74/0.60
% 0.74/0.60 # Proof found!
% 0.74/0.60 # SZS status Theorem
% 0.74/0.60 # SZS output start CNFRefutation
% See solution above
% 0.74/0.60 # Parsed axioms : 14
% 0.74/0.60 # Removed by relevancy pruning/SinE : 0
% 0.74/0.60 # Initial clauses : 15
% 0.74/0.60 # Removed in clause preprocessing : 1
% 0.74/0.60 # Initial clauses in saturation : 14
% 0.74/0.60 # Processed clauses : 1278
% 0.74/0.60 # ...of these trivial : 729
% 0.74/0.60 # ...subsumed : 210
% 0.74/0.60 # ...remaining for further processing : 339
% 0.74/0.60 # Other redundant clauses eliminated : 0
% 0.74/0.60 # Clauses deleted for lack of memory : 0
% 0.74/0.60 # Backward-subsumed : 0
% 0.74/0.60 # Backward-rewritten : 96
% 0.74/0.60 # Generated clauses : 19725
% 0.74/0.60 # ...of the previous two non-redundant : 8876
% 0.74/0.60 # ...aggressively subsumed : 0
% 0.74/0.60 # Contextual simplify-reflections : 0
% 0.74/0.60 # Paramodulations : 19725
% 0.74/0.60 # Factorizations : 0
% 0.74/0.60 # NegExts : 0
% 0.74/0.60 # Equation resolutions : 0
% 0.74/0.60 # Disequality decompositions : 0
% 0.74/0.60 # Total rewrite steps : 34337
% 0.74/0.60 # ...of those cached : 29274
% 0.74/0.60 # Propositional unsat checks : 0
% 0.74/0.60 # Propositional check models : 0
% 0.74/0.60 # Propositional check unsatisfiable : 0
% 0.74/0.60 # Propositional clauses : 0
% 0.74/0.60 # Propositional clauses after purity: 0
% 0.74/0.60 # Propositional unsat core size : 0
% 0.74/0.60 # Propositional preprocessing time : 0.000
% 0.74/0.60 # Propositional encoding time : 0.000
% 0.74/0.60 # Propositional solver time : 0.000
% 0.74/0.60 # Success case prop preproc time : 0.000
% 0.74/0.60 # Success case prop encoding time : 0.000
% 0.74/0.60 # Success case prop solver time : 0.000
% 0.74/0.60 # Current number of processed clauses : 243
% 0.74/0.60 # Positive orientable unit clauses : 238
% 0.74/0.60 # Positive unorientable unit clauses: 4
% 0.74/0.60 # Negative unit clauses : 0
% 0.74/0.60 # Non-unit-clauses : 1
% 0.74/0.60 # Current number of unprocessed clauses: 7435
% 0.74/0.60 # ...number of literals in the above : 7435
% 0.74/0.60 # Current number of archived formulas : 0
% 0.74/0.60 # Current number of archived clauses : 97
% 0.74/0.60 # Clause-clause subsumption calls (NU) : 2
% 0.74/0.60 # Rec. Clause-clause subsumption calls : 2
% 0.74/0.60 # Non-unit clause-clause subsumptions : 1
% 0.74/0.60 # Unit Clause-clause subsumption calls : 17
% 0.74/0.60 # Rewrite failures with RHS unbound : 0
% 0.74/0.60 # BW rewrite match attempts : 1063
% 0.74/0.60 # BW rewrite match successes : 265
% 0.74/0.60 # Condensation attempts : 0
% 0.74/0.60 # Condensation successes : 0
% 0.74/0.60 # Termbank termtop insertions : 198666
% 0.74/0.60 # Search garbage collected termcells : 38
% 0.74/0.60
% 0.74/0.60 # -------------------------------------------------
% 0.74/0.60 # User time : 0.103 s
% 0.74/0.60 # System time : 0.008 s
% 0.74/0.60 # Total time : 0.111 s
% 0.74/0.60 # Maximum resident set size: 1688 pages
% 0.74/0.60
% 0.74/0.60 # -------------------------------------------------
% 0.74/0.60 # User time : 0.508 s
% 0.74/0.60 # System time : 0.018 s
% 0.74/0.60 # Total time : 0.526 s
% 0.74/0.60 # Maximum resident set size: 1692 pages
% 0.74/0.60 % E---3.1 exiting
% 0.74/0.60 % E exiting
%------------------------------------------------------------------------------