TSTP Solution File: CSR084+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR084+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:24 EDT 2022
% Result : Theorem 2.59s 133.78s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 8
% Syntax : Number of formulae : 62 ( 16 unt; 0 def)
% Number of atoms : 207 ( 49 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 236 ( 91 ~; 112 |; 22 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 16 usr; 12 con; 0-3 aty)
% Number of variables : 158 ( 86 sgn 29 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
s__instance(s__BananaSlug10_1,s__Invertebrate),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_from_SUMO) ).
fof(kb_SUMO_3496,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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3496) ).
fof(kb_SUMO_502,axiom,
! [X26] : s__instance(X26,s__Entity),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_502) ).
fof(kb_SUMO_3533,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3533) ).
fof(kb_SUMO_3489,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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3489) ).
fof(local_7,axiom,
( s__instance(s__BodyPart10_1,s__BodyPart)
& s__component(s__BodyPart10_1,s__BananaSlug10_1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',local_7) ).
fof(kb_SUMO_1034,axiom,
! [X48] :
( ( s__instance(X48,s__Relation)
& s__instance(X48,s__PositiveInteger) )
=> ~ s__valence(X48,X48) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1034) ).
fof(kb_SUMO_2427,axiom,
! [X18] :
( s__instance(X18,s__Relation)
=> ( s__instance(X18,s__BinaryPredicate)
=> s__valence(X18,"2") ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_2427) ).
fof(c_0_8,negated_conjecture,
~ s__instance(s__BananaSlug10_1,s__Invertebrate),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
fof(c_0_9,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(esk158_3(X177,X178,X179),X179)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(esk159_3(X177,X178,X179),X177)
| X178 = s__UnionFn(X179,X177) )
& ( s__instance(esk160_3(X177,X178,X179),X178)
| X178 = s__UnionFn(X179,X177) )
& ( ~ s__instance(esk160_3(X177,X178,X179),X179)
| ~ s__instance(esk158_3(X177,X178,X179),X178)
| ~ s__instance(esk159_3(X177,X178,X179),X178)
| X178 = s__UnionFn(X179,X177) )
& ( ~ s__instance(esk160_3(X177,X178,X179),X177)
| ~ s__instance(esk158_3(X177,X178,X179),X178)
| ~ s__instance(esk159_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_3496])])])])])])]) ).
fof(c_0_10,negated_conjecture,
~ s__instance(s__BananaSlug10_1,s__Invertebrate),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(X3,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ s__instance(s__BananaSlug10_1,s__Invertebrate),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( X1 = X2
| s__instance(X3,s__SetOrClass) ),
inference(pm,[status(thm)],[c_0_11,c_0_11]) ).
fof(c_0_14,plain,
! [X27] : s__instance(X27,s__Entity),
inference(variable_rename,[status(thm)],[kb_SUMO_502]) ).
fof(c_0_15,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_3533])])])])]) ).
cnf(c_0_16,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__instance(s__BananaSlug10_1,X2) ),
inference(pm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
s__instance(X1,s__Entity),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( ~ s__instance(X1,X2)
| ~ s__instance(X2,s__NullSet)
| ~ s__instance(X2,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_21,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk160_3(X3,X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_22,plain,
! [X171,X172] :
( ( s__instance(X172,s__Set)
| X172 = X171 )
& ( s__instance(X171,s__Set)
| X172 = X171 )
& ( ~ s__element(esk157_2(X171,X172),X172)
| ~ s__element(esk157_2(X171,X172),X171)
| X172 = X171 )
& ( s__element(esk157_2(X171,X172),X172)
| s__element(esk157_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_3489])])])])])]) ).
cnf(c_0_23,plain,
( s__UnionFn(X1,X2) = s__NullSet
| ~ s__instance(X3,esk160_3(X2,s__NullSet,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( s__instance(X5,X1)
| X1 != s__UnionFn(X2,X3)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X4,X1)
| ~ s__instance(X5,X3)
| ~ s__instance(X6,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk158_3(X3,X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,plain,
( X1 = X2
| s__instance(X2,s__Set) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
( esk160_3(X1,s__NullSet,X2) = s__UnionFn(X3,X4)
| s__UnionFn(X2,X1) = s__NullSet ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_28,plain,
( s__instance(X1,X2)
| X2 != s__UnionFn(X3,X4)
| ~ s__instance(X5,X3)
| ~ s__instance(X1,X4)
| ~ s__instance(X6,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_19]),c_0_19]),c_0_19])]) ).
cnf(c_0_29,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(X4,s__Set)
| s__instance(X4,X2) ),
inference(pm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( s__instance(s__Invertebrate,s__Set)
| ~ s__instance(s__BananaSlug10_1,X1) ),
inference(pm,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_31,plain,
( s__UnionFn(X1,X2) = s__NullSet
| ~ s__instance(X3,s__UnionFn(X4,X5)) ),
inference(pm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_32,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk159_3(X3,X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,plain,
( s__instance(X1,s__Set)
| s__instance(X2,X3)
| s__instance(X1,X4)
| ~ s__instance(X5,X4)
| ~ s__instance(X2,X6)
| ~ s__instance(X7,X3) ),
inference(er,[status(thm)],[inference(pm,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_34,negated_conjecture,
s__instance(s__Invertebrate,s__Set),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_35,plain,
( X1 = s__UnionFn(X2,s__UnionFn(X3,X4))
| s__UnionFn(X5,X6) = s__NullSet ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( s__instance(X1,s__Set)
| s__instance(X2,X3)
| ~ s__instance(X2,X4)
| ~ s__instance(X5,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( s__UnionFn(X1,X2) = s__NullSet
| s__UnionFn(X3,X4) = s__NullSet
| X5 = X6 ),
inference(pm,[status(thm)],[c_0_35,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( s__instance(X1,s__Set)
| s__instance(X2,X3)
| ~ s__instance(X4,X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_39,plain,
( s__UnionFn(X1,X2) = s__NullSet
| X3 = X4 ),
inference(ef,[status(thm)],[c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( s__instance(X1,s__Set)
| s__instance(X2,s__Set) ),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_41,plain,
( s__UnionFn(X1,X2) = s__NullSet
| ~ s__instance(X3,X4)
| ~ s__instance(X5,X3) ),
inference(pm,[status(thm)],[c_0_20,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
s__instance(X1,s__Set),
inference(ef,[status(thm)],[c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( s__UnionFn(X1,X2) = s__NullSet
| ~ s__instance(X3,X4) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
s__instance(s__BodyPart10_1,s__BodyPart),
inference(split_conjunct,[status(thm)],[local_7]) ).
cnf(c_0_45,negated_conjecture,
s__UnionFn(X1,X2) = s__NullSet,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( s__instance(X1,X2)
| X2 != s__NullSet
| ~ s__instance(X3,X4)
| ~ s__instance(X1,X5)
| ~ s__instance(X6,X2) ),
inference(rw,[status(thm)],[c_0_28,c_0_45]) ).
cnf(c_0_47,plain,
( s__instance(X1,X2)
| X2 != s__NullSet
| ~ s__instance(X1,X3)
| ~ s__instance(X4,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( s__instance(X1,X2)
| X2 != s__NullSet
| ~ s__instance(X3,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_42]) ).
cnf(c_0_49,plain,
( X1 = s__NullSet
| s__instance(esk159_3(X2,X1,X3),X2) ),
inference(rw,[status(thm)],[c_0_32,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( X1 = s__NullSet
| s__instance(X2,X3)
| X3 != s__NullSet ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
fof(c_0_51,plain,
! [X49] :
( ~ s__instance(X49,s__Relation)
| ~ s__instance(X49,s__PositiveInteger)
| ~ s__valence(X49,X49) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[kb_SUMO_1034])])]) ).
fof(c_0_52,plain,
! [X19] :
( ~ s__instance(X19,s__Relation)
| ~ s__instance(X19,s__BinaryPredicate)
| s__valence(X19,"2") ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_2427])]) ).
cnf(c_0_53,negated_conjecture,
( X1 = s__NullSet
| s__instance(X2,s__NullSet) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_54,plain,
( ~ s__valence(X1,X1)
| ~ s__instance(X1,s__PositiveInteger)
| ~ s__instance(X1,s__Relation) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_55,plain,
( s__valence(X1,"2")
| ~ s__instance(X1,s__BinaryPredicate)
| ~ s__instance(X1,s__Relation) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( X1 = s__NullSet
| ~ s__instance(X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_53]) ).
cnf(c_0_57,plain,
( ~ s__instance("2",s__Relation)
| ~ s__instance("2",s__PositiveInteger)
| ~ s__instance("2",s__BinaryPredicate) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
X1 = s__NullSet,
inference(spm,[status(thm)],[c_0_56,c_0_44]) ).
cnf(c_0_59,plain,
~ s__instance("2",s__NullSet),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_58]),c_0_58])]) ).
cnf(c_0_60,plain,
s__instance(X1,s__NullSet),
inference(rw,[status(thm)],[c_0_17,c_0_58]) ).
cnf(c_0_61,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR084+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 10 04:00:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.98/25.03 eprover: CPU time limit exceeded, terminating
% 1.98/25.09 eprover: CPU time limit exceeded, terminating
% 1.98/25.25 eprover: CPU time limit exceeded, terminating
% 1.98/25.35 eprover: CPU time limit exceeded, terminating
% 2.12/48.29 eprover: CPU time limit exceeded, terminating
% 2.12/48.29 eprover: CPU time limit exceeded, terminating
% 2.12/48.29 eprover: CPU time limit exceeded, terminating
% 2.12/48.36 eprover: CPU time limit exceeded, terminating
% 2.23/71.31 eprover: CPU time limit exceeded, terminating
% 2.23/71.35 eprover: CPU time limit exceeded, terminating
% 2.25/71.47 eprover: CPU time limit exceeded, terminating
% 2.25/71.61 eprover: CPU time limit exceeded, terminating
% 2.37/94.37 eprover: CPU time limit exceeded, terminating
% 2.37/94.56 eprover: CPU time limit exceeded, terminating
% 2.37/94.79 eprover: CPU time limit exceeded, terminating
% 2.37/95.06 eprover: CPU time limit exceeded, terminating
% 2.50/117.71 eprover: CPU time limit exceeded, terminating
% 2.50/117.81 eprover: CPU time limit exceeded, terminating
% 2.50/117.97 eprover: CPU time limit exceeded, terminating
% 2.50/118.08 eprover: CPU time limit exceeded, terminating
% 2.59/133.78 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 2.59/133.78
% 2.59/133.78 # Failure: Resource limit exceeded (time)
% 2.59/133.78 # OLD status Res
% 2.59/133.78 # Preprocessing time : 0.559 s
% 2.59/133.78 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 2.59/133.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 2.59/133.78 # Preprocessing time : 0.235 s
% 2.59/133.78
% 2.59/133.78 # Failure: Out of unprocessed clauses!
% 2.59/133.78 # OLD status GaveUp
% 2.59/133.78 # Parsed axioms : 14795
% 2.59/133.78 # Removed by relevancy pruning/SinE : 14694
% 2.59/133.78 # Initial clauses : 101
% 2.59/133.78 # Removed in clause preprocessing : 0
% 2.59/133.78 # Initial clauses in saturation : 101
% 2.59/133.78 # Processed clauses : 111
% 2.59/133.78 # ...of these trivial : 1
% 2.59/133.78 # ...subsumed : 0
% 2.59/133.78 # ...remaining for further processing : 110
% 2.59/133.78 # Other redundant clauses eliminated : 0
% 2.59/133.78 # Clauses deleted for lack of memory : 0
% 2.59/133.78 # Backward-subsumed : 0
% 2.59/133.78 # Backward-rewritten : 0
% 2.59/133.78 # Generated clauses : 10
% 2.59/133.78 # ...of the previous two non-trivial : 10
% 2.59/133.78 # Contextual simplify-reflections : 0
% 2.59/133.78 # Paramodulations : 10
% 2.59/133.78 # Factorizations : 0
% 2.59/133.78 # Equation resolutions : 0
% 2.59/133.78 # Current number of processed clauses : 110
% 2.59/133.78 # Positive orientable unit clauses : 96
% 2.59/133.78 # Positive unorientable unit clauses: 0
% 2.59/133.78 # Negative unit clauses : 1
% 2.59/133.78 # Non-unit-clauses : 13
% 2.59/133.78 # Current number of unprocessed clauses: 0
% 2.59/133.78 # ...number of literals in the above : 0
% 2.59/133.78 # Current number of archived formulas : 0
% 2.59/133.78 # Current number of archived clauses : 0
% 2.59/133.78 # Clause-clause subsumption calls (NU) : 9
% 2.59/133.78 # Rec. Clause-clause subsumption calls : 3
% 2.59/133.78 # Non-unit clause-clause subsumptions : 0
% 2.59/133.78 # Unit Clause-clause subsumption calls : 0
% 2.59/133.78 # Rewrite failures with RHS unbound : 0
% 2.59/133.78 # BW rewrite match attempts : 0
% 2.59/133.78 # BW rewrite match successes : 0
% 2.59/133.78 # Condensation attempts : 0
% 2.59/133.78 # Condensation successes : 0
% 2.59/133.78 # Termbank termtop insertions : 109174
% 2.59/133.78
% 2.59/133.78 # -------------------------------------------------
% 2.59/133.78 # User time : 0.223 s
% 2.59/133.78 # System time : 0.014 s
% 2.59/133.78 # Total time : 0.237 s
% 2.59/133.78 # Maximum resident set size: 22472 pages
% 2.59/133.78 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 2.59/133.78
% 2.59/133.78 # Failure: Resource limit exceeded (time)
% 2.59/133.78 # OLD status Res
% 2.59/133.78 # Preprocessing time : 0.555 s
% 2.59/133.78 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 2.59/133.78
% 2.59/133.78 # Failure: Resource limit exceeded (time)
% 2.59/133.78 # OLD status Res
% 2.59/133.78 # Preprocessing time : 0.551 s
% 2.59/133.78 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 2.59/133.78
% 2.59/133.78 # Failure: Resource limit exceeded (time)
% 2.59/133.78 # OLD status Res
% 2.59/133.78 # Preprocessing time : 0.535 s
% 2.59/133.78 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 2.59/133.78 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 2.59/133.78 # Preprocessing time : 0.149 s
% 2.59/133.78
% 2.59/133.78 # Failure: Out of unprocessed clauses!
% 2.59/133.78 # OLD status GaveUp
% 2.59/133.78 # Parsed axioms : 14795
% 2.59/133.78 # Removed by relevancy pruning/SinE : 14709
% 2.59/133.78 # Initial clauses : 86
% 2.59/133.78 # Removed in clause preprocessing : 0
% 2.59/133.78 # Initial clauses in saturation : 86
% 2.59/133.78 # Processed clauses : 107
% 2.59/133.78 # ...of these trivial : 2
% 2.59/133.78 # ...subsumed : 0
% 2.59/133.78 # ...remaining for further processing : 105
% 2.59/133.78 # Other redundant clauses eliminated : 0
% 2.59/133.78 # Clauses deleted for lack of memory : 0
% 2.59/133.78 # Backward-subsumed : 0
% 2.59/133.78 # Backward-rewritten : 1
% 2.59/133.78 # Generated clauses : 21
% 2.59/133.78 # ...of the previous two non-trivial : 21
% 2.59/133.78 # Contextual simplify-reflections : 0
% 2.59/133.78 # Paramodulations : 21
% 2.59/133.78 # Factorizations : 0
% 2.59/133.78 # Equation resolutions : 0
% 2.59/133.78 # Current number of processed clauses : 104
% 2.59/133.78 # Positive orientable unit clauses : 79
% 2.59/133.78 # Positive unorientable unit clauses: 0
% 2.59/133.78 # Negative unit clauses : 1
% 2.59/133.78 # Non-unit-clauses : 24
% 2.59/133.78 # Current number of unprocessed clauses: 0
% 2.59/133.78 # ...number of literals in the above : 0
% 2.59/133.78 # Current number of archived formulas : 0
% 2.59/133.78 # Current number of archived clauses : 1
% 2.59/133.78 # Clause-clause subsumption calls (NU) : 1
% 2.59/133.78 # Rec. Clause-clause subsumption calls : 0
% 2.59/133.78 # Non-unit clause-clause subsumptions : 0
% 2.59/133.78 # Unit Clause-clause subsumption calls : 3
% 2.59/133.78 # Rewrite failures with RHS unbound : 0
% 2.59/133.78 # BW rewrite match attempts : 1
% 2.59/133.78 # BW rewrite match successes : 1
% 2.59/133.78 # Condensation attempts : 0
% 2.59/133.78 # Condensation successes : 0
% 2.59/133.78 # Termbank termtop insertions : 109076
% 2.59/133.78
% 2.59/133.78 # -------------------------------------------------
% 2.59/133.78 # User time : 0.140 s
% 2.59/133.78 # System time : 0.011 s
% 2.59/133.78 # Total time : 0.151 s
% 2.59/133.78 # Maximum resident set size: 22204 pages
% 2.59/133.78 # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 2.59/133.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 2.59/133.78 # Preprocessing time : 0.148 s
% 2.59/133.78
% 2.59/133.78 # Failure: Out of unprocessed clauses!
% 2.59/133.78 # OLD status GaveUp
% 2.59/133.78 # Parsed axioms : 14795
% 2.59/133.78 # Removed by relevancy pruning/SinE : 14686
% 2.59/133.78 # Initial clauses : 109
% 2.59/133.78 # Removed in clause preprocessing : 0
% 2.59/133.78 # Initial clauses in saturation : 109
% 2.59/133.78 # Processed clauses : 136
% 2.59/133.78 # ...of these trivial : 1
% 2.59/133.78 # ...subsumed : 9
% 2.59/133.78 # ...remaining for further processing : 126
% 2.59/133.78 # Other redundant clauses eliminated : 0
% 2.59/133.78 # Clauses deleted for lack of memory : 0
% 2.59/133.78 # Backward-subsumed : 0
% 2.59/133.78 # Backward-rewritten : 2
% 2.59/133.78 # Generated clauses : 36
% 2.59/133.78 # ...of the previous two non-trivial : 27
% 2.59/133.78 # Contextual simplify-reflections : 0
% 2.59/133.78 # Paramodulations : 36
% 2.59/133.78 # Factorizations : 0
% 2.59/133.78 # Equation resolutions : 0
% 2.59/133.78 # Current number of processed clauses : 124
% 2.59/133.78 # Positive orientable unit clauses : 102
% 2.59/133.78 # Positive unorientable unit clauses: 0
% 2.59/133.78 # Negative unit clauses : 1
% 2.59/133.78 # Non-unit-clauses : 21
% 2.59/133.78 # Current number of unprocessed clauses: 0
% 2.59/133.78 # ...number of literals in the above : 0
% 2.59/133.78 # Current number of archived formulas : 0
% 2.59/133.78 # Current number of archived clauses : 2
% 2.59/133.78 # Clause-clause subsumption calls (NU) : 14
% 2.59/133.78 # Rec. Clause-clause subsumption calls : 9
% 2.59/133.78 # Non-unit clause-clause subsumptions : 9
% 2.59/133.78 # Unit Clause-clause subsumption calls : 0
% 2.59/133.78 # Rewrite failures with RHS unbound : 0
% 2.59/133.78 # BW rewrite match attempts : 2
% 2.59/133.78 # BW rewrite match successes : 2
% 2.59/133.78 # Condensation attempts : 0
% 2.59/133.78 # Condensation successes : 0
% 2.59/133.78 # Termbank termtop insertions : 109792
% 2.59/133.78
% 2.59/133.78 # -------------------------------------------------
% 2.59/133.78 # User time : 0.143 s
% 2.59/133.78 # System time : 0.008 s
% 2.59/133.78 # Total time : 0.151 s
% 2.59/133.78 # Maximum resident set size: 22600 pages
% 2.59/133.78 # Running protocol protocol_eprover_03d534503f753dd3be02bb3c547fa7a3e34e825e for 23 seconds:
% 2.59/133.78
% 2.59/133.78 # Failure: Resource limit exceeded (time)
% 2.59/133.78 # OLD status Res
% 2.59/133.78 # Preprocessing time : 0.452 s
% 2.59/133.78 # Running protocol protocol_eprover_f8481b8ca6e1cbe7ac35251a2832c4c110836158 for 23 seconds:
% 2.59/133.78 # SinE strategy is GSinE(CountFormulas,,1.2,,02,60,1.0)
% 2.59/133.78 # Preprocessing time : 0.232 s
% 2.59/133.78
% 2.59/133.78 # Failure: Out of unprocessed clauses!
% 2.59/133.78 # OLD status GaveUp
% 2.59/133.78 # Parsed axioms : 14795
% 2.59/133.78 # Removed by relevancy pruning/SinE : 14734
% 2.59/133.78 # Initial clauses : 61
% 2.59/133.78 # Removed in clause preprocessing : 0
% 2.59/133.78 # Initial clauses in saturation : 61
% 2.59/133.78 # Processed clauses : 69
% 2.59/133.78 # ...of these trivial : 1
% 2.59/133.78 # ...subsumed : 0
% 2.59/133.78 # ...remaining for further processing : 68
% 2.59/133.78 # Other redundant clauses eliminated : 0
% 2.59/133.78 # Clauses deleted for lack of memory : 0
% 2.59/133.78 # Backward-subsumed : 0
% 2.59/133.78 # Backward-rewritten : 0
% 2.59/133.78 # Generated clauses : 8
% 2.59/133.78 # ...of the previous two non-trivial : 8
% 2.59/133.78 # Contextual simplify-reflections : 0
% 2.59/133.78 # Paramodulations : 8
% 2.59/133.78 # Factorizations : 0
% 2.59/133.78 # Equation resolutions : 0
% 2.59/133.78 # Current number of processed clauses : 68
% 2.59/133.78 # Positive orientable unit clauses : 56
% 2.59/133.78 # Positive unorientable unit clauses: 0
% 2.59/133.78 # Negative unit clauses : 1
% 2.59/133.78 # Non-unit-clauses : 11
% 2.59/133.78 # Current number of unprocessed clauses: 0
% 2.59/133.78 # ...number of literals in the above : 0
% 2.59/133.78 # Current number of archived formulas : 0
% 2.59/133.78 # Current number of archived clauses : 0
% 2.59/133.78 # Clause-clause subsumption calls (NU) : 2
% 2.59/133.78 # Rec. Clause-clause subsumption calls : 1
% 2.59/133.78 # Non-unit clause-clause subsumptions : 0
% 2.59/133.78 # Unit Clause-clause subsumption calls : 0
% 2.59/133.78 # Rewrite failures with RHS unbound : 0
% 2.59/133.78 # BW rewrite match attempts : 0
% 2.59/133.78 # BW rewrite match successes : 0
% 2.59/133.78 # Condensation attempts : 0
% 2.59/133.78 # Condensation successes : 0
% 2.59/133.78 # Termbank termtop insertions : 108427
% 2.59/133.78
% 2.59/133.78 # -------------------------------------------------
% 2.59/133.78 # User time : 0.217 s
% 2.59/133.78 # System time : 0.016 s
% 2.59/133.78 # Total time : 0.233 s
% 2.59/133.78 # Maximum resident set size: 22276 pages
% 2.59/133.78 # Running protocol protocol_eprover_4692c23f3ccd5aecc2adbd7957ddb4b4144a02c8 for 23 seconds:
% 2.59/133.78 # Preprocessing time : 0.420 s
% 2.59/133.78
% 2.59/133.78 # Proof found!
% 2.59/133.78 # SZS status Theorem
% 2.59/133.78 # SZS output start CNFRefutation
% See solution above
% 2.59/133.78 # Proof object total steps : 62
% 2.59/133.78 # Proof object clause steps : 46
% 2.59/133.78 # Proof object formula steps : 16
% 2.59/133.78 # Proof object conjectures : 19
% 2.59/133.78 # Proof object clause conjectures : 16
% 2.59/133.78 # Proof object formula conjectures : 3
% 2.59/133.78 # Proof object initial clauses used : 12
% 2.59/133.78 # Proof object initial formulas used : 8
% 2.59/133.78 # Proof object generating inferences : 27
% 2.59/133.78 # Proof object simplifying inferences : 16
% 2.59/133.78 # Training examples: 0 positive, 0 negative
% 2.59/133.78 # Parsed axioms : 14795
% 2.59/133.78 # Removed by relevancy pruning/SinE : 0
% 2.59/133.78 # Initial clauses : 15989
% 2.59/133.78 # Removed in clause preprocessing : 63
% 2.59/133.78 # Initial clauses in saturation : 15926
% 2.59/133.78 # Processed clauses : 24161
% 2.59/133.78 # ...of these trivial : 1495
% 2.59/133.78 # ...subsumed : 2223
% 2.59/133.78 # ...remaining for further processing : 20443
% 2.59/133.78 # Other redundant clauses eliminated : 3081
% 2.59/133.78 # Clauses deleted for lack of memory : 964933
% 2.59/133.78 # Backward-subsumed : 158
% 2.59/133.78 # Backward-rewritten : 20253
% 2.59/133.78 # Generated clauses : 1496938
% 2.59/133.78 # ...of the previous two non-trivial : 1501543
% 2.59/133.78 # Contextual simplify-reflections : 0
% 2.59/133.78 # Paramodulations : 1493701
% 2.59/133.78 # Factorizations : 56
% 2.59/133.78 # Equation resolutions : 3179
% 2.59/133.78 # Current number of processed clauses : 21
% 2.59/133.78 # Positive orientable unit clauses : 5
% 2.59/133.78 # Positive unorientable unit clauses: 1
% 2.59/133.78 # Negative unit clauses : 3
% 2.59/133.78 # Non-unit-clauses : 12
% 2.59/133.78 # Current number of unprocessed clauses: 9363
% 2.59/133.78 # ...number of literals in the above : 16451
% 2.59/133.78 # Current number of archived formulas : 0
% 2.59/133.78 # Current number of archived clauses : 20413
% 2.59/133.78 # Clause-clause subsumption calls (NU) : 6964302
% 2.59/133.78 # Rec. Clause-clause subsumption calls : 5343665
% 2.59/133.78 # Non-unit clause-clause subsumptions : 1891
% 2.59/133.78 # Unit Clause-clause subsumption calls : 4693966
% 2.59/133.78 # Rewrite failures with RHS unbound : 223
% 2.59/133.78 # BW rewrite match attempts : 30364
% 2.59/133.78 # BW rewrite match successes : 5323
% 2.59/133.78 # Condensation attempts : 0
% 2.59/133.78 # Condensation successes : 0
% 2.59/133.78 # Termbank termtop insertions : 14526521
% 2.59/133.78
% 2.59/133.78 # -------------------------------------------------
% 2.59/133.78 # User time : 15.012 s
% 2.59/133.78 # System time : 0.176 s
% 2.59/133.78 # Total time : 15.188 s
% 2.59/133.78 # Maximum resident set size: 211748 pages
% 2.59/140.82 eprover: CPU time limit exceeded, terminating
% 2.59/140.84 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.59/140.84 eprover: No such file or directory
% 2.59/140.85 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.59/140.85 eprover: No such file or directory
% 2.59/140.85 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.59/140.85 eprover: No such file or directory
%------------------------------------------------------------------------------