TSTP Solution File: CSR102+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR102+2 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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 : Fri Jul 15 03:02:45 EDT 2022
% Result : Theorem 7.52s 151.69s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 67 ( 27 unt; 0 def)
% Number of atoms : 200 ( 59 equ)
% Maximal formula atoms : 45 ( 2 avg)
% Number of connectives : 208 ( 75 ~; 89 |; 31 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 23 ( 22 usr; 11 con; 0-3 aty)
% Number of variables : 154 ( 73 sgn 51 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_26) ).
fof(kb_SUMO_4682,axiom,
! [X171,X172,X173] :
( X172 = s__UnionFn(X173,X171)
<=> ! [X174,X175,X176] :
( ( s__instance(X173,s__SetOrClass)
& s__instance(X172,s__SetOrClass)
& s__instance(X171,s__SetOrClass) )
=> ( ( s__instance(X174,X173)
& s__instance(X175,X171)
& s__instance(X176,X172) )
=> ( s__instance(X174,X172)
& s__instance(X175,X172)
& ( s__instance(X176,X173)
| s__instance(X176,X171) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_4682) ).
fof(kb_SUMO_4719,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_4719) ).
fof(kb_SUMO_15012,axiom,
s__subclass(s__Day,s__ConstantQuantity),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+4.ax',kb_SUMO_15012) ).
fof(kb_SUMO_1790,axiom,
! [X111] :
( X111 = s__NullList__m
<=> ( s__instance(X111,s__List)
& ~ ? [X104] : s__inList(X104,X111) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1790) ).
fof(kb_SUMO_2747,axiom,
! [X15,X16] :
( X15 = X16
=> s__ListLengthFn(s__ListFn_2(X15,X16)) = "2" ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_2747) ).
fof(kb_SUMO_2710,axiom,
! [X15,X104] : s__ListLengthFn(s__ListFn_2(X15,X104)) = s__SuccessorFn(s__ListLengthFn(s__ListFn_1(X15))),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_2710) ).
fof(kb_SUMO_2717,axiom,
! [X15,X104] : s__ListOrderFn(s__ListFn_2(X15,X104),s__ListLengthFn(s__ListFn_2(X15,X104))) = X104,
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_2717) ).
fof(kb_SUMO_1026,axiom,
s__subclass(s__SetOrClass,s__Abstract),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1026) ).
fof(kb_SUMO_4675,axiom,
! [X169,X170] :
( ! [X49] :
( ( s__instance(X170,s__Set)
& s__instance(X169,s__Set) )
=> ( s__element(X49,X170)
<=> s__element(X49,X169) ) )
=> X170 = X169 ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_4675) ).
fof(kb_SUMO_374,axiom,
! [X9,X10] :
( s__disjoint(X9,X10)
<=> ! [X48] :
( ( s__instance(X10,s__SetOrClass)
& s__instance(X9,s__SetOrClass) )
=> ~ ( s__instance(X48,X9)
& s__instance(X48,X10) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_374) ).
fof(kb_SUMO_732,axiom,
s__disjoint(s__Collection,s__SelfConnectedObject),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_732) ).
fof(c_0_12,plain,
! [X8,X9] :
( ( s__instance(X8,s__SetOrClass)
| ~ s__subclass(X8,X9) )
& ( s__instance(X9,s__SetOrClass)
| ~ s__subclass(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])]) ).
fof(c_0_13,plain,
! [X177,X178,X179,X180,X181,X182,X177,X178,X179] :
( ( s__instance(X180,X178)
| ~ s__instance(X180,X179)
| ~ s__instance(X181,X177)
| ~ s__instance(X182,X178)
| ~ s__instance(X179,s__SetOrClass)
| ~ s__instance(X178,s__SetOrClass)
| ~ s__instance(X177,s__SetOrClass)
| X178 != s__UnionFn(X179,X177) )
& ( s__instance(X181,X178)
| ~ s__instance(X180,X179)
| ~ s__instance(X181,X177)
| ~ s__instance(X182,X178)
| ~ s__instance(X179,s__SetOrClass)
| ~ s__instance(X178,s__SetOrClass)
| ~ s__instance(X177,s__SetOrClass)
| X178 != s__UnionFn(X179,X177) )
& ( s__instance(X182,X179)
| s__instance(X182,X177)
| ~ s__instance(X180,X179)
| ~ s__instance(X181,X177)
| ~ s__instance(X182,X178)
| ~ s__instance(X179,s__SetOrClass)
| ~ s__instance(X178,s__SetOrClass)
| ~ s__instance(X177,s__SetOrClass)
| X178 != s__UnionFn(X179,X177) )
& ( s__instance(X179,s__SetOrClass)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(X178,s__SetOrClass)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(X177,s__SetOrClass)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(esk188_3(X177,X178,X179),X179)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(esk189_3(X177,X178,X179),X177)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(esk190_3(X177,X178,X179),X178)
| X178 = s__UnionFn(X179,X177) )
& ( ~ s__instance(esk190_3(X177,X178,X179),X179)
| ~ s__instance(esk188_3(X177,X178,X179),X178)
| ~ s__instance(esk189_3(X177,X178,X179),X178)
| X178 = s__UnionFn(X179,X177) )
& ( ~ s__instance(esk190_3(X177,X178,X179),X177)
| ~ s__instance(esk188_3(X177,X178,X179),X178)
| ~ s__instance(esk189_3(X177,X178,X179),X178)
| X178 = s__UnionFn(X179,X177) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_4682])])])])])])]) ).
fof(c_0_14,plain,
! [X169,X170] :
( ~ s__instance(X169,s__SetOrClass)
| ~ s__instance(X169,s__NullSet)
| ~ s__instance(X170,X169) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_4719])])])])]) ).
cnf(c_0_15,plain,
( s__instance(X2,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
s__subclass(s__Day,s__ConstantQuantity),
inference(split_conjunct,[status(thm)],[kb_SUMO_15012]) ).
fof(c_0_17,plain,
! [X112,X113,X112] :
( ( s__instance(X112,s__List)
| X112 != s__NullList__m )
& ( ~ s__inList(X113,X112)
| X112 != s__NullList__m )
& ( ~ s__instance(X112,s__List)
| s__inList(esk140_1(X112),X112)
| X112 = s__NullList__m ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1790])])])])])])]) ).
cnf(c_0_18,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(X3,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ s__instance(X1,X2)
| ~ s__instance(X2,s__NullSet)
| ~ s__instance(X2,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
s__instance(s__ConstantQuantity,s__SetOrClass),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( s__instance(X1,s__List)
| X1 != s__NullList__m ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( X1 = X2
| s__instance(X3,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_23,plain,
( ~ s__instance(s__ConstantQuantity,s__NullSet)
| ~ s__instance(X1,s__ConstantQuantity) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( s__instance(X1,s__SetOrClass)
| s__instance(X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_25,plain,
s__instance(X1,s__SetOrClass),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
fof(c_0_26,plain,
! [X17,X18] :
( X17 != X18
| s__ListLengthFn(s__ListFn_2(X17,X18)) = "2" ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_2747])]) ).
fof(c_0_27,plain,
! [X105,X106] : s__ListLengthFn(s__ListFn_2(X105,X106)) = s__SuccessorFn(s__ListLengthFn(s__ListFn_1(X105))),
inference(variable_rename,[status(thm)],[kb_SUMO_2710]) ).
cnf(c_0_28,plain,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_25])]) ).
cnf(c_0_29,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk189_3(X3,X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,plain,
( s__ListLengthFn(s__ListFn_2(X1,X2)) = "2"
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
s__ListLengthFn(s__ListFn_2(X1,X2)) = s__SuccessorFn(s__ListLengthFn(s__ListFn_1(X1))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| ~ s__instance(X3,esk189_3(s__NullSet,X1,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk190_3(X3,X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_34,plain,
! [X105,X106] : s__ListOrderFn(s__ListFn_2(X105,X106),s__ListLengthFn(s__ListFn_2(X105,X106))) = X106,
inference(variable_rename,[status(thm)],[kb_SUMO_2717]) ).
cnf(c_0_35,plain,
s__ListLengthFn(s__ListFn_2(X1,X1)) = "2",
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
s__ListLengthFn(s__ListFn_2(X1,X2)) = s__ListLengthFn(s__ListFn_2(X1,X3)),
inference(spm,[status(thm)],[c_0_31,c_0_31]) ).
cnf(c_0_37,plain,
( esk189_3(s__NullSet,X1,X2) = s__UnionFn(X3,X4)
| X1 = s__UnionFn(X2,s__NullSet) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,plain,
s__subclass(s__SetOrClass,s__Abstract),
inference(split_conjunct,[status(thm)],[kb_SUMO_1026]) ).
cnf(c_0_40,plain,
s__ListOrderFn(s__ListFn_2(X1,X2),s__ListLengthFn(s__ListFn_2(X1,X2))) = X2,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
s__ListLengthFn(s__ListFn_2(X1,X2)) = "2",
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_42,plain,
! [X171,X172] :
( ( s__instance(X172,s__Set)
| X172 = X171 )
& ( s__instance(X171,s__Set)
| X172 = X171 )
& ( ~ s__element(esk187_2(X171,X172),X172)
| ~ s__element(esk187_2(X171,X172),X171)
| X172 = X171 )
& ( s__element(esk187_2(X171,X172),X172)
| s__element(esk187_2(X171,X172),X171)
| X172 = X171 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_4675])])])])])]) ).
cnf(c_0_43,plain,
( s__UnionFn(X1,X2) = s__UnionFn(X3,X4)
| X5 = s__UnionFn(X6,s__NullSet) ),
inference(spm,[status(thm)],[c_0_37,c_0_37]) ).
cnf(c_0_44,plain,
s__instance(s__SetOrClass,s__SetOrClass),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
s__ListOrderFn(s__ListFn_2(X1,X2),"2") = X2,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
( X1 = X2
| s__instance(X2,s__Set) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_47,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| s__UnionFn(X3,X4) != X1 ),
inference(ef,[status(thm)],[c_0_43]) ).
cnf(c_0_48,plain,
( ~ s__instance(s__SetOrClass,s__NullSet)
| ~ s__instance(X1,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_19,c_0_44]) ).
cnf(c_0_49,plain,
( s__ListOrderFn(X1,"2") = X2
| s__instance(X1,s__Set) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| ~ s__instance(X3,s__UnionFn(X4,X5)) ),
inference(spm,[status(thm)],[c_0_32,c_0_37]) ).
cnf(c_0_51,plain,
s__UnionFn(X1,X2) = s__UnionFn(X3,s__NullSet),
inference(er,[status(thm)],[c_0_47]) ).
fof(c_0_52,plain,
! [X49,X50,X51,X49,X50] :
( ( ~ s__disjoint(X49,X50)
| ~ s__instance(X50,s__SetOrClass)
| ~ s__instance(X49,s__SetOrClass)
| ~ s__instance(X51,X49)
| ~ s__instance(X51,X50) )
& ( s__instance(X50,s__SetOrClass)
| s__disjoint(X49,X50) )
& ( s__instance(X49,s__SetOrClass)
| s__disjoint(X49,X50) )
& ( s__instance(esk1_2(X49,X50),X49)
| s__disjoint(X49,X50) )
& ( s__instance(esk1_2(X49,X50),X50)
| s__disjoint(X49,X50) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_374])])])])])])]) ).
cnf(c_0_53,plain,
~ s__instance(s__SetOrClass,s__NullSet),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_25])]) ).
cnf(c_0_54,plain,
( X1 = X2
| s__instance(X3,s__Set) ),
inference(spm,[status(thm)],[c_0_49,c_0_49]) ).
cnf(c_0_55,plain,
( X1 = s__UnionFn(X2,s__UnionFn(X3,X4))
| X5 = s__UnionFn(X6,s__NullSet) ),
inference(spm,[status(thm)],[c_0_50,c_0_29]) ).
cnf(c_0_56,plain,
s__UnionFn(X1,X2) = s__UnionFn(X3,X4),
inference(spm,[status(thm)],[c_0_51,c_0_51]) ).
cnf(c_0_57,plain,
( ~ s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__disjoint(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,plain,
( s__instance(X1,s__Set)
| ~ s__instance(s__SetOrClass,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
X1 = s__UnionFn(X2,s__UnionFn(X3,X4)),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_55]),c_0_56]) ).
cnf(c_0_60,plain,
( ~ s__disjoint(X1,X2)
| ~ s__instance(X3,X1)
| ~ s__instance(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_25]),c_0_25])]) ).
cnf(c_0_61,plain,
s__disjoint(s__Collection,s__SelfConnectedObject),
inference(split_conjunct,[status(thm)],[kb_SUMO_732]) ).
cnf(c_0_62,plain,
s__instance(X1,s__Set),
inference(spm,[status(thm)],[c_0_58,c_0_25]) ).
cnf(c_0_63,plain,
X1 = X2,
inference(spm,[status(thm)],[c_0_59,c_0_59]) ).
cnf(c_0_64,plain,
( ~ s__instance(X1,s__Collection)
| ~ s__instance(X1,s__SelfConnectedObject) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
s__instance(X1,X2),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR102+2 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jun 10 10:21:03 EDT 2022
% 0.14/0.34 % CPUTime :
% 6.85/29.91 eprover: CPU time limit exceeded, terminating
% 6.85/29.92 eprover: CPU time limit exceeded, terminating
% 6.85/29.92 eprover: CPU time limit exceeded, terminating
% 6.91/38.23 eprover: CPU time limit exceeded, terminating
% 6.97/52.92 eprover: CPU time limit exceeded, terminating
% 6.97/52.95 eprover: CPU time limit exceeded, terminating
% 6.97/52.98 eprover: CPU time limit exceeded, terminating
% 7.03/61.26 eprover: CPU time limit exceeded, terminating
% 7.11/75.96 eprover: CPU time limit exceeded, terminating
% 7.11/75.98 eprover: CPU time limit exceeded, terminating
% 7.11/75.99 eprover: CPU time limit exceeded, terminating
% 7.16/84.28 eprover: CPU time limit exceeded, terminating
% 7.24/99.02 eprover: CPU time limit exceeded, terminating
% 7.24/99.02 eprover: CPU time limit exceeded, terminating
% 7.24/99.04 eprover: CPU time limit exceeded, terminating
% 7.27/107.31 eprover: CPU time limit exceeded, terminating
% 7.36/122.03 eprover: CPU time limit exceeded, terminating
% 7.36/122.07 eprover: CPU time limit exceeded, terminating
% 7.36/122.45 eprover: CPU time limit exceeded, terminating
% 7.40/130.33 eprover: CPU time limit exceeded, terminating
% 7.49/145.04 eprover: CPU time limit exceeded, terminating
% 7.49/146.03 eprover: CPU time limit exceeded, terminating
% 7.52/151.69 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 7.52/151.69
% 7.52/151.69 # Failure: Resource limit exceeded (time)
% 7.52/151.69 # OLD status Res
% 7.52/151.69 # Preprocessing time : 1.345 s
% 7.52/151.69 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 7.52/151.69
% 7.52/151.69 # Failure: Resource limit exceeded (time)
% 7.52/151.69 # OLD status Res
% 7.52/151.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 7.52/151.69 # Preprocessing time : 0.476 s
% 7.52/151.69 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 7.52/151.69
% 7.52/151.69 # Failure: Resource limit exceeded (time)
% 7.52/151.69 # OLD status Res
% 7.52/151.69 # Preprocessing time : 1.304 s
% 7.52/151.69 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 7.52/151.69
% 7.52/151.69 # Failure: Resource limit exceeded (time)
% 7.52/151.69 # OLD status Res
% 7.52/151.69 # Preprocessing time : 1.297 s
% 7.52/151.69 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 7.52/151.69
% 7.52/151.69 # Failure: Resource limit exceeded (time)
% 7.52/151.69 # OLD status Res
% 7.52/151.69 # Preprocessing time : 1.366 s
% 7.52/151.69 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 7.52/151.69 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 7.52/151.69 # Preprocessing time : 0.372 s
% 7.52/151.69
% 7.52/151.69 # Failure: Out of unprocessed clauses!
% 7.52/151.69 # OLD status GaveUp
% 7.52/151.69 # Parsed axioms : 37983
% 7.52/151.69 # Removed by relevancy pruning/SinE : 37841
% 7.52/151.69 # Initial clauses : 146
% 7.52/151.69 # Removed in clause preprocessing : 9
% 7.52/151.69 # Initial clauses in saturation : 137
% 7.52/151.69 # Processed clauses : 19660
% 7.52/151.69 # ...of these trivial : 1157
% 7.52/151.69 # ...subsumed : 869
% 7.52/151.69 # ...remaining for further processing : 17634
% 7.52/151.69 # Other redundant clauses eliminated : 1
% 7.52/151.69 # Clauses deleted for lack of memory : 2319
% 7.52/151.69 # Backward-subsumed : 0
% 7.52/151.69 # Backward-rewritten : 1123
% 7.52/151.69 # Generated clauses : 28070
% 7.52/151.69 # ...of the previous two non-trivial : 25028
% 7.52/151.69 # Contextual simplify-reflections : 0
% 7.52/151.69 # Paramodulations : 28069
% 7.52/151.69 # Factorizations : 0
% 7.52/151.69 # Equation resolutions : 1
% 7.52/151.69 # Current number of processed clauses : 16510
% 7.52/151.69 # Positive orientable unit clauses : 4728
% 7.52/151.69 # Positive unorientable unit clauses: 0
% 7.52/151.69 # Negative unit clauses : 6
% 7.52/151.69 # Non-unit-clauses : 11776
% 7.52/151.69 # Current number of unprocessed clauses: 0
% 7.52/151.69 # ...number of literals in the above : 0
% 7.52/151.69 # Current number of archived formulas : 0
% 7.52/151.69 # Current number of archived clauses : 1123
% 7.52/151.69 # Clause-clause subsumption calls (NU) : 6592555
% 7.52/151.69 # Rec. Clause-clause subsumption calls : 3731921
% 7.52/151.69 # Non-unit clause-clause subsumptions : 869
% 7.52/151.69 # Unit Clause-clause subsumption calls : 106644
% 7.52/151.69 # Rewrite failures with RHS unbound : 0
% 7.52/151.69 # BW rewrite match attempts : 1680732
% 7.52/151.69 # BW rewrite match successes : 178
% 7.52/151.69 # Condensation attempts : 0
% 7.52/151.69 # Condensation successes : 0
% 7.52/151.69 # Termbank termtop insertions : 21977751
% 7.52/151.69
% 7.52/151.69 # -------------------------------------------------
% 7.52/151.69 # User time : 10.466 s
% 7.52/151.69 # System time : 0.220 s
% 7.52/151.69 # Total time : 10.686 s
% 7.52/151.69 # Maximum resident set size: 356752 pages
% 7.52/151.69 # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 7.52/151.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 7.52/151.69 # Preprocessing time : 0.360 s
% 7.52/151.69
% 7.52/151.69 # Failure: Out of unprocessed clauses!
% 7.52/151.69 # OLD status GaveUp
% 7.52/151.69 # Parsed axioms : 37983
% 7.52/151.69 # Removed by relevancy pruning/SinE : 37833
% 7.52/151.69 # Initial clauses : 154
% 7.52/151.69 # Removed in clause preprocessing : 9
% 7.52/151.69 # Initial clauses in saturation : 145
% 7.52/151.69 # Processed clauses : 1742
% 7.52/151.69 # ...of these trivial : 87
% 7.52/151.69 # ...subsumed : 738
% 7.52/151.69 # ...remaining for further processing : 917
% 7.52/151.69 # Other redundant clauses eliminated : 1
% 7.52/151.69 # Clauses deleted for lack of memory : 0
% 7.52/151.69 # Backward-subsumed : 17
% 7.52/151.69 # Backward-rewritten : 0
% 7.52/151.69 # Generated clauses : 1812
% 7.52/151.69 # ...of the previous two non-trivial : 1601
% 7.52/151.69 # Contextual simplify-reflections : 1342
% 7.52/151.69 # Paramodulations : 1810
% 7.52/151.69 # Factorizations : 0
% 7.52/151.69 # Equation resolutions : 2
% 7.52/151.69 # Current number of processed clauses : 899
% 7.52/151.69 # Positive orientable unit clauses : 125
% 7.52/151.69 # Positive unorientable unit clauses: 0
% 7.52/151.69 # Negative unit clauses : 1
% 7.52/151.69 # Non-unit-clauses : 773
% 7.52/151.69 # Current number of unprocessed clauses: 0
% 7.52/151.69 # ...number of literals in the above : 0
% 7.52/151.69 # Current number of archived formulas : 0
% 7.52/151.69 # Current number of archived clauses : 17
% 7.52/151.69 # Clause-clause subsumption calls (NU) : 757730
% 7.52/151.69 # Rec. Clause-clause subsumption calls : 89609
% 7.52/151.69 # Non-unit clause-clause subsumptions : 2024
% 7.52/151.69 # Unit Clause-clause subsumption calls : 504
% 7.52/151.69 # Rewrite failures with RHS unbound : 0
% 7.52/151.69 # BW rewrite match attempts : 2
% 7.52/151.69 # BW rewrite match successes : 0
% 7.52/151.69 # Condensation attempts : 0
% 7.52/151.69 # Condensation successes : 0
% 7.52/151.69 # Termbank termtop insertions : 296917
% 7.52/151.69
% 7.52/151.69 # -------------------------------------------------
% 7.52/151.69 # User time : 0.541 s
% 7.52/151.69 # System time : 0.022 s
% 7.52/151.69 # Total time : 0.563 s
% 7.52/151.69 # Maximum resident set size: 54920 pages
% 7.52/151.69 # Running protocol protocol_eprover_03d534503f753dd3be02bb3c547fa7a3e34e825e for 23 seconds:
% 7.52/151.69 # Preprocessing time : 1.263 s
% 7.52/151.69
% 7.52/151.69 # Proof found!
% 7.52/151.69 # SZS status Theorem
% 7.52/151.69 # SZS output start CNFRefutation
% See solution above
% 7.52/151.69 # Proof object total steps : 67
% 7.52/151.69 # Proof object clause steps : 46
% 7.52/151.69 # Proof object formula steps : 21
% 7.52/151.69 # Proof object conjectures : 0
% 7.52/151.69 # Proof object clause conjectures : 0
% 7.52/151.69 # Proof object formula conjectures : 0
% 7.52/151.69 # Proof object initial clauses used : 15
% 7.52/151.69 # Proof object initial formulas used : 12
% 7.52/151.69 # Proof object generating inferences : 25
% 7.52/151.69 # Proof object simplifying inferences : 15
% 7.52/151.69 # Training examples: 0 positive, 0 negative
% 7.52/151.69 # Parsed axioms : 37983
% 7.52/151.69 # Removed by relevancy pruning/SinE : 0
% 7.52/151.69 # Initial clauses : 41505
% 7.52/151.69 # Removed in clause preprocessing : 63
% 7.52/151.69 # Initial clauses in saturation : 41442
% 7.52/151.69 # Processed clauses : 45168
% 7.52/151.69 # ...of these trivial : 3181
% 7.52/151.69 # ...subsumed : 2370
% 7.52/151.69 # ...remaining for further processing : 39617
% 7.52/151.69 # Other redundant clauses eliminated : 2052
% 7.52/151.69 # Clauses deleted for lack of memory : 860783
% 7.52/151.69 # Backward-subsumed : 934
% 7.52/151.69 # Backward-rewritten : 17005
% 7.52/151.69 # Generated clauses : 1207528
% 7.52/151.69 # ...of the previous two non-trivial : 1204142
% 7.52/151.69 # Contextual simplify-reflections : 1795
% 7.52/151.69 # Paramodulations : 1205063
% 7.52/151.69 # Factorizations : 47
% 7.52/151.69 # Equation resolutions : 2174
% 7.52/151.69 # Current number of processed clauses : 21423
% 7.52/151.69 # Positive orientable unit clauses : 21300
% 7.52/151.69 # Positive unorientable unit clauses: 1
% 7.52/151.69 # Negative unit clauses : 14
% 7.52/151.69 # Non-unit-clauses : 108
% 7.52/151.69 # Current number of unprocessed clauses: 47622
% 7.52/151.69 # ...number of literals in the above : 51217
% 7.52/151.69 # Current number of archived formulas : 0
% 7.52/151.69 # Current number of archived clauses : 18183
% 7.52/151.69 # Clause-clause subsumption calls (NU) : 24184175
% 7.52/151.69 # Rec. Clause-clause subsumption calls : 5236584
% 7.52/151.69 # Non-unit clause-clause subsumptions : 4097
% 7.52/151.69 # Unit Clause-clause subsumption calls : 2942337
% 7.52/151.69 # Rewrite failures with RHS unbound : 32266
% 7.52/151.69 # BW rewrite match attempts : 59965
% 7.52/151.69 # BW rewrite match successes : 44323
% 7.52/151.69 # Condensation attempts : 0
% 7.52/151.69 # Condensation successes : 0
% 7.52/151.69 # Termbank termtop insertions : 10958368
% 7.52/151.69
% 7.52/151.69 # -------------------------------------------------
% 7.52/151.69 # User time : 17.684 s
% 7.52/151.69 # System time : 0.336 s
% 7.52/151.69 # Total time : 18.020 s
% 7.52/151.69 # Maximum resident set size: 434528 pages
%------------------------------------------------------------------------------