TSTP Solution File: REL018+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : REL018+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 : 600s
% DateTime : Mon Jul 18 19:19:20 EDT 2022
% Result : Theorem 0.16s 1.35s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 13
% Syntax : Number of formulae : 100 ( 97 unt; 0 def)
% Number of atoms : 103 ( 102 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 8 ( 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 : 118 ( 6 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
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/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_top) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(goals,conjecture,
! [X1] :
( composition(X1,top) = X1
=> composition(complement(X1),top) = complement(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(c_0_13,plain,
! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_14,plain,
! [X2] : converse(converse(X2)) = X2,
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,
! [X2] : composition(X2,one) = X2,
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,
! [X2] : zero = meet(X2,complement(X2)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_21,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
fof(c_0_22,plain,
! [X3,X4] : join(composition(converse(X3),complement(composition(X3,X4))),complement(X4)) = complement(X4),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_23,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
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]) ).
fof(c_0_25,plain,
! [X3,X4] : X3 = join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
cnf(c_0_26,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X2] : top = join(X2,complement(X2)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_29,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_32,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X4,X5,X6] : join(X4,join(X5,X6)) = join(join(X4,X5),X6),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_34,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_38,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_39,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_31]),c_0_37]) ).
cnf(c_0_42,plain,
join(complement(X1),complement(join(complement(X1),join(complement(X2),complement(join(complement(X1),X2)))))) = join(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_38]),c_0_30]),c_0_39]),c_0_30]) ).
cnf(c_0_43,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_38,c_0_35]),c_0_40]),c_0_41]),c_0_30]) ).
cnf(c_0_44,plain,
join(zero,complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_41]),c_0_41]),c_0_35]),c_0_40]),c_0_30]) ).
cnf(c_0_45,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_46,plain,
! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_47,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_35,c_0_39]) ).
cnf(c_0_48,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_45]) ).
cnf(c_0_49,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_50,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_35]) ).
cnf(c_0_51,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_49,c_0_16]) ).
cnf(c_0_52,plain,
join(zero,composition(converse(X1),complement(composition(X1,top)))) = zero,
inference(spm,[status(thm)],[c_0_36,c_0_40]) ).
cnf(c_0_53,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_54,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_30,c_0_50]) ).
cnf(c_0_55,plain,
join(X1,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_56,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_49,c_0_16]) ).
fof(c_0_57,negated_conjecture,
~ ! [X1] :
( composition(X1,top) = X1
=> composition(complement(X1),top) = complement(X1) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_58,plain,
! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_59,plain,
composition(converse(X1),complement(composition(X1,top))) = zero,
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
join(X1,zero) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_48]),c_0_45]),c_0_35]),c_0_40]) ).
cnf(c_0_62,plain,
join(converse(zero),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_53]),c_0_16]) ).
fof(c_0_63,negated_conjecture,
( composition(esk1_0,top) = esk1_0
& composition(complement(esk1_0),top) != complement(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_57])])]) ).
cnf(c_0_64,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_65,plain,
composition(top,complement(composition(top,top))) = zero,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
composition(X1,complement(composition(converse(X1),top))) = zero,
inference(spm,[status(thm)],[c_0_59,c_0_16]) ).
cnf(c_0_67,plain,
converse(zero) = zero,
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
composition(esk1_0,top) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_69,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_64,c_0_65]),c_0_53]),c_0_54]),c_0_65]) ).
cnf(c_0_70,plain,
composition(converse(complement(composition(X1,top))),X1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_66]),c_0_67]),c_0_16]) ).
cnf(c_0_71,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_72,negated_conjecture,
composition(join(esk1_0,X1),top) = join(esk1_0,composition(X1,top)),
inference(spm,[status(thm)],[c_0_64,c_0_68]) ).
cnf(c_0_73,plain,
complement(composition(top,top)) = zero,
inference(spm,[status(thm)],[c_0_37,c_0_69]) ).
cnf(c_0_74,negated_conjecture,
composition(join(X1,esk1_0),top) = join(esk1_0,composition(X1,top)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_68]),c_0_30]) ).
cnf(c_0_75,plain,
join(complement(X1),composition(complement(composition(X1,top)),top)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_70]),c_0_16]),c_0_71]) ).
cnf(c_0_76,negated_conjecture,
join(esk1_0,composition(complement(esk1_0),top)) = composition(top,top),
inference(spm,[status(thm)],[c_0_72,c_0_35]) ).
cnf(c_0_77,plain,
composition(top,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_73]),c_0_61]) ).
cnf(c_0_78,negated_conjecture,
composition(converse(join(X1,esk1_0)),complement(join(esk1_0,composition(X1,top)))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_74]),c_0_40]),c_0_40]),c_0_53]) ).
cnf(c_0_79,plain,
join(X1,composition(complement(composition(complement(X1),top)),top)) = X1,
inference(spm,[status(thm)],[c_0_75,c_0_45]) ).
cnf(c_0_80,negated_conjecture,
join(esk1_0,composition(complement(esk1_0),top)) = top,
inference(rw,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
join(complement(converse(X1)),composition(X2,complement(converse(composition(X1,X2))))) = complement(converse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_15]),c_0_16]) ).
cnf(c_0_82,negated_conjecture,
composition(converse(join(esk1_0,complement(composition(complement(esk1_0),top)))),complement(esk1_0)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_30]) ).
cnf(c_0_83,negated_conjecture,
join(esk1_0,join(composition(complement(esk1_0),top),X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_80]),c_0_54]) ).
cnf(c_0_84,negated_conjecture,
join(composition(complement(esk1_0),top),complement(join(esk1_0,complement(composition(complement(esk1_0),top))))) = complement(join(esk1_0,complement(composition(complement(esk1_0),top)))),
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_81,c_0_82]),c_0_16]),c_0_67]),c_0_71]),c_0_16]),c_0_30]) ).
cnf(c_0_85,negated_conjecture,
join(zero,composition(converse(esk1_0),complement(esk1_0))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_68]),c_0_40]),c_0_40]) ).
cnf(c_0_86,plain,
join(complement(join(X1,complement(X2))),complement(join(complement(X2),complement(X1)))) = X2,
inference(spm,[status(thm)],[c_0_38,c_0_30]) ).
cnf(c_0_87,negated_conjecture,
join(esk1_0,complement(join(esk1_0,complement(composition(complement(esk1_0),top))))) = top,
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,negated_conjecture,
composition(converse(esk1_0),complement(esk1_0)) = zero,
inference(rw,[status(thm)],[c_0_85,c_0_53]) ).
cnf(c_0_89,negated_conjecture,
complement(join(complement(esk1_0),complement(join(esk1_0,complement(composition(complement(esk1_0),top)))))) = join(esk1_0,complement(composition(complement(esk1_0),top))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_40]),c_0_53]),c_0_30]) ).
cnf(c_0_90,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_30]),c_0_39]) ).
cnf(c_0_91,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_35]),c_0_54]) ).
cnf(c_0_92,negated_conjecture,
composition(converse(complement(esk1_0)),esk1_0) = converse(zero),
inference(spm,[status(thm)],[c_0_18,c_0_88]) ).
cnf(c_0_93,negated_conjecture,
join(esk1_0,complement(composition(complement(esk1_0),top))) = 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(spm,[status(thm)],[c_0_38,c_0_89]),c_0_45]),c_0_90]),c_0_91]),c_0_40]),c_0_39]),c_0_61]) ).
cnf(c_0_94,negated_conjecture,
composition(converse(complement(esk1_0)),esk1_0) = zero,
inference(rw,[status(thm)],[c_0_92,c_0_67]) ).
cnf(c_0_95,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_39,c_0_48]) ).
cnf(c_0_96,negated_conjecture,
join(complement(esk1_0),complement(join(complement(esk1_0),complement(composition(complement(esk1_0),top))))) = composition(complement(esk1_0),top),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_93]),c_0_30]) ).
cnf(c_0_97,negated_conjecture,
join(complement(esk1_0),composition(complement(esk1_0),top)) = complement(esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_94]),c_0_16]),c_0_71]) ).
cnf(c_0_98,negated_conjecture,
composition(complement(esk1_0),top) != complement(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_98]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : REL018+1 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.09 % Command : run_ET %s %d
% 0.08/0.29 % Computer : n004.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Fri Jul 8 09:30:07 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.16/1.35 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.16/1.35 # Preprocessing time : 0.013 s
% 0.16/1.35
% 0.16/1.35 # Proof found!
% 0.16/1.35 # SZS status Theorem
% 0.16/1.35 # SZS output start CNFRefutation
% See solution above
% 0.16/1.35 # Proof object total steps : 100
% 0.16/1.35 # Proof object clause steps : 73
% 0.16/1.35 # Proof object formula steps : 27
% 0.16/1.35 # Proof object conjectures : 23
% 0.16/1.35 # Proof object clause conjectures : 20
% 0.16/1.35 # Proof object formula conjectures : 3
% 0.16/1.35 # Proof object initial clauses used : 14
% 0.16/1.35 # Proof object initial formulas used : 13
% 0.16/1.35 # Proof object generating inferences : 49
% 0.16/1.35 # Proof object simplifying inferences : 66
% 0.16/1.35 # Training examples: 0 positive, 0 negative
% 0.16/1.35 # Parsed axioms : 14
% 0.16/1.35 # Removed by relevancy pruning/SinE : 0
% 0.16/1.35 # Initial clauses : 15
% 0.16/1.35 # Removed in clause preprocessing : 1
% 0.16/1.35 # Initial clauses in saturation : 14
% 0.16/1.35 # Processed clauses : 504
% 0.16/1.35 # ...of these trivial : 211
% 0.16/1.35 # ...subsumed : 30
% 0.16/1.35 # ...remaining for further processing : 263
% 0.16/1.35 # Other redundant clauses eliminated : 0
% 0.16/1.35 # Clauses deleted for lack of memory : 0
% 0.16/1.35 # Backward-subsumed : 0
% 0.16/1.35 # Backward-rewritten : 123
% 0.16/1.35 # Generated clauses : 5550
% 0.16/1.35 # ...of the previous two non-trivial : 3755
% 0.16/1.35 # Contextual simplify-reflections : 0
% 0.16/1.35 # Paramodulations : 5550
% 0.16/1.35 # Factorizations : 0
% 0.16/1.35 # Equation resolutions : 0
% 0.16/1.35 # Current number of processed clauses : 140
% 0.16/1.35 # Positive orientable unit clauses : 136
% 0.16/1.35 # Positive unorientable unit clauses: 3
% 0.16/1.35 # Negative unit clauses : 1
% 0.16/1.35 # Non-unit-clauses : 0
% 0.16/1.35 # Current number of unprocessed clauses: 2391
% 0.16/1.35 # ...number of literals in the above : 2391
% 0.16/1.35 # Current number of archived formulas : 0
% 0.16/1.35 # Current number of archived clauses : 124
% 0.16/1.35 # Clause-clause subsumption calls (NU) : 0
% 0.16/1.35 # Rec. Clause-clause subsumption calls : 0
% 0.16/1.35 # Non-unit clause-clause subsumptions : 0
% 0.16/1.35 # Unit Clause-clause subsumption calls : 6
% 0.16/1.35 # Rewrite failures with RHS unbound : 0
% 0.16/1.35 # BW rewrite match attempts : 501
% 0.16/1.35 # BW rewrite match successes : 80
% 0.16/1.35 # Condensation attempts : 0
% 0.16/1.35 # Condensation successes : 0
% 0.16/1.35 # Termbank termtop insertions : 88608
% 0.16/1.35
% 0.16/1.35 # -------------------------------------------------
% 0.16/1.35 # User time : 0.074 s
% 0.16/1.35 # System time : 0.007 s
% 0.16/1.35 # Total time : 0.081 s
% 0.16/1.35 # Maximum resident set size: 7040 pages
% 0.16/23.34 eprover: CPU time limit exceeded, terminating
% 0.16/23.34 eprover: CPU time limit exceeded, terminating
% 0.16/23.36 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.36 eprover: No such file or directory
% 0.16/23.36 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.36 eprover: No such file or directory
% 0.16/23.36 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.36 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.36 eprover: No such file or directory
% 0.16/23.36 eprover: No such file or directory
% 0.16/23.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.37 eprover: No such file or directory
% 0.16/23.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.37 eprover: No such file or directory
% 0.16/23.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.37 eprover: No such file or directory
% 0.16/23.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.37 eprover: No such file or directory
% 0.16/23.38 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.38 eprover: No such file or directory
% 0.16/23.38 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.38 eprover: No such file or directory
% 0.16/23.38 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.38 eprover: No such file or directory
% 0.16/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.39 eprover: No such file or directory
% 0.16/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.39 eprover: No such file or directory
% 0.16/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.39 eprover: No such file or directory
% 0.16/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.39 eprover: No such file or directory
% 0.16/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.40 eprover: No such file or directory
% 0.16/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.40 eprover: No such file or directory
% 0.16/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.40 eprover: No such file or directory
% 0.16/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.40 eprover: No such file or directory
% 0.16/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.41 eprover: No such file or directory
% 0.16/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.41 eprover: No such file or directory
% 0.16/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.41 eprover: No such file or directory
%------------------------------------------------------------------------------