TSTP Solution File: SET171+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET171+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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 : Tue Jul 19 00:49:50 EDT 2022
% Result : Theorem 0.45s 46.63s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 58 ( 14 unt; 0 def)
% Number of atoms : 140 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 159 ( 77 ~; 65 |; 11 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 16 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI11,conjecture,
! [X1,X2,X6] : equal_set(union(X1,intersection(X2,X6)),intersection(union(X1,X2),union(X1,X6))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI11) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',power_set) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X6] : equal_set(union(X1,intersection(X2,X6)),intersection(union(X1,X2),union(X1,X6))),
inference(assume_negation,[status(cth)],[thI11]) ).
fof(c_0_7,negated_conjecture,
~ equal_set(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| ~ equal_set(X3,X4) )
& ( subset(X4,X3)
| ~ equal_set(X3,X4) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| equal_set(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])])]) ).
cnf(c_0_9,negated_conjecture,
~ equal_set(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[subset])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ subset(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0)))
| ~ subset(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))) ),
inference(pm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X4,X5,X4,X5] :
( ( ~ member(X4,power_set(X5))
| subset(X4,X5) )
& ( ~ subset(X4,X5)
| member(X4,power_set(X5)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])])])]) ).
cnf(c_0_15,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)))
| ~ subset(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(pm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X4,X5)
| ~ member(X4,intersection(X5,X6)) )
& ( member(X4,X6)
| ~ member(X4,intersection(X5,X6)) )
& ( ~ member(X4,X5)
| ~ member(X4,X6)
| member(X4,intersection(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])])]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)))
| ~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X4,union(X5,X6))
| member(X4,X5)
| member(X4,X6) )
& ( ~ member(X4,X5)
| member(X4,union(X5,X6)) )
& ( ~ member(X4,X6)
| member(X4,union(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)))
| ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(pm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| ~ subset(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))) ),
inference(pm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk6_0))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk5_0))
| ~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk6_0))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk5_0)) ),
inference(pm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_27,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| ~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk4_0)
| ~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk5_0))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0) ),
inference(pm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,negated_conjecture,
( member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),intersection(esk5_0,esk6_0))
| ~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_35,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0)
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk5_0) ),
inference(pm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0)
| ~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( member(X1,power_set(X2))
| ~ member(esk1_2(X1,X2),X2) ),
inference(pm,[status(thm)],[c_0_34,c_0_13]) ).
cnf(c_0_38,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_39,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_40,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),union(esk4_0,esk5_0))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0)
| ~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_41,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0)))
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk5_0) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk5_0)
| ~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_43,plain,
( member(esk1_2(X1,X2),X1)
| member(X3,X2)
| ~ member(X3,X1) ),
inference(pm,[status(thm)],[c_0_39,c_0_18]) ).
cnf(c_0_44,plain,
( member(esk1_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(pm,[status(thm)],[c_0_34,c_0_18]) ).
cnf(c_0_45,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk6_0)
| ~ member(esk1_2(union(esk4_0,intersection(esk5_0,esk6_0)),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),esk5_0)
| ~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_40,c_0_27]) ).
cnf(c_0_46,negated_conjecture,
~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,intersection(esk5_0,esk6_0))),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_41,c_0_42]),c_0_37]) ).
cnf(c_0_47,plain,
( member(esk1_2(X1,X2),X3)
| member(esk1_2(X1,X3),X1)
| member(X1,power_set(X2)) ),
inference(pm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
~ member(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),power_set(union(esk4_0,intersection(esk5_0,esk6_0)))),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_45,c_0_36]),c_0_42]) ).
cnf(c_0_49,negated_conjecture,
member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0))),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_50,negated_conjecture,
~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),intersection(esk5_0,esk6_0)),
inference(pm,[status(thm)],[c_0_46,c_0_27]) ).
cnf(c_0_51,negated_conjecture,
member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,esk5_0)),
inference(pm,[status(thm)],[c_0_38,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk4_0),
inference(pm,[status(thm)],[c_0_46,c_0_25]) ).
cnf(c_0_53,negated_conjecture,
( ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk6_0)
| ~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk5_0) ),
inference(pm,[status(thm)],[c_0_50,c_0_20]) ).
cnf(c_0_54,negated_conjecture,
member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk5_0),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_28,c_0_51]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),union(esk4_0,esk6_0)),
inference(pm,[status(thm)],[c_0_32,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
~ member(esk1_2(intersection(union(esk4_0,esk5_0),union(esk4_0,esk6_0)),union(esk4_0,intersection(esk5_0,esk6_0))),esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_28,c_0_55]),c_0_56]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET171+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.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 : Sun Jul 10 06:24:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.33/23.39 eprover: CPU time limit exceeded, terminating
% 0.33/23.40 eprover: CPU time limit exceeded, terminating
% 0.33/23.40 eprover: CPU time limit exceeded, terminatingeprover:
% 0.33/23.40 CPU time limit exceeded, terminating
% 0.45/46.42 eprover: CPU time limit exceeded, terminating
% 0.45/46.42 eprover: CPU time limit exceeded, terminating
% 0.45/46.44 eprover: CPU time limit exceeded, terminating
% 0.45/46.45 eprover: CPU time limit exceeded, terminating
% 0.45/46.63 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.45/46.63
% 0.45/46.63 # Failure: Resource limit exceeded (time)
% 0.45/46.63 # OLD status Res
% 0.45/46.63 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.45/46.63 # Preprocessing time : 0.015 s
% 0.45/46.63 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.45/46.63
% 0.45/46.63 # Failure: Resource limit exceeded (time)
% 0.45/46.63 # OLD status Res
% 0.45/46.63 # Preprocessing time : 0.011 s
% 0.45/46.63 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.45/46.63 # Preprocessing time : 0.016 s
% 0.45/46.63
% 0.45/46.63 # Proof found!
% 0.45/46.63 # SZS status Theorem
% 0.45/46.63 # SZS output start CNFRefutation
% See solution above
% 0.45/46.63 # Proof object total steps : 58
% 0.45/46.63 # Proof object clause steps : 45
% 0.45/46.63 # Proof object formula steps : 13
% 0.45/46.63 # Proof object conjectures : 32
% 0.45/46.63 # Proof object clause conjectures : 29
% 0.45/46.63 # Proof object formula conjectures : 3
% 0.45/46.63 # Proof object initial clauses used : 13
% 0.45/46.63 # Proof object initial formulas used : 6
% 0.45/46.63 # Proof object generating inferences : 31
% 0.45/46.63 # Proof object simplifying inferences : 11
% 0.45/46.63 # Training examples: 0 positive, 0 negative
% 0.45/46.63 # Parsed axioms : 12
% 0.45/46.63 # Removed by relevancy pruning/SinE : 0
% 0.45/46.63 # Initial clauses : 30
% 0.45/46.63 # Removed in clause preprocessing : 0
% 0.45/46.63 # Initial clauses in saturation : 30
% 0.45/46.63 # Processed clauses : 322
% 0.45/46.63 # ...of these trivial : 0
% 0.45/46.63 # ...subsumed : 29
% 0.45/46.63 # ...remaining for further processing : 293
% 0.45/46.63 # Other redundant clauses eliminated : 9
% 0.45/46.63 # Clauses deleted for lack of memory : 0
% 0.45/46.63 # Backward-subsumed : 8
% 0.45/46.63 # Backward-rewritten : 9
% 0.45/46.63 # Generated clauses : 5825
% 0.45/46.63 # ...of the previous two non-trivial : 5642
% 0.45/46.63 # Contextual simplify-reflections : 16
% 0.45/46.63 # Paramodulations : 5800
% 0.45/46.63 # Factorizations : 16
% 0.45/46.63 # Equation resolutions : 9
% 0.45/46.63 # Current number of processed clauses : 273
% 0.45/46.63 # Positive orientable unit clauses : 51
% 0.45/46.63 # Positive unorientable unit clauses: 0
% 0.45/46.63 # Negative unit clauses : 54
% 0.45/46.63 # Non-unit-clauses : 168
% 0.45/46.63 # Current number of unprocessed clauses: 5078
% 0.45/46.63 # ...number of literals in the above : 12361
% 0.45/46.63 # Current number of archived formulas : 0
% 0.45/46.63 # Current number of archived clauses : 17
% 0.45/46.63 # Clause-clause subsumption calls (NU) : 7358
% 0.45/46.63 # Rec. Clause-clause subsumption calls : 5648
% 0.45/46.63 # Non-unit clause-clause subsumptions : 29
% 0.45/46.63 # Unit Clause-clause subsumption calls : 2467
% 0.45/46.63 # Rewrite failures with RHS unbound : 0
% 0.45/46.63 # BW rewrite match attempts : 220
% 0.45/46.63 # BW rewrite match successes : 7
% 0.45/46.63 # Condensation attempts : 0
% 0.45/46.63 # Condensation successes : 0
% 0.45/46.63 # Termbank termtop insertions : 61285
% 0.45/46.63
% 0.45/46.63 # -------------------------------------------------
% 0.45/46.63 # User time : 0.101 s
% 0.45/46.63 # System time : 0.003 s
% 0.45/46.63 # Total time : 0.104 s
% 0.45/46.63 # Maximum resident set size: 8956 pages
%------------------------------------------------------------------------------