%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL011+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:03:53 PM UTC 2026
% Result : Theorem 0.15s 5.63s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 78 ( 75 unt; 0 def)
% Number of atoms : 81 ( 80 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 : 109 ( 6 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',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/sandbox/benchmark/Axioms/REL001+0.ax',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/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( meet(X1,composition(converse(X2),X3)) = zero
=> meet(composition(X2,X1),X3) = zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/Axioms/REL001+1.ax',dedekind_law) ).
fof(c_0_14,plain,
! [X23,X24] : converse(composition(X23,X24)) = composition(converse(X24),converse(X23)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_15,plain,
! [X16] : composition(X16,one) = X16,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_16,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_19,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,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_22,plain,
! [X4,X5] : join(X4,X5) = join(X5,X4),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_23,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_24,plain,
! [X28] : zero = meet(X28,complement(X28)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_25,plain,
! [X11,X12] : meet(X11,X12) = complement(join(complement(X11),complement(X12))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_26,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_29,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_31,plain,
! [X27] : top = join(X27,complement(X27)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_32,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_34,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_36,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_37,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_38,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28]),c_0_33]) ).
cnf(c_0_39,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_40,c_0_27]) ).
cnf(c_0_44,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,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_43,c_0_38]),c_0_35]),c_0_39]),c_0_27]) ).
cnf(c_0_46,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_47]) ).
fof(c_0_49,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_50,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_41,c_0_48]) ).
fof(c_0_51,plain,
! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_52,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_50,c_0_35]) ).
cnf(c_0_54,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
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(composition(X1,X2),composition(top,X2)) = composition(top,X2),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
join(converse(X1),converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_54,c_0_53]) ).
fof(c_0_58,negated_conjecture,
( meet(composition(esk2_0,esk1_0),esk3_0) != zero
& meet(esk1_0,composition(converse(esk2_0),esk3_0)) = zero ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_55])])])]) ).
cnf(c_0_59,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_27,c_0_53]) ).
cnf(c_0_60,plain,
join(X1,composition(top,X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_56,c_0_33]) ).
cnf(c_0_61,plain,
join(X1,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_57,c_0_20]) ).
fof(c_0_62,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]) ).
cnf(c_0_63,negated_conjecture,
meet(esk1_0,composition(converse(esk2_0),esk3_0)) = zero,
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_64,plain,
composition(top,top) = top,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_59,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
meet(composition(esk2_0,esk1_0),esk3_0) != zero,
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_67,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_62]) ).
cnf(c_0_68,negated_conjecture,
complement(join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0)))) = zero,
inference(rw,[status(thm)],[c_0_63,c_0_30]) ).
cnf(c_0_69,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_35,c_0_46]) ).
cnf(c_0_70,plain,
composition(top,zero) = zero,
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_32,c_0_64]),c_0_39]),c_0_65]),c_0_39]),c_0_46]),c_0_39]) ).
cnf(c_0_71,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_46]) ).
cnf(c_0_72,negated_conjecture,
complement(join(complement(composition(esk2_0,esk1_0)),complement(esk3_0))) != zero,
inference(rw,[status(thm)],[c_0_66,c_0_30]) ).
cnf(c_0_73,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_67,c_0_30]),c_0_30]),c_0_30]),c_0_30]),c_0_30]) ).
cnf(c_0_74,negated_conjecture,
join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_68]),c_0_69]) ).
cnf(c_0_75,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_70]),c_0_71]) ).
cnf(c_0_76,negated_conjecture,
complement(join(complement(esk3_0),complement(composition(esk2_0,esk1_0)))) != zero,
inference(rw,[status(thm)],[c_0_72,c_0_27]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(sr,[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_73,c_0_74]),c_0_27]),c_0_39]),c_0_75]),c_0_71]),c_0_39]),c_0_75]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL011+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.54 % Computer : n011.cluster.edu
% 0.11/5.54 % Model : x86_64 x86_64
% 0.11/5.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.54 % Memory : 8046.5625MB
% 0.11/5.54 % OS : Linux 6.8.0-71-generic
% 0.11/5.54 % CPULimit : 300
% 0.11/5.54 % WCLimit : 300
% 0.11/5.54 % DateTime : Mon Sep 21 03:59:01 UTC 2026
% 0.11/5.55 % CPUTime :
% 0.11/5.55 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.59 Running first-order theorem proving
% 0.11/5.59 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/benchmark/theBenchmark.p
% 0.15/5.63 % Version: 3.5.1
% 0.15/5.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.63 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.63 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.63 % Starting sh5l with 300s (1) cores
% 0.15/5.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 927582 completed with status 0
% 0.15/5.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.63 % No SInE strategy applied
% 0.15/5.63 % Search class: FUUPM-FFMF21-DFFFFFNN
% 0.15/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.63 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.15/5.63 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.15/5.63 % Starting new_bool_3 with 136s (1) cores
% 0.15/5.63 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 927589 completed with status 0
% 0.15/5.63 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.15/5.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.63 % No SInE strategy applied
% 0.15/5.63 % Search class: FUUPM-FFMF21-DFFFFFNN
% 0.15/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.63 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.15/5.63 % Preprocessing time : 0.001 s
% 0.15/5.63
% 0.15/5.63 % Proof found!
% 0.15/5.63 % SZS status Theorem
% 0.15/5.63 % SZS output start CNFRefutation
% See solution above
% 0.15/5.63 % Parsed axioms : 17
% 0.15/5.63 % Removed by relevancy pruning/SinE : 0
% 0.15/5.63 % Initial clauses : 18
% 0.15/5.63 % Removed in clause preprocessing : 1
% 0.15/5.63 % Initial clauses in saturation : 17
% 0.15/5.63 % Processed clauses : 190
% 0.15/5.63 % ...of these trivial : 73
% 0.15/5.63 % ...subsumed : 18
% 0.15/5.63 % ...remaining for further processing : 99
% 0.15/5.63 % Other redundant clauses eliminated : 0
% 0.15/5.63 % Clauses deleted for lack of memory : 0
% 0.15/5.63 % Backward-subsumed : 0
% 0.15/5.63 % Backward-rewritten : 31
% 0.15/5.63 % Generated clauses : 2434
% 0.15/5.63 % ...of the previous two non-redundant : 1066
% 0.15/5.63 % ...aggressively subsumed : 0
% 0.15/5.63 % Contextual simplify-reflections : 0
% 0.15/5.63 % Paramodulations : 2434
% 0.15/5.63 % Factorizations : 0
% 0.15/5.63 % NegExts : 0
% 0.15/5.63 % Equation resolutions : 0
% 0.15/5.63 % Disequality decompositions : 0
% 0.15/5.63 % Total rewrite steps : 4248
% 0.15/5.63 % ...of those cached : 3442
% 0.15/5.63 % Propositional unsat checks : 0
% 0.15/5.63 % Propositional check models : 0
% 0.15/5.63 % Propositional check unsatisfiable : 0
% 0.15/5.63 % Propositional clauses : 0
% 0.15/5.63 % Propositional clauses after purity: 0
% 0.15/5.63 % Propositional unsat core size : 0
% 0.15/5.63 % Propositional preprocessing time : 0.000
% 0.15/5.63 % Propositional encoding time : 0.000
% 0.15/5.63 % Propositional solver time : 0.000
% 0.15/5.63 % Success case prop preproc time : 0.000
% 0.15/5.63 % Success case prop encoding time : 0.000
% 0.15/5.63 % Success case prop solver time : 0.000
% 0.15/5.63 % Current number of processed clauses : 68
% 0.15/5.63 % Positive orientable unit clauses : 64
% 0.15/5.63 % Positive unorientable unit clauses: 3
% 0.15/5.63 % Negative unit clauses : 1
% 0.15/5.63 % Non-unit-clauses : 0
% 0.15/5.63 % Current number of unprocessed clauses: 829
% 0.15/5.63 % ...number of literals in the above : 829
% 0.15/5.63 % Current number of archived formulas : 0
% 0.15/5.63 % Current number of archived clauses : 32
% 0.15/5.63 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.63 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.63 % Non-unit clause-clause subsumptions : 0
% 0.15/5.63 % Unit Clause-clause subsumption calls : 13
% 0.15/5.63 % Rewrite failures with RHS unbound : 0
% 0.15/5.63 % BW rewrite match attempts : 192
% 0.15/5.63 % BW rewrite match successes : 117
% 0.15/5.63 % Condensation attempts : 0
% 0.15/5.63 % Condensation successes : 0
% 0.15/5.63 % Termbank termtop insertions : 27716
% 0.15/5.63 % Search garbage collected termcells : 33
% 0.15/5.63
% 0.15/5.63 % -------------------------------------------------
% 0.15/5.63 % User time : 0.016 s
% 0.15/5.63 % System time : 0.003 s
% 0.15/5.63 % Total time : 0.019 s
% 0.15/5.63 % Maximum resident set size: 3652 pages
% 0.15/5.63
% 0.15/5.63 % -------------------------------------------------
% 0.15/5.63 % User time : 0.076 s
% 0.15/5.63 % System time : 0.017 s
% 0.15/5.63 % Total time : 0.093 s
% 0.15/5.63 % Maximum resident set size: 4608 pages
% 0.15/5.63 % E exiting
%------------------------------------------------------------------------------