TSTP Solution File: REL041+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : REL041+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:10 EDT 2022
% Result : Theorem 1.20s 209.37s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 14
% Syntax : Number of formulae : 109 ( 106 unt; 0 def)
% Number of atoms : 112 ( 111 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 : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 180 ( 12 sgn 54 !; 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(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/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/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.mepo_128.in',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(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]) ).
fof(c_0_31,plain,
! [X2] : top = join(X2,complement(X2)),
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,
! [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_37,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_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,
! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
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,
! [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,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_43]),c_0_27]) ).
cnf(c_0_54,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_55,plain,
join(converse(zero),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_52,c_0_46]) ).
cnf(c_0_56,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(pm,[status(thm)],[c_0_53,c_0_27]) ).
cnf(c_0_57,plain,
join(composition(zero,X1),composition(X2,X1)) = composition(X2,X1),
inference(spm,[status(thm)],[c_0_54,c_0_46]) ).
cnf(c_0_58,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_46]) ).
cnf(c_0_59,plain,
join(converse(zero),X1) = X1,
inference(spm,[status(thm)],[c_0_55,c_0_20]) ).
cnf(c_0_60,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_16,c_0_54]),c_0_52]),c_0_16]),c_0_16]),c_0_52]) ).
cnf(c_0_61,plain,
join(X1,join(complement(join(X2,complement(X1))),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_41,c_0_56]) ).
cnf(c_0_62,plain,
join(X1,composition(zero,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_33]),c_0_27]) ).
cnf(c_0_63,plain,
converse(zero) = zero,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_41,c_0_27]),c_0_41]) ).
cnf(c_0_65,plain,
composition(X1,join(converse(X2),converse(X3))) = join(composition(X1,converse(X2)),composition(X1,converse(X3))),
inference(spm,[status(thm)],[c_0_60,c_0_20]) ).
cnf(c_0_66,plain,
join(X1,complement(join(complement(X2),X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_43]),c_0_47]) ).
fof(c_0_67,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_68,plain,
join(converse(X1),composition(converse(X1),zero)) = converse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_62]),c_0_16]),c_0_63]) ).
fof(c_0_69,plain,
! [X4,X5,X6] : composition(X4,composition(X5,X6)) = composition(composition(X4,X5),X6),
inference(variable_rename,[status(thm)],[composition_associativity]) ).
cnf(c_0_70,plain,
join(composition(zero,X1),join(X2,composition(X3,X1))) = join(X2,composition(X3,X1)),
inference(spm,[status(thm)],[c_0_64,c_0_57]) ).
cnf(c_0_71,plain,
join(X1,composition(converse(X2),complement(composition(X2,complement(X1))))) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_47]) ).
cnf(c_0_72,plain,
composition(X1,join(converse(X2),X3)) = join(composition(X1,converse(X2)),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_65,c_0_20]) ).
cnf(c_0_73,plain,
join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_66,c_0_47]) ).
fof(c_0_74,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_67])])])])]) ).
cnf(c_0_75,plain,
join(X1,composition(X1,zero)) = X1,
inference(spm,[status(thm)],[c_0_68,c_0_20]) ).
cnf(c_0_76,plain,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_77,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_35,c_0_46]) ).
cnf(c_0_78,plain,
join(X1,composition(zero,complement(composition(X2,complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_27]) ).
cnf(c_0_79,plain,
composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_72,c_0_20]) ).
cnf(c_0_80,plain,
join(composition(X1,X2),composition(complement(join(X3,X1)),X2)) = join(composition(X1,X2),composition(complement(X3),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_73]),c_0_54]) ).
cnf(c_0_81,negated_conjecture,
join(composition(converse(esk1_0),esk1_0),one) = one,
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_82,plain,
join(composition(X1,X2),composition(X1,composition(zero,X2))) = composition(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_75]),c_0_76]) ).
cnf(c_0_83,plain,
composition(converse(X1),complement(composition(X1,top))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_71]),c_0_77]) ).
cnf(c_0_84,plain,
composition(zero,complement(composition(X1,top))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_78]),c_0_77]) ).
cnf(c_0_85,plain,
join(X1,join(composition(converse(X2),complement(composition(X2,complement(X1)))),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_41,c_0_71]) ).
cnf(c_0_86,plain,
join(composition(X1,X2),composition(X1,complement(join(X3,complement(X2))))) = composition(X1,X2),
inference(spm,[status(thm)],[c_0_79,c_0_56]) ).
cnf(c_0_87,plain,
join(X1,composition(complement(join(X2,one)),X1)) = join(X1,composition(complement(X2),X1)),
inference(spm,[status(thm)],[c_0_80,c_0_33]) ).
cnf(c_0_88,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(pm,[status(thm)],[c_0_73,c_0_27]) ).
cnf(c_0_89,negated_conjecture,
join(one,composition(converse(esk1_0),esk1_0)) = one,
inference(rw,[status(thm)],[c_0_81,c_0_27]) ).
cnf(c_0_90,plain,
composition(converse(X1),zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_46]) ).
cnf(c_0_91,plain,
join(complement(join(X1,X2)),complement(join(X1,complement(X2)))) = complement(X1),
inference(spm,[status(thm)],[c_0_43,c_0_47]) ).
cnf(c_0_92,plain,
join(X1,composition(converse(X2),complement(join(X3,composition(X2,complement(X1)))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_71]),c_0_47]) ).
cnf(c_0_93,plain,
join(X1,composition(complement(join(one,X2)),X1)) = join(X1,composition(complement(X2),X1)),
inference(pm,[status(thm)],[c_0_87,c_0_27]) ).
cnf(c_0_94,negated_conjecture,
join(one,complement(composition(converse(esk1_0),esk1_0))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_35]) ).
cnf(c_0_95,plain,
composition(zero,X1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_90]),c_0_63]),c_0_63]),c_0_20]) ).
cnf(c_0_96,plain,
join(complement(join(X1,X2)),complement(join(complement(X2),X1))) = complement(X1),
inference(pm,[status(thm)],[c_0_91,c_0_27]) ).
cnf(c_0_97,plain,
join(complement(X1),composition(converse(X2),complement(join(X3,composition(X2,X1))))) = complement(X1),
inference(spm,[status(thm)],[c_0_92,c_0_47]) ).
cnf(c_0_98,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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_39]),c_0_95]),c_0_58]),c_0_47]),c_0_76]) ).
cnf(c_0_99,negated_conjecture,
meet(composition(esk1_0,esk2_0),composition(esk1_0,complement(esk2_0))) != zero,
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_100,plain,
join(complement(join(X1,X2)),complement(join(complement(X1),X2))) = complement(X2),
inference(pm,[status(thm)],[c_0_96,c_0_27]) ).
cnf(c_0_101,negated_conjecture,
join(complement(composition(esk1_0,X1)),composition(esk1_0,complement(X1))) = complement(composition(esk1_0,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_20]) ).
cnf(c_0_102,plain,
join(composition(X1,X2),composition(X1,complement(X2))) = composition(X1,top),
inference(spm,[status(thm)],[c_0_79,c_0_35]) ).
cnf(c_0_103,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_50,c_0_35]) ).
cnf(c_0_104,negated_conjecture,
complement(join(complement(composition(esk1_0,esk2_0)),complement(composition(esk1_0,complement(esk2_0))))) != zero,
inference(rw,[status(thm)],[c_0_99,c_0_30]) ).
cnf(c_0_105,negated_conjecture,
complement(composition(esk1_0,complement(X1))) = join(composition(esk1_0,X1),complement(composition(esk1_0,top))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_47]),c_0_47]),c_0_102]) ).
cnf(c_0_106,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_41]) ).
cnf(c_0_107,plain,
join(X1,join(X2,complement(X1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_35]),c_0_103]) ).
cnf(c_0_108,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)],[inference(rw,[status(thm)],[c_0_104,c_0_105]),c_0_27]),c_0_106]),c_0_27]),c_0_107]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : REL041+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 07:11:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.32/23.39 eprover: CPU time limit exceeded, terminating
% 0.32/23.39 eprover: CPU time limit exceeded, terminating
% 0.32/23.40 eprover: CPU time limit exceeded, terminating
% 0.32/23.40 eprover: CPU time limit exceeded, terminating
% 0.42/46.41 eprover: CPU time limit exceeded, terminating
% 0.42/46.41 eprover: CPU time limit exceeded, terminating
% 0.42/46.41 eprover: CPU time limit exceeded, terminating
% 0.42/46.43 eprover: CPU time limit exceeded, terminating
% 0.54/69.42 eprover: CPU time limit exceeded, terminating
% 0.54/69.43 eprover: CPU time limit exceeded, terminating
% 0.54/69.44 eprover: CPU time limit exceeded, terminating
% 0.54/69.46 eprover: CPU time limit exceeded, terminating
% 0.66/92.44 eprover: CPU time limit exceeded, terminating
% 0.66/92.45 eprover: CPU time limit exceeded, terminating
% 0.66/92.46 eprover: CPU time limit exceeded, terminating
% 0.66/92.47 eprover: CPU time limit exceeded, terminating
% 0.76/115.47 eprover: CPU time limit exceeded, terminating
% 0.76/115.47 eprover: CPU time limit exceeded, terminating
% 0.76/115.48 eprover: CPU time limit exceeded, terminating
% 0.76/115.50 eprover: CPU time limit exceeded, terminating
% 0.86/138.49 eprover: CPU time limit exceeded, terminating
% 0.86/138.50 eprover: CPU time limit exceeded, terminating
% 0.86/138.51 eprover: CPU time limit exceeded, terminating
% 0.86/138.51 eprover: CPU time limit exceeded, terminating
% 0.97/161.51 eprover: CPU time limit exceeded, terminating
% 0.97/161.53 eprover: CPU time limit exceeded, terminating
% 0.97/161.54 eprover: CPU time limit exceeded, terminating
% 0.97/161.55 eprover: CPU time limit exceeded, terminating
% 1.08/184.53 eprover: CPU time limit exceeded, terminating
% 1.08/184.56 eprover: CPU time limit exceeded, terminating
% 1.08/184.57 eprover: CPU time limit exceeded, terminating
% 1.08/184.57 eprover: CPU time limit exceeded, terminating
% 1.20/207.56 eprover: CPU time limit exceeded, terminating
% 1.20/207.58 eprover: CPU time limit exceeded, terminating
% 1.20/207.58 eprover: CPU time limit exceeded, terminating
% 1.20/207.59 eprover: CPU time limit exceeded, terminating
% 1.20/209.37 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 1.20/209.37
% 1.20/209.37 # Failure: Resource limit exceeded (time)
% 1.20/209.37 # OLD status Res
% 1.20/209.37 # Preprocessing time : 0.014 s
% 1.20/209.37 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 1.20/209.37
% 1.20/209.37 # Failure: Resource limit exceeded (time)
% 1.20/209.37 # OLD status Res
% 1.20/209.37 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 1.20/209.37 # Preprocessing time : 0.008 s
% 1.20/209.37 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 1.20/209.37
% 1.20/209.37 # Failure: Resource limit exceeded (time)
% 1.20/209.37 # OLD status Res
% 1.20/209.37 # Preprocessing time : 0.007 s
% 1.20/209.37 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 1.20/209.37
% 1.20/209.37 # Failure: Resource limit exceeded (time)
% 1.20/209.37 # OLD status Res
% 1.20/209.37 # Preprocessing time : 0.007 s
% 1.20/209.37 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 1.20/209.37
% 1.20/209.37 # Failure: Resource limit exceeded (time)
% 1.20/209.37 # OLD status Res
% 1.20/209.37 # Preprocessing time : 0.007 s
% 1.20/209.37 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 1.20/209.37
% 1.20/209.37 # Failure: Resource limit exceeded (time)
% 1.20/209.37 # OLD status Res
% 1.20/209.37 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 1.20/209.37 # Preprocessing time : 0.007 s
% 1.20/209.37 # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 1.20/209.37
% 1.20/209.37 # Failure: Resource limit exceeded (time)
% 1.20/209.37 # OLD status Res
% 1.20/209.37 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 1.20/209.37 # Preprocessing time : 0.007 s
% 1.20/209.37 # Running protocol protocol_eprover_03d534503f753dd3be02bb3c547fa7a3e34e825e for 23 seconds:
% 1.20/209.37
% 1.20/209.37 # Failure: Resource limit exceeded (time)
% 1.20/209.37 # OLD status Res
% 1.20/209.37 # Preprocessing time : 0.007 s
% 1.20/209.37 # Running protocol protocol_eprover_f8481b8ca6e1cbe7ac35251a2832c4c110836158 for 23 seconds:
% 1.20/209.37
% 1.20/209.37 # Failure: Resource limit exceeded (time)
% 1.20/209.37 # OLD status Res
% 1.20/209.37 # SinE strategy is GSinE(CountFormulas,,1.2,,02,60,1.0)
% 1.20/209.37 # Preprocessing time : 0.007 s
% 1.20/209.37 # Running protocol protocol_eprover_4692c23f3ccd5aecc2adbd7957ddb4b4144a02c8 for 23 seconds:
% 1.20/209.37 # Preprocessing time : 0.014 s
% 1.20/209.37
% 1.20/209.37 # Proof found!
% 1.20/209.37 # SZS status Theorem
% 1.20/209.37 # SZS output start CNFRefutation
% See solution above
% 1.20/209.37 # Proof object total steps : 109
% 1.20/209.37 # Proof object clause steps : 80
% 1.20/209.37 # Proof object formula steps : 29
% 1.20/209.37 # Proof object conjectures : 12
% 1.20/209.37 # Proof object clause conjectures : 9
% 1.20/209.37 # Proof object formula conjectures : 3
% 1.20/209.37 # Proof object initial clauses used : 15
% 1.20/209.37 # Proof object initial formulas used : 14
% 1.20/209.37 # Proof object generating inferences : 56
% 1.20/209.37 # Proof object simplifying inferences : 53
% 1.20/209.37 # Training examples: 0 positive, 0 negative
% 1.20/209.37 # Parsed axioms : 14
% 1.20/209.37 # Removed by relevancy pruning/SinE : 0
% 1.20/209.37 # Initial clauses : 15
% 1.20/209.37 # Removed in clause preprocessing : 1
% 1.20/209.37 # Initial clauses in saturation : 14
% 1.20/209.37 # Processed clauses : 6211
% 1.20/209.37 # ...of these trivial : 3282
% 1.20/209.37 # ...subsumed : 2357
% 1.20/209.37 # ...remaining for further processing : 572
% 1.20/209.37 # Other redundant clauses eliminated : 0
% 1.20/209.37 # Clauses deleted for lack of memory : 0
% 1.20/209.37 # Backward-subsumed : 0
% 1.20/209.37 # Backward-rewritten : 187
% 1.20/209.37 # Generated clauses : 107339
% 1.20/209.37 # ...of the previous two non-trivial : 59940
% 1.20/209.37 # Contextual simplify-reflections : 0
% 1.20/209.37 # Paramodulations : 107339
% 1.20/209.37 # Factorizations : 0
% 1.20/209.37 # Equation resolutions : 0
% 1.20/209.37 # Current number of processed clauses : 385
% 1.20/209.37 # Positive orientable unit clauses : 380
% 1.20/209.37 # Positive unorientable unit clauses: 5
% 1.20/209.37 # Negative unit clauses : 0
% 1.20/209.37 # Non-unit-clauses : 0
% 1.20/209.37 # Current number of unprocessed clauses: 45170
% 1.20/209.37 # ...number of literals in the above : 45170
% 1.20/209.37 # Current number of archived formulas : 0
% 1.20/209.37 # Current number of archived clauses : 188
% 1.20/209.37 # Clause-clause subsumption calls (NU) : 0
% 1.20/209.37 # Rec. Clause-clause subsumption calls : 0
% 1.20/209.37 # Non-unit clause-clause subsumptions : 0
% 1.20/209.37 # Unit Clause-clause subsumption calls : 12
% 1.20/209.37 # Rewrite failures with RHS unbound : 0
% 1.20/209.37 # BW rewrite match attempts : 4872
% 1.20/209.37 # BW rewrite match successes : 179
% 1.20/209.37 # Condensation attempts : 0
% 1.20/209.37 # Condensation successes : 0
% 1.20/209.37 # Termbank termtop insertions : 1710991
% 1.20/209.37
% 1.20/209.37 # -------------------------------------------------
% 1.20/209.37 # User time : 0.872 s
% 1.20/209.37 # System time : 0.037 s
% 1.20/209.37 # Total time : 0.909 s
% 1.20/209.37 # Maximum resident set size: 66696 pages
% 1.20/230.59 eprover: CPU time limit exceeded, terminating
% 1.20/230.60 eprover: CPU time limit exceeded, terminating
% 1.20/230.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/230.61 eprover: No such file or directory
% 1.20/230.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.20/230.61 eprover: No such file or directory
% 1.20/230.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/230.61 eprover: No such file or directory
% 1.20/230.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.20/230.61 eprover: No such file or directory
% 1.20/230.62 eprover: CPU time limit exceeded, terminating
% 1.20/230.63 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/230.63 eprover: No such file or directory
% 1.20/230.64 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.20/230.64 eprover: No such file or directory
%------------------------------------------------------------------------------