TSTP Solution File: CSR102+5 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR102+5 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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 3.76s 130.93s
% Output : CNFRefutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 27 unt; 0 def)
% Number of atoms : 182 ( 54 equ)
% Maximal formula atoms : 45 ( 2 avg)
% Number of connectives : 186 ( 65 ~; 81 |; 28 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 18 usr; 8 con; 0-3 aty)
% Number of variables : 146 ( 69 sgn 49 !; 1 ?)
% 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_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_855,axiom,
s__subclass(s__Abstract,s__Entity),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_855) ).
fof(kb_SUMO_606,axiom,
! [X26] : s__instance(X26,s__Entity),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_606) ).
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_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_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_7130,axiom,
s__disjoint(s__Organism,s__Artifact),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_7130) ).
fof(c_0_11,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_12,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_13,plain,
( s__instance(X2,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
s__subclass(s__Abstract,s__Entity),
inference(split_conjunct,[status(thm)],[kb_SUMO_855]) ).
fof(c_0_15,plain,
! [X27] : s__instance(X27,s__Entity),
inference(variable_rename,[status(thm)],[kb_SUMO_606]) ).
fof(c_0_16,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])])])])])])]) ).
cnf(c_0_17,plain,
( ~ s__instance(X1,X2)
| ~ s__instance(X2,s__NullSet)
| ~ s__instance(X2,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
s__instance(s__Entity,s__SetOrClass),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
s__instance(X1,s__Entity),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(X3,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
~ s__instance(s__Entity,s__NullSet),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( X1 = X2
| s__instance(X3,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_23,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__instance(s__Entity,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
s__instance(X1,s__SetOrClass),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
fof(c_0_25,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_26,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_27,plain,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_24])]) ).
cnf(c_0_28,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk189_3(X3,X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
( s__ListLengthFn(s__ListFn_2(X1,X2)) = "2"
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
s__ListLengthFn(s__ListFn_2(X1,X2)) = s__SuccessorFn(s__ListLengthFn(s__ListFn_1(X1))),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| ~ s__instance(X3,esk189_3(s__NullSet,X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk190_3(X3,X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_33,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_34,plain,
s__ListLengthFn(s__ListFn_2(X1,X1)) = "2",
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
s__ListLengthFn(s__ListFn_2(X1,X2)) = s__ListLengthFn(s__ListFn_2(X1,X3)),
inference(spm,[status(thm)],[c_0_30,c_0_30]) ).
cnf(c_0_36,plain,
( esk189_3(s__NullSet,X1,X2) = s__UnionFn(X3,X4)
| X1 = s__UnionFn(X2,s__NullSet) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
s__ListOrderFn(s__ListFn_2(X1,X2),s__ListLengthFn(s__ListFn_2(X1,X2))) = X2,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
s__ListLengthFn(s__ListFn_2(X1,X2)) = "2",
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_39,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_40,plain,
( s__UnionFn(X1,X2) = s__UnionFn(X3,X4)
| X5 = s__UnionFn(X6,s__NullSet) ),
inference(spm,[status(thm)],[c_0_36,c_0_36]) ).
cnf(c_0_41,plain,
s__ListOrderFn(s__ListFn_2(X1,X2),"2") = X2,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( X1 = X2
| s__instance(X2,s__Set) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| s__UnionFn(X3,X4) != X1 ),
inference(ef,[status(thm)],[c_0_40]) ).
cnf(c_0_44,plain,
( s__ListOrderFn(X1,"2") = X2
| s__instance(X1,s__Set) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| ~ s__instance(X3,s__UnionFn(X4,X5)) ),
inference(spm,[status(thm)],[c_0_31,c_0_36]) ).
cnf(c_0_46,plain,
s__UnionFn(X1,X2) = s__UnionFn(X3,s__NullSet),
inference(er,[status(thm)],[c_0_43]) ).
fof(c_0_47,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_48,plain,
( X1 = X2
| s__instance(X3,s__Set) ),
inference(spm,[status(thm)],[c_0_44,c_0_44]) ).
cnf(c_0_49,plain,
( X1 = s__UnionFn(X2,s__UnionFn(X3,X4))
| X5 = s__UnionFn(X6,s__NullSet) ),
inference(spm,[status(thm)],[c_0_45,c_0_28]) ).
cnf(c_0_50,plain,
s__UnionFn(X1,X2) = s__UnionFn(X3,X4),
inference(spm,[status(thm)],[c_0_46,c_0_46]) ).
cnf(c_0_51,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_47]) ).
cnf(c_0_52,plain,
( s__instance(X1,s__Set)
| ~ s__instance(s__Entity,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_48]) ).
cnf(c_0_53,plain,
X1 = s__UnionFn(X2,s__UnionFn(X3,X4)),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_49]),c_0_50]) ).
cnf(c_0_54,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_51,c_0_24]),c_0_24])]) ).
cnf(c_0_55,plain,
s__disjoint(s__Organism,s__Artifact),
inference(split_conjunct,[status(thm)],[kb_SUMO_7130]) ).
cnf(c_0_56,plain,
s__instance(X1,s__Set),
inference(spm,[status(thm)],[c_0_52,c_0_24]) ).
cnf(c_0_57,plain,
X1 = X2,
inference(spm,[status(thm)],[c_0_53,c_0_53]) ).
cnf(c_0_58,plain,
( ~ s__instance(X1,s__Organism)
| ~ s__instance(X1,s__Artifact) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
s__instance(X1,X2),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CSR102+5 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 10 20:27:34 EDT 2022
% 0.13/0.35 % CPUTime :
% 3.09/26.13 eprover: CPU time limit exceeded, terminating
% 3.09/26.13 eprover: CPU time limit exceeded, terminating
% 3.09/26.14 eprover: CPU time limit exceeded, terminating
% 3.10/27.12 eprover: CPU time limit exceeded, terminating
% 3.23/49.15 eprover: CPU time limit exceeded, terminating
% 3.23/49.16 eprover: CPU time limit exceeded, terminating
% 3.24/49.59 eprover: CPU time limit exceeded, terminating
% 3.24/50.15 eprover: CPU time limit exceeded, terminating
% 3.39/72.20 eprover: CPU time limit exceeded, terminating
% 3.39/72.20 eprover: CPU time limit exceeded, terminating
% 3.40/72.62 eprover: CPU time limit exceeded, terminating
% 3.40/73.16 eprover: CPU time limit exceeded, terminating
% 3.53/95.26 eprover: CPU time limit exceeded, terminating
% 3.53/95.26 eprover: CPU time limit exceeded, terminating
% 3.54/96.01 eprover: CPU time limit exceeded, terminating
% 3.54/96.76 eprover: CPU time limit exceeded, terminating
% 3.67/118.29 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 3.67/118.29
% 3.68/119.79 eprover: CPU time limit exceeded, terminating
% 3.72/125.23 eprover: CPU time limit exceeded, terminating
% 3.76/130.93 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 3.76/130.93
% 3.76/130.93 # Failure: Resource limit exceeded (time)
% 3.76/130.93 # OLD status Res
% 3.76/130.93 # Preprocessing time : 0.960 s
% 3.76/130.93 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 3.76/130.93
% 3.76/130.93 # Failure: Resource limit exceeded (time)
% 3.76/130.93 # OLD status Res
% 3.76/130.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 3.76/130.93 # Preprocessing time : 0.337 s
% 3.76/130.93 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 3.76/130.93
% 3.76/130.93 # Failure: Resource limit exceeded (time)
% 3.76/130.93 # OLD status Res
% 3.76/130.93 # Preprocessing time : 0.816 s
% 3.76/130.93 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 3.76/130.93
% 3.76/130.93 # Failure: Resource limit exceeded (time)
% 3.76/130.93 # OLD status Res
% 3.76/130.93 # Preprocessing time : 0.903 s
% 3.76/130.93 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 3.76/130.93
% 3.76/130.93 # Failure: Resource limit exceeded (time)
% 3.76/130.93 # OLD status Res
% 3.76/130.93 # Preprocessing time : 0.878 s
% 3.76/130.93 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 3.76/130.93 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 3.76/130.93 # Preprocessing time : 0.230 s
% 3.76/130.93
% 3.76/130.93 # Failure: Out of unprocessed clauses!
% 3.76/130.93 # OLD status GaveUp
% 3.76/130.93 # Parsed axioms : 16750
% 3.76/130.93 # Removed by relevancy pruning/SinE : 16701
% 3.76/130.93 # Initial clauses : 52
% 3.76/130.93 # Removed in clause preprocessing : 9
% 3.76/130.93 # Initial clauses in saturation : 43
% 3.76/130.93 # Processed clauses : 45
% 3.76/130.93 # ...of these trivial : 0
% 3.76/130.93 # ...subsumed : 0
% 3.76/130.93 # ...remaining for further processing : 45
% 3.76/130.93 # Other redundant clauses eliminated : 1
% 3.76/130.93 # Clauses deleted for lack of memory : 0
% 3.76/130.93 # Backward-subsumed : 0
% 3.76/130.93 # Backward-rewritten : 0
% 3.76/130.93 # Generated clauses : 2
% 3.76/130.93 # ...of the previous two non-trivial : 2
% 3.76/130.93 # Contextual simplify-reflections : 0
% 3.76/130.93 # Paramodulations : 1
% 3.76/130.93 # Factorizations : 0
% 3.76/130.93 # Equation resolutions : 1
% 3.76/130.93 # Current number of processed clauses : 44
% 3.76/130.93 # Positive orientable unit clauses : 14
% 3.76/130.93 # Positive unorientable unit clauses: 0
% 3.76/130.93 # Negative unit clauses : 0
% 3.76/130.93 # Non-unit-clauses : 30
% 3.76/130.93 # Current number of unprocessed clauses: 0
% 3.76/130.93 # ...number of literals in the above : 0
% 3.76/130.93 # Current number of archived formulas : 0
% 3.76/130.93 # Current number of archived clauses : 0
% 3.76/130.93 # Clause-clause subsumption calls (NU) : 27
% 3.76/130.93 # Rec. Clause-clause subsumption calls : 3
% 3.76/130.93 # Non-unit clause-clause subsumptions : 0
% 3.76/130.93 # Unit Clause-clause subsumption calls : 23
% 3.76/130.93 # Rewrite failures with RHS unbound : 0
% 3.76/130.93 # BW rewrite match attempts : 2
% 3.76/130.93 # BW rewrite match successes : 0
% 3.76/130.93 # Condensation attempts : 0
% 3.76/130.93 # Condensation successes : 0
% 3.76/130.93 # Termbank termtop insertions : 167411
% 3.76/130.93
% 3.76/130.93 # -------------------------------------------------
% 3.76/130.93 # User time : 0.212 s
% 3.76/130.93 # System time : 0.019 s
% 3.76/130.93 # Total time : 0.231 s
% 3.76/130.93 # Maximum resident set size: 43064 pages
% 3.76/130.93 # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 3.76/130.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 3.76/130.93 # Preprocessing time : 0.233 s
% 3.76/130.93
% 3.76/130.93 # Failure: Out of unprocessed clauses!
% 3.76/130.93 # OLD status GaveUp
% 3.76/130.93 # Parsed axioms : 16750
% 3.76/130.93 # Removed by relevancy pruning/SinE : 16691
% 3.76/130.93 # Initial clauses : 63
% 3.76/130.93 # Removed in clause preprocessing : 9
% 3.76/130.93 # Initial clauses in saturation : 54
% 3.76/130.93 # Processed clauses : 211
% 3.76/130.93 # ...of these trivial : 0
% 3.76/130.93 # ...subsumed : 65
% 3.76/130.93 # ...remaining for further processing : 146
% 3.76/130.93 # Other redundant clauses eliminated : 1
% 3.76/130.93 # Clauses deleted for lack of memory : 0
% 3.76/130.93 # Backward-subsumed : 0
% 3.76/130.93 # Backward-rewritten : 0
% 3.76/130.93 # Generated clauses : 202
% 3.76/130.93 # ...of the previous two non-trivial : 157
% 3.76/130.93 # Contextual simplify-reflections : 156
% 3.76/130.93 # Paramodulations : 200
% 3.76/130.93 # Factorizations : 0
% 3.76/130.93 # Equation resolutions : 2
% 3.76/130.93 # Current number of processed clauses : 145
% 3.76/130.93 # Positive orientable unit clauses : 22
% 3.76/130.93 # Positive unorientable unit clauses: 0
% 3.76/130.93 # Negative unit clauses : 0
% 3.76/130.93 # Non-unit-clauses : 123
% 3.76/130.93 # Current number of unprocessed clauses: 0
% 3.76/130.93 # ...number of literals in the above : 0
% 3.76/130.93 # Current number of archived formulas : 0
% 3.76/130.93 # Current number of archived clauses : 0
% 3.76/130.93 # Clause-clause subsumption calls (NU) : 8873
% 3.76/130.93 # Rec. Clause-clause subsumption calls : 1611
% 3.76/130.93 # Non-unit clause-clause subsumptions : 221
% 3.76/130.93 # Unit Clause-clause subsumption calls : 64
% 3.76/130.93 # Rewrite failures with RHS unbound : 0
% 3.76/130.93 # BW rewrite match attempts : 2
% 3.76/130.93 # BW rewrite match successes : 0
% 3.76/130.93 # Condensation attempts : 0
% 3.76/130.93 # Condensation successes : 0
% 3.76/130.93 # Termbank termtop insertions : 174027
% 3.76/130.93
% 3.76/130.93 # -------------------------------------------------
% 3.76/130.93 # User time : 0.218 s
% 3.76/130.93 # System time : 0.026 s
% 3.76/130.93 # Total time : 0.244 s
% 3.76/130.93 # Maximum resident set size: 43700 pages
% 3.76/130.93 # Running protocol protocol_eprover_03d534503f753dd3be02bb3c547fa7a3e34e825e for 23 seconds:
% 3.76/130.93 # Preprocessing time : 0.839 s
% 3.76/130.93
% 3.76/130.93 # Proof found!
% 3.76/130.93 # SZS status Theorem
% 3.76/130.93 # SZS output start CNFRefutation
% See solution above
% 3.76/130.93 # Proof object total steps : 61
% 3.76/130.93 # Proof object clause steps : 41
% 3.76/130.93 # Proof object formula steps : 20
% 3.76/130.93 # Proof object conjectures : 0
% 3.76/130.93 # Proof object clause conjectures : 0
% 3.76/130.93 # Proof object formula conjectures : 0
% 3.76/130.93 # Proof object initial clauses used : 13
% 3.76/130.93 # Proof object initial formulas used : 11
% 3.76/130.93 # Proof object generating inferences : 23
% 3.76/130.93 # Proof object simplifying inferences : 13
% 3.76/130.93 # Training examples: 0 positive, 0 negative
% 3.76/130.93 # Parsed axioms : 16750
% 3.76/130.93 # Removed by relevancy pruning/SinE : 0
% 3.76/130.93 # Initial clauses : 20272
% 3.76/130.93 # Removed in clause preprocessing : 63
% 3.76/130.93 # Initial clauses in saturation : 20209
% 3.76/130.93 # Processed clauses : 23862
% 3.76/130.93 # ...of these trivial : 90
% 3.76/130.93 # ...subsumed : 2525
% 3.76/130.93 # ...remaining for further processing : 21247
% 3.76/130.93 # Other redundant clauses eliminated : 2123
% 3.76/130.93 # Clauses deleted for lack of memory : 391967
% 3.76/130.93 # Backward-subsumed : 888
% 3.76/130.93 # Backward-rewritten : 11950
% 3.76/130.93 # Generated clauses : 660420
% 3.76/130.93 # ...of the previous two non-trivial : 659569
% 3.76/130.93 # Contextual simplify-reflections : 1770
% 3.76/130.93 # Paramodulations : 657911
% 3.76/130.93 # Factorizations : 21
% 3.76/130.93 # Equation resolutions : 2247
% 3.76/130.93 # Current number of processed clauses : 8157
% 3.76/130.93 # Positive orientable unit clauses : 8034
% 3.76/130.93 # Positive unorientable unit clauses: 1
% 3.76/130.93 # Negative unit clauses : 14
% 3.76/130.93 # Non-unit-clauses : 108
% 3.76/130.93 # Current number of unprocessed clauses: 46192
% 3.76/130.93 # ...number of literals in the above : 52641
% 3.76/130.93 # Current number of archived formulas : 0
% 3.76/130.93 # Current number of archived clauses : 13079
% 3.76/130.93 # Clause-clause subsumption calls (NU) : 23671954
% 3.76/130.93 # Rec. Clause-clause subsumption calls : 5096609
% 3.76/130.93 # Non-unit clause-clause subsumptions : 4177
% 3.76/130.93 # Unit Clause-clause subsumption calls : 1750001
% 3.76/130.93 # Rewrite failures with RHS unbound : 32305
% 3.76/130.93 # BW rewrite match attempts : 41734
% 3.76/130.93 # BW rewrite match successes : 39082
% 3.76/130.93 # Condensation attempts : 0
% 3.76/130.93 # Condensation successes : 0
% 3.76/130.93 # Termbank termtop insertions : 7404411
% 3.76/130.93
% 3.76/130.93 # -------------------------------------------------
% 3.76/130.93 # User time : 11.367 s
% 3.76/130.93 # System time : 0.267 s
% 3.76/130.93 # Total time : 11.634 s
% 3.76/130.93 # Maximum resident set size: 319320 pages
%------------------------------------------------------------------------------