TSTP Solution File: SET169+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET169+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:48 EDT 2022
% Result : Theorem 0.62s 69.79s
% Output : CNFRefutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 59 ( 14 unt; 0 def)
% Number of atoms : 144 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 162 ( 77 ~; 68 |; 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(thI10,conjecture,
! [X1,X2,X6] : equal_set(intersection(X1,union(X2,X6)),union(intersection(X1,X2),intersection(X1,X6))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI10) ).
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(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(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(c_0_6,negated_conjecture,
~ ! [X1,X2,X6] : equal_set(intersection(X1,union(X2,X6)),union(intersection(X1,X2),intersection(X1,X6))),
inference(assume_negation,[status(cth)],[thI10]) ).
fof(c_0_7,negated_conjecture,
~ equal_set(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(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(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(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(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ subset(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(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),X1) ),
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,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,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_17,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))
| ~ subset(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))) ),
inference(pm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ subset(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))) ),
inference(pm,[status(thm)],[c_0_12,c_0_15]) ).
fof(c_0_20,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_21,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,union(esk5_0,esk6_0)))
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,esk5_0))
| member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,esk6_0))
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,union(esk5_0,esk6_0))) ),
inference(pm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),union(esk5_0,esk6_0))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),intersection(esk4_0,esk5_0))
| member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk6_0)
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),union(esk5_0,esk6_0))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0) ),
inference(pm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_33,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk6_0)
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk6_0)
| member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk5_0)
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_31,c_0_26]),c_0_31]) ).
cnf(c_0_37,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk5_0) ),
inference(pm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk5_0)
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
( member(X1,power_set(X2))
| ~ member(esk1_2(X1,X2),X2) ),
inference(pm,[status(thm)],[c_0_37,c_0_15]) ).
cnf(c_0_41,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_43,plain,
( member(esk1_2(X1,X2),X1)
| member(X3,X2)
| ~ member(X3,X1) ),
inference(pm,[status(thm)],[c_0_41,c_0_13]) ).
cnf(c_0_44,plain,
( member(esk1_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(pm,[status(thm)],[c_0_37,c_0_13]) ).
cnf(c_0_45,negated_conjecture,
( ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ member(esk1_2(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)),intersection(esk4_0,union(esk5_0,esk6_0))),esk5_0)
| ~ member(intersection(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))) ),
inference(pm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_46,negated_conjecture,
~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_42,c_0_36]),c_0_40]) ).
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(esk4_0,union(esk5_0,esk6_0)),power_set(union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0)))),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_45,c_0_39]),c_0_36]) ).
cnf(c_0_49,negated_conjecture,
~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),intersection(esk4_0,esk6_0)),
inference(pm,[status(thm)],[c_0_46,c_0_29]) ).
cnf(c_0_50,negated_conjecture,
member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),intersection(esk4_0,union(esk5_0,esk6_0))),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_51,negated_conjecture,
~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),intersection(esk4_0,esk5_0)),
inference(pm,[status(thm)],[c_0_46,c_0_33]) ).
cnf(c_0_52,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),esk6_0)
| ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),esk4_0) ),
inference(pm,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_53,negated_conjecture,
member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),esk4_0),
inference(pm,[status(thm)],[c_0_31,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),esk5_0)
| ~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),esk4_0) ),
inference(pm,[status(thm)],[c_0_51,c_0_24]) ).
cnf(c_0_55,negated_conjecture,
member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),union(esk5_0,esk6_0)),
inference(pm,[status(thm)],[c_0_25,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_57,negated_conjecture,
~ member(esk1_2(intersection(esk4_0,union(esk5_0,esk6_0)),union(intersection(esk4_0,esk5_0),intersection(esk4_0,esk6_0))),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_53])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_21,c_0_55]),c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET169+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 10 01:09:13 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/23.43 eprover: CPU time limit exceeded, terminating
% 0.36/23.43 eprover: CPU time limit exceeded, terminating
% 0.36/23.43 eprover: CPU time limit exceeded, terminating
% 0.49/46.44 eprover: CPU time limit exceeded, terminating
% 0.49/46.45 eprover: CPU time limit exceeded, terminating
% 0.49/46.45 eprover: CPU time limit exceeded, terminating
% 0.49/46.46 eprover: CPU time limit exceeded, terminating
% 0.62/69.46 eprover: CPU time limit exceeded, terminating
% 0.62/69.46 eprover: CPU time limit exceeded, terminating
% 0.62/69.47 eprover: CPU time limit exceeded, terminating
% 0.62/69.48 eprover: CPU time limit exceeded, terminating
% 0.62/69.79 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.62/69.79
% 0.62/69.79 # Failure: Resource limit exceeded (time)
% 0.62/69.79 # OLD status Res
% 0.62/69.79 # Preprocessing time : 0.017 s
% 0.62/69.79 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.62/69.79
% 0.62/69.79 # Failure: Resource limit exceeded (time)
% 0.62/69.79 # OLD status Res
% 0.62/69.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.62/69.79 # Preprocessing time : 0.010 s
% 0.62/69.79 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 0.62/69.79
% 0.62/69.79 # Failure: Resource limit exceeded (time)
% 0.62/69.79 # OLD status Res
% 0.62/69.79 # Preprocessing time : 0.020 s
% 0.62/69.79 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 0.62/69.79 # Preprocessing time : 0.018 s
% 0.62/69.79
% 0.62/69.79 # Proof found!
% 0.62/69.79 # SZS status Theorem
% 0.62/69.79 # SZS output start CNFRefutation
% See solution above
% 0.62/69.79 # Proof object total steps : 59
% 0.62/69.79 # Proof object clause steps : 46
% 0.62/69.79 # Proof object formula steps : 13
% 0.62/69.79 # Proof object conjectures : 33
% 0.62/69.79 # Proof object clause conjectures : 30
% 0.62/69.79 # Proof object formula conjectures : 3
% 0.62/69.79 # Proof object initial clauses used : 13
% 0.62/69.79 # Proof object initial formulas used : 6
% 0.62/69.79 # Proof object generating inferences : 31
% 0.62/69.79 # Proof object simplifying inferences : 12
% 0.62/69.79 # Training examples: 0 positive, 0 negative
% 0.62/69.79 # Parsed axioms : 12
% 0.62/69.79 # Removed by relevancy pruning/SinE : 0
% 0.62/69.79 # Initial clauses : 30
% 0.62/69.79 # Removed in clause preprocessing : 0
% 0.62/69.79 # Initial clauses in saturation : 30
% 0.62/69.79 # Processed clauses : 240
% 0.62/69.79 # ...of these trivial : 8
% 0.62/69.79 # ...subsumed : 7
% 0.62/69.79 # ...remaining for further processing : 225
% 0.62/69.79 # Other redundant clauses eliminated : 11
% 0.62/69.79 # Clauses deleted for lack of memory : 0
% 0.62/69.79 # Backward-subsumed : 10
% 0.62/69.79 # Backward-rewritten : 8
% 0.62/69.79 # Generated clauses : 3969
% 0.62/69.79 # ...of the previous two non-trivial : 3883
% 0.62/69.79 # Contextual simplify-reflections : 11
% 0.62/69.79 # Paramodulations : 3938
% 0.62/69.79 # Factorizations : 20
% 0.62/69.79 # Equation resolutions : 11
% 0.62/69.79 # Current number of processed clauses : 204
% 0.62/69.79 # Positive orientable unit clauses : 36
% 0.62/69.79 # Positive unorientable unit clauses: 0
% 0.62/69.79 # Negative unit clauses : 12
% 0.62/69.79 # Non-unit-clauses : 156
% 0.62/69.79 # Current number of unprocessed clauses: 3590
% 0.62/69.79 # ...number of literals in the above : 10845
% 0.62/69.79 # Current number of archived formulas : 0
% 0.62/69.79 # Current number of archived clauses : 18
% 0.62/69.79 # Clause-clause subsumption calls (NU) : 7161
% 0.62/69.79 # Rec. Clause-clause subsumption calls : 5820
% 0.62/69.79 # Non-unit clause-clause subsumptions : 22
% 0.62/69.79 # Unit Clause-clause subsumption calls : 889
% 0.62/69.79 # Rewrite failures with RHS unbound : 0
% 0.62/69.79 # BW rewrite match attempts : 55
% 0.62/69.79 # BW rewrite match successes : 5
% 0.62/69.79 # Condensation attempts : 0
% 0.62/69.79 # Condensation successes : 0
% 0.62/69.79 # Termbank termtop insertions : 48123
% 0.62/69.79
% 0.62/69.79 # -------------------------------------------------
% 0.62/69.79 # User time : 0.078 s
% 0.62/69.79 # System time : 0.003 s
% 0.62/69.79 # Total time : 0.081 s
% 0.62/69.79 # Maximum resident set size: 7372 pages
% 0.62/92.48 eprover: CPU time limit exceeded, terminating
% 0.62/92.48 eprover: CPU time limit exceeded, terminating
% 0.62/92.49 eprover: CPU time limit exceeded, terminating
% 0.62/92.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.50 eprover: No such file or directory
% 0.62/92.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.50 eprover: No such file or directory
% 0.62/92.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.50 eprover: No such file or directory
% 0.62/92.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.50 eprover: No such file or directory
% 0.62/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.51 eprover: No such file or directory
% 0.62/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.51 eprover: No such file or directory
% 0.62/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.51 eprover: No such file or directory
% 0.62/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.51 eprover: No such file or directory
% 0.62/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.52 eprover: No such file or directory
% 0.62/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.52 eprover: No such file or directory
% 0.62/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.52 eprover: No such file or directory
% 0.62/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.52 eprover: No such file or directory
% 0.62/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.52 eprover: No such file or directory
% 0.62/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.52 eprover: No such file or directory
% 0.62/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.52 eprover: No such file or directory
% 0.62/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.53 eprover: No such file or directory
% 0.62/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.53 eprover: No such file or directory
% 0.62/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.53 eprover: No such file or directory
% 0.62/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.53 eprover: No such file or directory
% 0.62/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.53 eprover: No such file or directory
% 0.62/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.62/92.53 eprover: No such file or directory
% 0.62/92.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.54 eprover: No such file or directory
% 0.62/92.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.62/92.54 eprover: No such file or directory
%------------------------------------------------------------------------------