TSTP Solution File: SET888+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET888+1 : TPTP v8.1.0. Released v3.2.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 : Tue Jul 19 00:55:13 EDT 2022

% Result   : Theorem 0.86s 120.03s
% Output   : CNFRefutation 0.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   50 (  15 unt;   0 def)
%            Number of atoms       :  156 (  88 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  156 (  50   ~;  86   |;  12   &)
%                                         (   6 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-3 aty)
%            Number of variables   :  123 (  10 sgn  46   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t1_xboole_0,axiom,
    ! [X1,X2,X3] :
      ( in(X1,symmetric_difference(X2,X3))
    <=> ~ ( in(X1,X2)
        <=> in(X1,X3) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t1_xboole_0) ).

fof(d6_xboole_0,axiom,
    ! [X1,X2] : symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d6_xboole_0) ).

fof(d1_tarski,axiom,
    ! [X1,X2] :
      ( X2 = singleton(X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> X3 = X1 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d1_tarski) ).

fof(d2_tarski,axiom,
    ! [X1,X2,X3] :
      ( X3 = unordered_pair(X1,X2)
    <=> ! [X4] :
          ( in(X4,X3)
        <=> ( X4 = X1
            | X4 = X2 ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d2_tarski) ).

fof(t29_zfmisc_1,conjecture,
    ! [X1,X2] :
      ( X1 != X2
     => symmetric_difference(singleton(X1),singleton(X2)) = unordered_pair(X1,X2) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t29_zfmisc_1) ).

fof(commutativity_k2_tarski,axiom,
    ! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',commutativity_k2_tarski) ).

fof(commutativity_k2_xboole_0,axiom,
    ! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',commutativity_k2_xboole_0) ).

fof(c_0_7,plain,
    ! [X4,X5,X6,X4,X5,X6] :
      ( ( ~ in(X4,X5)
        | ~ in(X4,X6)
        | ~ in(X4,symmetric_difference(X5,X6)) )
      & ( in(X4,X5)
        | in(X4,X6)
        | ~ in(X4,symmetric_difference(X5,X6)) )
      & ( ~ in(X4,X5)
        | in(X4,X6)
        | in(X4,symmetric_difference(X5,X6)) )
      & ( ~ in(X4,X6)
        | in(X4,X5)
        | in(X4,symmetric_difference(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)],[t1_xboole_0])])])])]) ).

fof(c_0_8,plain,
    ! [X3,X4] : symmetric_difference(X3,X4) = set_union2(set_difference(X3,X4),set_difference(X4,X3)),
    inference(variable_rename,[status(thm)],[d6_xboole_0]) ).

fof(c_0_9,plain,
    ! [X4,X5,X6,X6,X4,X5] :
      ( ( ~ in(X6,X5)
        | X6 = X4
        | X5 != singleton(X4) )
      & ( X6 != X4
        | in(X6,X5)
        | X5 != singleton(X4) )
      & ( ~ in(esk1_2(X4,X5),X5)
        | esk1_2(X4,X5) != X4
        | X5 = singleton(X4) )
      & ( in(esk1_2(X4,X5),X5)
        | esk1_2(X4,X5) = X4
        | X5 = singleton(X4) ) ),
    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)],[d1_tarski])])])])])])]) ).

cnf(c_0_10,plain,
    ( in(X1,X3)
    | in(X1,X2)
    | ~ in(X1,symmetric_difference(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    symmetric_difference(X1,X2) = set_union2(set_difference(X1,X2),set_difference(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_12,plain,
    ! [X5,X6,X7,X8,X8,X5,X6,X7] :
      ( ( ~ in(X8,X7)
        | X8 = X5
        | X8 = X6
        | X7 != unordered_pair(X5,X6) )
      & ( X8 != X5
        | in(X8,X7)
        | X7 != unordered_pair(X5,X6) )
      & ( X8 != X6
        | in(X8,X7)
        | X7 != unordered_pair(X5,X6) )
      & ( esk2_3(X5,X6,X7) != X5
        | ~ in(esk2_3(X5,X6,X7),X7)
        | X7 = unordered_pair(X5,X6) )
      & ( esk2_3(X5,X6,X7) != X6
        | ~ in(esk2_3(X5,X6,X7),X7)
        | X7 = unordered_pair(X5,X6) )
      & ( in(esk2_3(X5,X6,X7),X7)
        | esk2_3(X5,X6,X7) = X5
        | esk2_3(X5,X6,X7) = X6
        | X7 = unordered_pair(X5,X6) ) ),
    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)],[d2_tarski])])])])])])]) ).

cnf(c_0_13,plain,
    ( X3 = X2
    | X1 != singleton(X2)
    | ~ in(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( in(X1,X3)
    | in(X1,X2)
    | ~ in(X1,set_union2(set_difference(X2,X3),set_difference(X3,X2))) ),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ( X1 = unordered_pair(X2,X3)
    | esk2_3(X2,X3,X1) = X3
    | esk2_3(X2,X3,X1) = X2
    | in(esk2_3(X2,X3,X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    ( X1 = X2
    | ~ in(X2,singleton(X1)) ),
    inference(er,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    ( esk2_3(X1,X2,set_union2(set_difference(X3,X4),set_difference(X4,X3))) = X2
    | esk2_3(X1,X2,set_union2(set_difference(X3,X4),set_difference(X4,X3))) = X1
    | set_union2(set_difference(X3,X4),set_difference(X4,X3)) = unordered_pair(X1,X2)
    | in(esk2_3(X1,X2,set_union2(set_difference(X3,X4),set_difference(X4,X3))),X4)
    | in(esk2_3(X1,X2,set_union2(set_difference(X3,X4),set_difference(X4,X3))),X3) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,plain,
    ( esk2_3(X1,X2,set_union2(set_difference(singleton(X3),X4),set_difference(X4,singleton(X3)))) = X3
    | esk2_3(X1,X2,set_union2(set_difference(singleton(X3),X4),set_difference(X4,singleton(X3)))) = X2
    | esk2_3(X1,X2,set_union2(set_difference(singleton(X3),X4),set_difference(X4,singleton(X3)))) = X1
    | set_union2(set_difference(singleton(X3),X4),set_difference(X4,singleton(X3))) = unordered_pair(X1,X2)
    | in(esk2_3(X1,X2,set_union2(set_difference(singleton(X3),X4),set_difference(X4,singleton(X3)))),X4) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,plain,
    ( esk2_3(X1,X2,set_union2(set_difference(singleton(X3),singleton(X4)),set_difference(singleton(X4),singleton(X3)))) = X4
    | esk2_3(X1,X2,set_union2(set_difference(singleton(X3),singleton(X4)),set_difference(singleton(X4),singleton(X3)))) = X3
    | esk2_3(X1,X2,set_union2(set_difference(singleton(X3),singleton(X4)),set_difference(singleton(X4),singleton(X3)))) = X2
    | esk2_3(X1,X2,set_union2(set_difference(singleton(X3),singleton(X4)),set_difference(singleton(X4),singleton(X3)))) = X1
    | set_union2(set_difference(singleton(X3),singleton(X4)),set_difference(singleton(X4),singleton(X3))) = unordered_pair(X1,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_18]) ).

cnf(c_0_20,plain,
    ( in(X3,X1)
    | X1 != singleton(X2)
    | X3 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_21,plain,
    ( esk2_3(X1,X2,set_union2(set_difference(singleton(X3),singleton(X2)),set_difference(singleton(X2),singleton(X3)))) = X3
    | esk2_3(X1,X2,set_union2(set_difference(singleton(X3),singleton(X2)),set_difference(singleton(X2),singleton(X3)))) = X2
    | esk2_3(X1,X2,set_union2(set_difference(singleton(X3),singleton(X2)),set_difference(singleton(X2),singleton(X3)))) = X1
    | set_union2(set_difference(singleton(X3),singleton(X2)),set_difference(singleton(X2),singleton(X3))) = unordered_pair(X1,X2) ),
    inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_19])]) ).

cnf(c_0_22,plain,
    ( in(X1,symmetric_difference(X2,X3))
    | in(X1,X3)
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_23,plain,
    ( in(X1,X2)
    | X2 != singleton(X1) ),
    inference(er,[status(thm)],[c_0_20]) ).

cnf(c_0_24,plain,
    ( X1 = unordered_pair(X2,X3)
    | ~ in(esk2_3(X2,X3,X1),X1)
    | esk2_3(X2,X3,X1) != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_25,plain,
    ( esk2_3(X1,X2,set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1)))) = X2
    | esk2_3(X1,X2,set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1)))) = X1
    | set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1))) = unordered_pair(X1,X2) ),
    inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_21])]) ).

cnf(c_0_26,plain,
    ( in(X1,X3)
    | in(X1,set_union2(set_difference(X2,X3),set_difference(X3,X2)))
    | ~ in(X1,X2) ),
    inference(rw,[status(thm)],[c_0_22,c_0_11]) ).

cnf(c_0_27,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[c_0_23]) ).

cnf(c_0_28,plain,
    ( esk2_3(X1,X2,set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1)))) = X2
    | set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1))) = unordered_pair(X1,X2)
    | ~ in(X1,set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1)))) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,plain,
    ( in(X1,set_union2(set_difference(singleton(X1),X2),set_difference(X2,singleton(X1))))
    | in(X1,X2) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,plain,
    ( in(X1,symmetric_difference(X2,X3))
    | in(X1,X2)
    | ~ in(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_31,negated_conjecture,
    ~ ! [X1,X2] :
        ( X1 != X2
       => symmetric_difference(singleton(X1),singleton(X2)) = unordered_pair(X1,X2) ),
    inference(assume_negation,[status(cth)],[t29_zfmisc_1]) ).

cnf(c_0_32,plain,
    ( X1 = unordered_pair(X2,X3)
    | ~ in(esk2_3(X2,X3,X1),X1)
    | esk2_3(X2,X3,X1) != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_33,plain,
    ( esk2_3(X1,X2,set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1)))) = X2
    | set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1))) = unordered_pair(X1,X2)
    | in(X1,singleton(X2)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,plain,
    ( in(X1,X2)
    | in(X1,set_union2(set_difference(X2,X3),set_difference(X3,X2)))
    | ~ in(X1,X3) ),
    inference(rw,[status(thm)],[c_0_30,c_0_11]) ).

fof(c_0_35,negated_conjecture,
    ( esk5_0 != esk6_0
    & symmetric_difference(singleton(esk5_0),singleton(esk6_0)) != unordered_pair(esk5_0,esk6_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])]) ).

cnf(c_0_36,plain,
    ( set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1))) = unordered_pair(X1,X2)
    | in(X1,singleton(X2))
    | ~ in(X2,set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1)))) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_37,plain,
    ( in(X1,set_union2(set_difference(X2,singleton(X1)),set_difference(singleton(X1),X2)))
    | in(X1,X2) ),
    inference(spm,[status(thm)],[c_0_34,c_0_27]) ).

cnf(c_0_38,negated_conjecture,
    symmetric_difference(singleton(esk5_0),singleton(esk6_0)) != unordered_pair(esk5_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

fof(c_0_39,plain,
    ! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
    inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).

fof(c_0_40,plain,
    ! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
    inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).

cnf(c_0_41,plain,
    ( set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1))) = unordered_pair(X1,X2)
    | in(X1,singleton(X2))
    | in(X2,singleton(X1)) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    set_union2(set_difference(singleton(esk5_0),singleton(esk6_0)),set_difference(singleton(esk6_0),singleton(esk5_0))) != unordered_pair(esk5_0,esk6_0),
    inference(rw,[status(thm)],[c_0_38,c_0_11]) ).

cnf(c_0_43,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_44,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_45,plain,
    ( set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1))) = unordered_pair(X1,X2)
    | X1 = X2
    | in(X1,singleton(X2)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_41]) ).

cnf(c_0_46,negated_conjecture,
    set_union2(set_difference(singleton(esk6_0),singleton(esk5_0)),set_difference(singleton(esk5_0),singleton(esk6_0))) != unordered_pair(esk6_0,esk5_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).

cnf(c_0_47,plain,
    ( set_union2(set_difference(singleton(X1),singleton(X2)),set_difference(singleton(X2),singleton(X1))) = unordered_pair(X1,X2)
    | X2 = X1 ),
    inference(spm,[status(thm)],[c_0_16,c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    esk5_0 != esk6_0,
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_49,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET888+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jul 10 21:59:13 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.33/23.40  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, terminating
% 0.33/23.40  eprover: CPU time limit exceeded, terminating
% 0.46/46.42  eprover: CPU time limit exceeded, terminating
% 0.46/46.42  eprover: CPU time limit exceeded, terminatingeprover: 
% 0.46/46.42  CPU time limit exceeded, terminating
% 0.46/46.42  eprover: CPU time limit exceeded, terminating
% 0.58/69.43  eprover: CPU time limit exceeded, terminating
% 0.58/69.43  eprover: eprover: CPU time limit exceeded, terminating
% 0.58/69.43  CPU time limit exceeded, terminating
% 0.58/69.45  eprover: CPU time limit exceeded, terminating
% 0.71/92.45  eprover: CPU time limit exceeded, terminating
% 0.71/92.45  eprover: CPU time limit exceeded, terminating
% 0.71/92.45  eprover: CPU time limit exceeded, terminating
% 0.71/92.46  eprover: CPU time limit exceeded, terminating
% 0.83/115.46  eprover: CPU time limit exceeded, terminating
% 0.83/115.48  eprover: CPU time limit exceeded, terminating
% 0.83/115.49  eprover: CPU time limit exceeded, terminating
% 0.83/115.49  eprover: CPU time limit exceeded, terminating
% 0.86/120.03  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.86/120.03  
% 0.86/120.03  # Failure: Resource limit exceeded (time)
% 0.86/120.03  # OLD status Res
% 0.86/120.03  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.86/120.03  # Preprocessing time       : 0.010 s
% 0.86/120.03  # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.86/120.03  
% 0.86/120.03  # Failure: Resource limit exceeded (time)
% 0.86/120.03  # OLD status Res
% 0.86/120.03  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.86/120.03  # Preprocessing time       : 0.014 s
% 0.86/120.03  # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.86/120.03  
% 0.86/120.03  # Failure: Resource limit exceeded (time)
% 0.86/120.03  # OLD status Res
% 0.86/120.03  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.86/120.03  # Preprocessing time       : 0.008 s
% 0.86/120.03  # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.86/120.03  
% 0.86/120.03  # Failure: Resource limit exceeded (time)
% 0.86/120.03  # OLD status Res
% 0.86/120.03  # Preprocessing time       : 0.015 s
% 0.86/120.03  # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.86/120.03  
% 0.86/120.03  # Failure: Resource limit exceeded (time)
% 0.86/120.03  # OLD status Res
% 0.86/120.03  # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.86/120.03  # Preprocessing time       : 0.015 s
% 0.86/120.03  # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 0.86/120.03  # Preprocessing time       : 0.015 s
% 0.86/120.03  
% 0.86/120.03  # Proof found!
% 0.86/120.03  # SZS status Theorem
% 0.86/120.03  # SZS output start CNFRefutation
% See solution above
% 0.86/120.03  # Proof object total steps             : 50
% 0.86/120.03  # Proof object clause steps            : 35
% 0.86/120.03  # Proof object formula steps           : 15
% 0.86/120.03  # Proof object conjectures             : 8
% 0.86/120.03  # Proof object clause conjectures      : 5
% 0.86/120.03  # Proof object formula conjectures     : 3
% 0.86/120.03  # Proof object initial clauses used    : 13
% 0.86/120.03  # Proof object initial formulas used   : 7
% 0.86/120.03  # Proof object generating inferences   : 16
% 0.86/120.03  # Proof object simplifying inferences  : 10
% 0.86/120.03  # Training examples: 0 positive, 0 negative
% 0.86/120.03  # Parsed axioms                        : 14
% 0.86/120.03  # Removed by relevancy pruning/SinE    : 0
% 0.86/120.03  # Initial clauses                      : 26
% 0.86/120.03  # Removed in clause preprocessing      : 1
% 0.86/120.03  # Initial clauses in saturation        : 25
% 0.86/120.03  # Processed clauses                    : 9121
% 0.86/120.03  # ...of these trivial                  : 118
% 0.86/120.03  # ...subsumed                          : 7470
% 0.86/120.03  # ...remaining for further processing  : 1533
% 0.86/120.03  # Other redundant clauses eliminated   : 2908
% 0.86/120.03  # Clauses deleted for lack of memory   : 60716
% 0.86/120.03  # Backward-subsumed                    : 92
% 0.86/120.03  # Backward-rewritten                   : 30
% 0.86/120.03  # Generated clauses                    : 155740
% 0.86/120.03  # ...of the previous two non-trivial   : 145697
% 0.86/120.03  # Contextual simplify-reflections      : 0
% 0.86/120.03  # Paramodulations                      : 151149
% 0.86/120.03  # Factorizations                       : 1662
% 0.86/120.03  # Equation resolutions                 : 2929
% 0.86/120.03  # Current number of processed clauses  : 1408
% 0.86/120.03  #    Positive orientable unit clauses  : 8
% 0.86/120.03  #    Positive unorientable unit clauses: 2
% 0.86/120.03  #    Negative unit clauses             : 7
% 0.86/120.03  #    Non-unit-clauses                  : 1391
% 0.86/120.03  # Current number of unprocessed clauses: 69479
% 0.86/120.03  # ...number of literals in the above   : 624969
% 0.86/120.03  # Current number of archived formulas  : 0
% 0.86/120.03  # Current number of archived clauses   : 123
% 0.86/120.03  # Clause-clause subsumption calls (NU) : 233783
% 0.86/120.03  # Rec. Clause-clause subsumption calls : 13059
% 0.86/120.03  # Non-unit clause-clause subsumptions  : 7108
% 0.86/120.03  # Unit Clause-clause subsumption calls : 623
% 0.86/120.03  # Rewrite failures with RHS unbound    : 0
% 0.86/120.03  # BW rewrite match attempts            : 28
% 0.86/120.03  # BW rewrite match successes           : 16
% 0.86/120.03  # Condensation attempts                : 0
% 0.86/120.03  # Condensation successes               : 0
% 0.86/120.03  # Termbank termtop insertions          : 18562105
% 0.86/120.03  
% 0.86/120.03  # -------------------------------------------------
% 0.86/120.03  # User time                : 4.146 s
% 0.86/120.03  # System time              : 0.081 s
% 0.86/120.03  # Total time               : 4.227 s
% 0.86/120.03  # Maximum resident set size: 129904 pages
% 0.86/138.49  eprover: CPU time limit exceeded, terminating
% 0.86/138.50  eprover: CPU time limit exceeded, terminating
% 0.86/138.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.86/138.51  eprover: No such file or directory
% 0.86/138.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.86/138.51  eprover: No such file or directory
% 0.86/138.52  eprover: CPU time limit exceeded, terminating
% 0.86/138.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.52  eprover: No such file or directory
% 0.86/138.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.86/138.52  eprover: No such file or directory
% 0.86/138.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.52  eprover: No such file or directory
% 0.86/138.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.86/138.53  eprover: No such file or directory
% 0.86/138.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.53  eprover: No such file or directory
% 0.86/138.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.86/138.53  eprover: No such file or directory
% 0.86/138.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.53  eprover: No such file or directory
% 0.86/138.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.53  eprover: No such file or directory
% 0.86/138.54  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.54  eprover: No such file or directory
% 0.86/138.54  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.86/138.54  eprover: No such file or directory
% 0.86/138.54  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.54  eprover: No such file or directory
% 0.86/138.54  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.54  eprover: No such file or directory
% 0.86/138.54  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.54  eprover: No such file or directory
% 0.86/138.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.55  eprover: No such file or directory
% 0.86/138.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.55  eprover: No such file or directory
% 0.86/138.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.86/138.56  eprover: No such file or directory
%------------------------------------------------------------------------------