TSTP Solution File: REL041+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : REL041+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:20:11 EDT 2022
% Result : Theorem 0.35s 23.54s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of formulae : 95 ( 92 unt; 0 def)
% Number of atoms : 98 ( 97 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 : 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 : 129 ( 4 sgn 58 !; 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(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/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/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(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(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(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(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(goals,conjecture,
! [X1] :
( join(composition(converse(X1),X1),one) = one
=> ! [X2] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(composition_associativity,axiom,
! [X1,X2,X3] : composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_associativity) ).
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/benchmark/Axioms/REL001+1.ax',dedekind_law) ).
fof(c_0_14,plain,
! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_15,plain,
! [X2] : composition(X2,one) = X2,
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,
! [X2] : converse(converse(X2)) = X2,
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,
! [X3,X4] : join(composition(converse(X3),complement(composition(X3,X4))),complement(X4)) = complement(X4),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_22,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
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,
! [X2] : zero = meet(X2,complement(X2)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_25,plain,
! [X3,X4] : meet(X3,X4) = complement(join(complement(X3),complement(X4))),
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]) ).
cnf(c_0_31,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_32,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_33,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_34,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]) ).
fof(c_0_35,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_36,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28]),c_0_32]) ).
cnf(c_0_37,plain,
complement(join(zero,complement(zero))) = zero,
inference(spm,[status(thm)],[c_0_33,c_0_33]) ).
cnf(c_0_38,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_42,plain,
join(complement(one),composition(converse(X1),complement(X1))) = complement(one),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_43,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_36]),c_0_33]),c_0_27]) ).
fof(c_0_45,plain,
! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_46,plain,
join(complement(one),complement(one)) = complement(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_28]),c_0_32]) ).
cnf(c_0_47,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,plain,
join(zero,complement(complement(one))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_46]),c_0_33]),c_0_27]) ).
cnf(c_0_50,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_44,c_0_47]) ).
fof(c_0_51,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_52,plain,
join(converse(zero),converse(complement(complement(one)))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_28]) ).
fof(c_0_53,negated_conjecture,
~ ! [X1] :
( join(composition(converse(X1),X1),one) = one
=> ! [X2] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_54,plain,
complement(join(X1,complement(X1))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_50]),c_0_27]) ).
cnf(c_0_55,plain,
join(complement(one),composition(converse(complement(X1)),X1)) = complement(one),
inference(spm,[status(thm)],[c_0_42,c_0_50]) ).
cnf(c_0_56,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,plain,
join(one,converse(zero)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_50]),c_0_28]),c_0_27]) ).
fof(c_0_58,negated_conjecture,
( join(composition(converse(esk1_0),esk1_0),one) = one
& meet(composition(esk1_0,esk2_0),composition(esk1_0,complement(esk2_0))) != zero ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_53])])])])]) ).
cnf(c_0_59,plain,
join(X1,complement(X1)) = complement(zero),
inference(spm,[status(thm)],[c_0_50,c_0_54]) ).
cnf(c_0_60,plain,
join(complement(one),converse(complement(one))) = complement(one),
inference(spm,[status(thm)],[c_0_55,c_0_17]) ).
cnf(c_0_61,plain,
join(X1,composition(converse(zero),X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_32]),c_0_32]) ).
cnf(c_0_62,negated_conjecture,
join(composition(converse(esk1_0),esk1_0),one) = one,
inference(split_conjunct,[status(thm)],[c_0_58]) ).
fof(c_0_63,plain,
! [X4,X5,X6] : composition(X4,composition(X5,X6)) = composition(composition(X4,X5),X6),
inference(variable_rename,[status(thm)],[composition_associativity]) ).
cnf(c_0_64,plain,
converse(complement(zero)) = join(converse(X1),converse(complement(X1))),
inference(spm,[status(thm)],[c_0_48,c_0_59]) ).
cnf(c_0_65,plain,
converse(complement(one)) = complement(one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_60]),c_0_20]),c_0_27]),c_0_60]) ).
cnf(c_0_66,plain,
join(X1,composition(converse(X2),complement(composition(X2,complement(X1))))) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_50]) ).
cnf(c_0_67,plain,
composition(converse(zero),zero) = zero,
inference(spm,[status(thm)],[c_0_47,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
join(one,composition(converse(esk1_0),esk1_0)) = one,
inference(rw,[status(thm)],[c_0_62,c_0_27]) ).
cnf(c_0_69,plain,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_70,plain,
converse(complement(zero)) = complement(zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_28]),c_0_59]) ).
cnf(c_0_71,plain,
composition(converse(X1),complement(composition(X1,complement(zero)))) = zero,
inference(spm,[status(thm)],[c_0_47,c_0_66]) ).
cnf(c_0_72,plain,
converse(zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_67]),c_0_20]),c_0_67]) ).
cnf(c_0_73,negated_conjecture,
join(X1,composition(converse(esk1_0),composition(esk1_0,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_68]),c_0_69]),c_0_32]),c_0_32]) ).
cnf(c_0_74,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_50]) ).
cnf(c_0_75,plain,
join(converse(X1),converse(complement(X1))) = complement(zero),
inference(rw,[status(thm)],[c_0_64,c_0_70]) ).
cnf(c_0_76,plain,
join(composition(zero,X1),composition(X2,X1)) = composition(X2,X1),
inference(spm,[status(thm)],[c_0_56,c_0_47]) ).
cnf(c_0_77,plain,
composition(converse(complement(composition(X1,complement(zero)))),X1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_71]),c_0_72]),c_0_20]) ).
cnf(c_0_78,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_47]) ).
fof(c_0_79,plain,
! [X4,X5,X6] : join(meet(composition(X4,X5),X6),composition(meet(X4,composition(X6,converse(X5))),meet(X5,composition(converse(X4),X6)))) = composition(meet(X4,composition(X6,converse(X5))),meet(X5,composition(converse(X4),X6))),
inference(variable_rename,[status(thm)],[dedekind_law]) ).
cnf(c_0_80,negated_conjecture,
join(X1,join(composition(converse(esk1_0),composition(esk1_0,X1)),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_39,c_0_73]) ).
cnf(c_0_81,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_39,c_0_74]) ).
cnf(c_0_82,plain,
join(X1,converse(complement(converse(X1)))) = complement(zero),
inference(spm,[status(thm)],[c_0_75,c_0_20]) ).
cnf(c_0_83,plain,
composition(zero,X1) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]) ).
cnf(c_0_84,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_79]) ).
cnf(c_0_85,negated_conjecture,
join(X1,complement(composition(converse(esk1_0),composition(esk1_0,X1)))) = join(X1,complement(zero)),
inference(spm,[status(thm)],[c_0_80,c_0_59]) ).
cnf(c_0_86,plain,
join(X1,complement(zero)) = complement(zero),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
composition(converse(X1),zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_83]),c_0_72]),c_0_72]) ).
cnf(c_0_88,negated_conjecture,
meet(composition(esk1_0,esk2_0),composition(esk1_0,complement(esk2_0))) != zero,
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_89,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_84,c_0_30]),c_0_30]),c_0_30]),c_0_30]),c_0_30]) ).
cnf(c_0_90,negated_conjecture,
join(X1,complement(composition(converse(esk1_0),composition(esk1_0,X1)))) = complement(zero),
inference(rw,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
composition(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_87,c_0_20]) ).
cnf(c_0_92,negated_conjecture,
complement(join(complement(composition(esk1_0,esk2_0)),complement(composition(esk1_0,complement(esk2_0))))) != zero,
inference(rw,[status(thm)],[c_0_88,c_0_30]) ).
cnf(c_0_93,negated_conjecture,
complement(join(complement(composition(esk1_0,X1)),complement(composition(esk1_0,complement(X1))))) = 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(spm,[status(thm)],[c_0_89,c_0_90]),c_0_69]),c_0_50]),c_0_91]),c_0_78]),c_0_69]),c_0_50]),c_0_91]) ).
cnf(c_0_94,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL041+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 13:02:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.35/23.41 eprover: CPU time limit exceeded, terminating
% 0.35/23.41 eprover: CPU time limit exceeded, terminating
% 0.35/23.41 eprover: CPU time limit exceeded, terminating
% 0.35/23.41 eprover: CPU time limit exceeded, terminating
% 0.35/23.54 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.35/23.54
% 0.35/23.54 # Failure: Resource limit exceeded (time)
% 0.35/23.54 # OLD status Res
% 0.35/23.54 # Preprocessing time : 0.015 s
% 0.35/23.54 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.35/23.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.35/23.54 # Preprocessing time : 0.007 s
% 0.35/23.54
% 0.35/23.54 # Proof found!
% 0.35/23.54 # SZS status Theorem
% 0.35/23.54 # SZS output start CNFRefutation
% See solution above
% 0.35/23.54 # Proof object total steps : 95
% 0.35/23.54 # Proof object clause steps : 66
% 0.35/23.54 # Proof object formula steps : 29
% 0.35/23.54 # Proof object conjectures : 13
% 0.35/23.54 # Proof object clause conjectures : 10
% 0.35/23.54 # Proof object formula conjectures : 3
% 0.35/23.54 # Proof object initial clauses used : 15
% 0.35/23.54 # Proof object initial formulas used : 14
% 0.35/23.54 # Proof object generating inferences : 38
% 0.35/23.54 # Proof object simplifying inferences : 53
% 0.35/23.54 # Training examples: 0 positive, 0 negative
% 0.35/23.54 # Parsed axioms : 17
% 0.35/23.54 # Removed by relevancy pruning/SinE : 1
% 0.35/23.54 # Initial clauses : 17
% 0.35/23.54 # Removed in clause preprocessing : 1
% 0.35/23.54 # Initial clauses in saturation : 16
% 0.35/23.54 # Processed clauses : 197
% 0.35/23.54 # ...of these trivial : 50
% 0.35/23.54 # ...subsumed : 0
% 0.35/23.54 # ...remaining for further processing : 147
% 0.35/23.54 # Other redundant clauses eliminated : 0
% 0.35/23.54 # Clauses deleted for lack of memory : 0
% 0.35/23.54 # Backward-subsumed : 0
% 0.35/23.54 # Backward-rewritten : 95
% 0.35/23.54 # Generated clauses : 1898
% 0.35/23.54 # ...of the previous two non-trivial : 1234
% 0.35/23.54 # Contextual simplify-reflections : 0
% 0.35/23.54 # Paramodulations : 1898
% 0.35/23.54 # Factorizations : 0
% 0.35/23.54 # Equation resolutions : 0
% 0.35/23.54 # Current number of processed clauses : 52
% 0.35/23.54 # Positive orientable unit clauses : 51
% 0.35/23.54 # Positive unorientable unit clauses: 1
% 0.35/23.54 # Negative unit clauses : 0
% 0.35/23.54 # Non-unit-clauses : 0
% 0.35/23.54 # Current number of unprocessed clauses: 300
% 0.35/23.54 # ...number of literals in the above : 300
% 0.35/23.54 # Current number of archived formulas : 0
% 0.35/23.54 # Current number of archived clauses : 96
% 0.35/23.54 # Clause-clause subsumption calls (NU) : 0
% 0.35/23.54 # Rec. Clause-clause subsumption calls : 0
% 0.35/23.54 # Non-unit clause-clause subsumptions : 0
% 0.35/23.54 # Unit Clause-clause subsumption calls : 0
% 0.35/23.54 # Rewrite failures with RHS unbound : 1
% 0.35/23.54 # BW rewrite match attempts : 404
% 0.35/23.54 # BW rewrite match successes : 75
% 0.35/23.54 # Condensation attempts : 0
% 0.35/23.54 # Condensation successes : 0
% 0.35/23.54 # Termbank termtop insertions : 42962
% 0.35/23.54
% 0.35/23.54 # -------------------------------------------------
% 0.35/23.54 # User time : 0.026 s
% 0.35/23.54 # System time : 0.002 s
% 0.35/23.54 # Total time : 0.028 s
% 0.35/23.54 # Maximum resident set size: 4664 pages
% 0.35/46.43 eprover: CPU time limit exceeded, terminating
% 0.35/46.43 eprover: CPU time limit exceeded, terminating
% 0.35/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.44 eprover: No such file or directory
% 0.35/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.45 eprover: No such file or directory
% 0.35/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.45 eprover: No such file or directory
% 0.35/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.45 eprover: No such file or directory
% 0.35/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.45 eprover: No such file or directory
% 0.35/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.45 eprover: No such file or directory
% 0.35/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.46 eprover: No such file or directory
% 0.35/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.46 eprover: No such file or directory
% 0.35/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.46 eprover: No such file or directory
% 0.35/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.47 eprover: No such file or directory
% 0.35/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.47 eprover: No such file or directory
% 0.35/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.47 eprover: No such file or directory
% 0.35/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.47 eprover: No such file or directory
% 0.35/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.47 eprover: No such file or directory
% 0.35/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.35/46.48 eprover: No such file or directory
% 0.35/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.48 eprover: No such file or directory
% 0.35/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.48 eprover: No such file or directory
% 0.35/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.49 eprover: No such file or directory
% 0.35/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.50 eprover: No such file or directory
% 0.35/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.35/46.50 eprover: No such file or directory
%------------------------------------------------------------------------------