%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL042+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 : n015.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:04:07 PM UTC 2026
% Result : Theorem 2.08s 0.88s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 13
% Syntax : Number of formulae : 88 ( 85 unt; 0 def)
% Number of atoms : 91 ( 90 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 139 ( 7 sgn 53 !; 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(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).
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(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(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(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(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(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] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero
=> join(composition(converse(X1),X1),one) = one ),
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_13,plain,
! [X20,X21] : converse(composition(X20,X21)) = composition(converse(X21),converse(X20)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_14,plain,
! [X33] : converse(converse(X33)) = X33,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
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,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X6] : composition(X6,one) = X6,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_18,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X37,X38] : X37 = join(complement(join(complement(X37),complement(X38))),complement(join(complement(X37),X38))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_21,plain,
! [X35,X36] : meet(X35,X36) = complement(join(complement(X35),complement(X36))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
fof(c_0_22,plain,
! [X22,X23] : join(composition(converse(X22),complement(composition(X22,X23))),complement(X23)) = complement(X23),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_23,plain,
! [X7,X8] : join(X7,X8) = join(X8,X7),
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_18,c_0_19]),c_0_16]) ).
cnf(c_0_25,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
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_19,c_0_24]) ).
fof(c_0_30,plain,
! [X34] : zero = meet(X34,complement(X34)),
inference(variable_rename,[status(thm)],[def_zero]) ).
cnf(c_0_31,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,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_33,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_29]) ).
fof(c_0_34,plain,
! [X12,X13,X14] : composition(join(X12,X13),X14) = join(composition(X12,X14),composition(X13,X14)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_35,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_28]),c_0_26]) ).
cnf(c_0_37,plain,
join(meet(X1,X2),meet(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_28]) ).
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_29]),c_0_33]) ).
cnf(c_0_39,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
meet(meet(X1,X2),join(complement(X1),complement(X2))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_26]),c_0_36]) ).
cnf(c_0_41,plain,
join(zero,meet(X1,complement(complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_42,plain,
complement(complement(X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_26,c_0_38]) ).
cnf(c_0_43,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_28]) ).
cnf(c_0_44,plain,
join(meet(X1,X2),complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_45,plain,
meet(meet(X1,X1),complement(X1)) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_46,plain,
join(zero,meet(X1,meet(X1,X1))) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
join(X1,X1) = composition(join(one,one),X1),
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
cnf(c_0_48,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_26]),c_0_46]) ).
fof(c_0_49,plain,
! [X9,X10,X11] : join(X9,join(X10,X11)) = join(join(X9,X10),X11),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_50,plain,
composition(join(one,one),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[c_0_38,c_0_47]) ).
cnf(c_0_51,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_42,c_0_48]) ).
cnf(c_0_52,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,plain,
composition(join(one,one),X1) = X1,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_38]),c_0_35]) ).
cnf(c_0_55,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_28]),c_0_52]) ).
cnf(c_0_56,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_47,c_0_53]) ).
cnf(c_0_57,plain,
join(zero,meet(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_54,c_0_42]) ).
cnf(c_0_58,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_52]),c_0_56]) ).
cnf(c_0_59,plain,
join(meet(X1,X2),meet(complement(X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_60,plain,
join(zero,X1) = X1,
inference(rw,[status(thm)],[c_0_57,c_0_48]) ).
cnf(c_0_61,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_28]) ).
cnf(c_0_62,plain,
join(meet(X1,X2),meet(complement(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_59,c_0_36]) ).
cnf(c_0_63,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
meet(complement(zero),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_60]) ).
fof(c_0_65,plain,
! [X15,X16] : converse(join(X15,X16)) = join(converse(X15),converse(X16)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
fof(c_0_66,negated_conjecture,
~ ! [X1] :
( ! [X2] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero
=> join(composition(converse(X1),X1),one) = one ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_67,plain,
join(complement(zero),X1) = complement(zero),
inference(spm,[status(thm)],[c_0_61,c_0_64]) ).
cnf(c_0_68,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_69,plain,
composition(join(X1,one),zero) = composition(X1,zero),
inference(spm,[status(thm)],[c_0_43,c_0_60]) ).
fof(c_0_70,plain,
! [X24,X25,X26] : join(meet(composition(X24,X25),X26),composition(meet(X24,composition(X26,converse(X25))),meet(X25,composition(converse(X24),X26)))) = composition(meet(X24,composition(X26,converse(X25))),meet(X25,composition(converse(X24),X26))),
inference(variable_rename,[status(thm)],[dedekind_law]) ).
fof(c_0_71,negated_conjecture,
! [X5] :
( join(composition(converse(esk1_0),esk1_0),one) != one
& meet(composition(esk1_0,X5),composition(esk1_0,complement(X5))) = zero ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_66])])])])]) ).
cnf(c_0_72,plain,
composition(join(X1,one),complement(zero)) = complement(zero),
inference(spm,[status(thm)],[c_0_43,c_0_67]) ).
cnf(c_0_73,plain,
converse(join(X1,one)) = join(one,converse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_29]),c_0_28]) ).
cnf(c_0_74,plain,
composition(join(one,X1),zero) = composition(X1,zero),
inference(spm,[status(thm)],[c_0_69,c_0_28]) ).
cnf(c_0_75,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_70]) ).
cnf(c_0_76,negated_conjecture,
meet(composition(esk1_0,X1),composition(esk1_0,complement(X1))) = zero,
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_77,plain,
composition(converse(X1),zero) = zero,
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)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_72]),c_0_51]),c_0_73]),c_0_51]),c_0_74]),c_0_43]),c_0_28]),c_0_74]),c_0_51]) ).
cnf(c_0_78,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_52,c_0_61]) ).
cnf(c_0_79,plain,
join(meet(composition(converse(X1),X2),X3),composition(meet(converse(X1),composition(X3,converse(X2))),meet(X2,composition(X1,X3)))) = composition(meet(converse(X1),composition(X3,converse(X2))),meet(X2,composition(X1,X3))),
inference(spm,[status(thm)],[c_0_75,c_0_16]) ).
cnf(c_0_80,negated_conjecture,
meet(esk1_0,composition(esk1_0,complement(one))) = zero,
inference(spm,[status(thm)],[c_0_76,c_0_19]) ).
cnf(c_0_81,plain,
composition(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_77,c_0_16]) ).
cnf(c_0_82,plain,
join(X1,zero) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_48]),c_0_35]) ).
cnf(c_0_83,negated_conjecture,
join(composition(converse(esk1_0),esk1_0),one) != one,
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_84,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_78,c_0_62]) ).
cnf(c_0_85,negated_conjecture,
meet(complement(one),composition(converse(esk1_0),esk1_0)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82]),c_0_81]),c_0_36]) ).
cnf(c_0_86,negated_conjecture,
join(one,composition(converse(esk1_0),esk1_0)) != one,
inference(rw,[status(thm)],[c_0_83,c_0_28]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_82]),c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL042+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n015.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 04:11:06 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.53 Running first-order theorem proving
% 0.19/0.54 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
% 2.08/0.88 % Version: 3.5.1
% 2.08/0.88 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.08/0.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.08/0.88 % Starting new_bool_3 with 300s (1) cores
% 2.08/0.88 % Starting new_bool_1 with 300s (1) cores
% 2.08/0.88 % Starting sh5l with 300s (1) cores
% 2.08/0.88 % new_bool_1 with pid 525590 completed with status 0
% 2.08/0.88 % Result found by new_bool_1
% 2.08/0.88 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.08/0.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.08/0.88 % Starting new_bool_3 with 300s (1) cores
% 2.08/0.88 % Starting new_bool_1 with 300s (1) cores
% 2.08/0.88 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.08/0.88 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.08/0.88 % Search class: FUUPM-FFMF21-DFFFFFNN
% 2.08/0.88 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.08/0.88 % Starting SubtermCWHack with 31s (1) cores
% 2.08/0.88 % SubtermCWHack with pid 525598 completed with status 0
% 2.08/0.88 % Result found by SubtermCWHack
% 2.08/0.88 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.08/0.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.08/0.88 % Starting new_bool_3 with 300s (1) cores
% 2.08/0.88 % Starting new_bool_1 with 300s (1) cores
% 2.08/0.88 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.08/0.88 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.08/0.88 % Search class: FUUPM-FFMF21-DFFFFFNN
% 2.08/0.88 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.08/0.88 % Starting SubtermCWHack with 31s (1) cores
% 2.08/0.88 % Preprocessing time : 0.002 s
% 2.08/0.88
% 2.08/0.88 % Proof found!
% 2.08/0.88 % SZS status Theorem
% 2.08/0.88 % SZS output start CNFRefutation
% See solution above
% 2.08/0.88 % Parsed axioms : 17
% 2.08/0.88 % Removed by relevancy pruning/SinE : 1
% 2.08/0.88 % Initial clauses : 17
% 2.08/0.88 % Removed in clause preprocessing : 0
% 2.08/0.88 % Initial clauses in saturation : 17
% 2.08/0.88 % Processed clauses : 1453
% 2.08/0.88 % ...of these trivial : 890
% 2.08/0.88 % ...subsumed : 214
% 2.08/0.88 % ...remaining for further processing : 349
% 2.08/0.88 % Other redundant clauses eliminated : 0
% 2.08/0.88 % Clauses deleted for lack of memory : 0
% 2.08/0.88 % Backward-subsumed : 0
% 2.08/0.88 % Backward-rewritten : 97
% 2.08/0.88 % Generated clauses : 22376
% 2.08/0.88 % ...of the previous two non-redundant : 9290
% 2.08/0.88 % ...aggressively subsumed : 0
% 2.08/0.88 % Contextual simplify-reflections : 0
% 2.08/0.88 % Paramodulations : 22376
% 2.08/0.88 % Factorizations : 0
% 2.08/0.88 % NegExts : 0
% 2.08/0.88 % Equation resolutions : 0
% 2.08/0.88 % Disequality decompositions : 0
% 2.08/0.88 % Total rewrite steps : 32653
% 2.08/0.88 % ...of those cached : 26541
% 2.08/0.88 % Propositional unsat checks : 0
% 2.08/0.88 % Propositional check models : 0
% 2.08/0.88 % Propositional check unsatisfiable : 0
% 2.08/0.88 % Propositional clauses : 0
% 2.08/0.88 % Propositional clauses after purity: 0
% 2.08/0.88 % Propositional unsat core size : 0
% 2.08/0.88 % Propositional preprocessing time : 0.000
% 2.08/0.88 % Propositional encoding time : 0.000
% 2.08/0.88 % Propositional solver time : 0.000
% 2.08/0.88 % Success case prop preproc time : 0.000
% 2.08/0.88 % Success case prop encoding time : 0.000
% 2.08/0.88 % Success case prop solver time : 0.000
% 2.08/0.88 % Current number of processed clauses : 252
% 2.08/0.88 % Positive orientable unit clauses : 246
% 2.08/0.88 % Positive unorientable unit clauses: 5
% 2.08/0.88 % Negative unit clauses : 1
% 2.08/0.88 % Non-unit-clauses : 0
% 2.08/0.88 % Current number of unprocessed clauses: 7527
% 2.08/0.88 % ...number of literals in the above : 7527
% 2.08/0.88 % Current number of archived formulas : 0
% 2.08/0.88 % Current number of archived clauses : 97
% 2.08/0.88 % Clause-clause subsumption calls (NU) : 0
% 2.08/0.88 % Rec. Clause-clause subsumption calls : 0
% 2.08/0.88 % Non-unit clause-clause subsumptions : 0
% 2.08/0.88 % Unit Clause-clause subsumption calls : 11
% 2.08/0.88 % Rewrite failures with RHS unbound : 0
% 2.08/0.88 % BW rewrite match attempts : 645
% 2.08/0.88 % BW rewrite match successes : 108
% 2.08/0.88 % Condensation attempts : 0
% 2.08/0.88 % Condensation successes : 0
% 2.08/0.88 % Termbank termtop insertions : 217288
% 2.08/0.88 % Search garbage collected termcells : 39
% 2.08/0.88
% 2.08/0.88 % -------------------------------------------------
% 2.08/0.88 % User time : 0.273 s
% 2.08/0.88 % System time : 0.023 s
% 2.08/0.88 % Total time : 0.296 s
% 2.08/0.88 % Maximum resident set size: 3652 pages
% 2.08/0.88
% 2.08/0.88 % -------------------------------------------------
% 2.08/0.88 % User time : 0.277 s
% 2.08/0.88 % System time : 0.029 s
% 2.08/0.88 % Total time : 0.306 s
% 2.08/0.88 % Maximum resident set size: 4608 pages
% 2.08/0.88 % E exiting
%------------------------------------------------------------------------------