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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWV174+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n011.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 : Wed Jul 20 18:15:28 EDT 2022

% Result   : Theorem 0.26s 1.43s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   7 unt;   0 def)
%            Number of atoms       :   68 (  11 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :   71 (  17   ~;  13   |;  28   &)
%                                         (   1 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-3 aty)
%            Number of variables   :   23 (   2 sgn  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0046,conjecture,
    ( ( leq(n0,pv10)
      & leq(pv10,n135299)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,pred(pv10)) )
         => ! [X18] :
              ( ( leq(n0,X18)
                & leq(X18,n4) )
             => a_select3(q_init,X14,X18) = init ) )
      & ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,n4) )
         => a_select3(center_init,X4,n0) = init ) )
   => ! [X20,X21] :
        ( ( leq(n0,X20)
          & leq(n0,X21)
          & leq(X20,n135299)
          & leq(X21,n4) )
       => ( gt(pv10,X20)
         => a_select3(q_init,X20,X21) = init ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_init_0046) ).

fof(leq_gt_pred,axiom,
    ! [X1,X2] :
      ( leq(X1,pred(X2))
    <=> gt(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).

fof(c_0_2,negated_conjecture,
    ~ ( ( leq(n0,pv10)
        & leq(pv10,n135299)
        & ! [X14] :
            ( ( leq(n0,X14)
              & leq(X14,pred(pv10)) )
           => ! [X18] :
                ( ( leq(n0,X18)
                  & leq(X18,n4) )
               => a_select3(q_init,X14,X18) = init ) )
        & ! [X4] :
            ( ( leq(n0,X4)
              & leq(X4,n4) )
           => a_select3(center_init,X4,n0) = init ) )
     => ! [X20,X21] :
          ( ( leq(n0,X20)
            & leq(n0,X21)
            & leq(X20,n135299)
            & leq(X21,n4) )
         => ( gt(pv10,X20)
           => a_select3(q_init,X20,X21) = init ) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_init_0046]) ).

fof(c_0_3,negated_conjecture,
    ! [X22,X23,X24] :
      ( leq(n0,pv10)
      & leq(pv10,n135299)
      & ( ~ leq(n0,X22)
        | ~ leq(X22,pred(pv10))
        | ~ leq(n0,X23)
        | ~ leq(X23,n4)
        | a_select3(q_init,X22,X23) = init )
      & ( ~ leq(n0,X24)
        | ~ leq(X24,n4)
        | a_select3(center_init,X24,n0) = init )
      & leq(n0,esk1_0)
      & leq(n0,esk2_0)
      & leq(esk1_0,n135299)
      & leq(esk2_0,n4)
      & gt(pv10,esk1_0)
      & a_select3(q_init,esk1_0,esk2_0) != init ),
    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)],[c_0_2])])])])])]) ).

cnf(c_0_4,negated_conjecture,
    a_select3(q_init,esk1_0,esk2_0) != init,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,negated_conjecture,
    ( a_select3(q_init,X1,X2) = init
    | ~ leq(X2,n4)
    | ~ leq(n0,X2)
    | ~ leq(X1,pred(pv10))
    | ~ leq(n0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    leq(esk2_0,n4),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,negated_conjecture,
    leq(n0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    leq(n0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

fof(c_0_9,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ leq(X3,pred(X4))
        | gt(X4,X3) )
      & ( ~ gt(X4,X3)
        | leq(X3,pred(X4)) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])])]) ).

cnf(c_0_10,negated_conjecture,
    ~ leq(esk1_0,pred(pv10)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]),c_0_7]),c_0_8])]) ).

cnf(c_0_11,plain,
    ( leq(X1,pred(X2))
    | ~ gt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    gt(pv10,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWV174+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jun 15 13:11:50 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.26/1.43  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43  # Preprocessing time       : 0.019 s
% 0.26/1.43  
% 0.26/1.43  # Proof found!
% 0.26/1.43  # SZS status Theorem
% 0.26/1.43  # SZS output start CNFRefutation
% See solution above
% 0.26/1.43  # Proof object total steps             : 14
% 0.26/1.43  # Proof object clause steps            : 9
% 0.26/1.43  # Proof object formula steps           : 5
% 0.26/1.43  # Proof object conjectures             : 11
% 0.26/1.43  # Proof object clause conjectures      : 8
% 0.26/1.43  # Proof object formula conjectures     : 3
% 0.26/1.43  # Proof object initial clauses used    : 7
% 0.26/1.43  # Proof object initial formulas used   : 2
% 0.26/1.43  # Proof object generating inferences   : 2
% 0.26/1.43  # Proof object simplifying inferences  : 6
% 0.26/1.43  # Training examples: 0 positive, 0 negative
% 0.26/1.43  # Parsed axioms                        : 92
% 0.26/1.43  # Removed by relevancy pruning/SinE    : 26
% 0.26/1.43  # Initial clauses                      : 78
% 0.26/1.43  # Removed in clause preprocessing      : 1
% 0.26/1.43  # Initial clauses in saturation        : 77
% 0.26/1.43  # Processed clauses                    : 81
% 0.26/1.43  # ...of these trivial                  : 0
% 0.26/1.43  # ...subsumed                          : 0
% 0.26/1.43  # ...remaining for further processing  : 81
% 0.26/1.43  # Other redundant clauses eliminated   : 0
% 0.26/1.43  # Clauses deleted for lack of memory   : 0
% 0.26/1.43  # Backward-subsumed                    : 0
% 0.26/1.43  # Backward-rewritten                   : 3
% 0.26/1.43  # Generated clauses                    : 204
% 0.26/1.43  # ...of the previous two non-trivial   : 181
% 0.26/1.43  # Contextual simplify-reflections      : 0
% 0.26/1.43  # Paramodulations                      : 202
% 0.26/1.43  # Factorizations                       : 2
% 0.26/1.43  # Equation resolutions                 : 0
% 0.26/1.43  # Current number of processed clauses  : 78
% 0.26/1.43  #    Positive orientable unit clauses  : 50
% 0.26/1.43  #    Positive unorientable unit clauses: 3
% 0.26/1.43  #    Negative unit clauses             : 3
% 0.26/1.43  #    Non-unit-clauses                  : 22
% 0.26/1.43  # Current number of unprocessed clauses: 168
% 0.26/1.43  # ...number of literals in the above   : 360
% 0.26/1.43  # Current number of archived formulas  : 0
% 0.26/1.43  # Current number of archived clauses   : 4
% 0.26/1.43  # Clause-clause subsumption calls (NU) : 32
% 0.26/1.43  # Rec. Clause-clause subsumption calls : 12
% 0.26/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.26/1.43  # Unit Clause-clause subsumption calls : 19
% 0.26/1.43  # Rewrite failures with RHS unbound    : 0
% 0.26/1.43  # BW rewrite match attempts            : 14
% 0.26/1.43  # BW rewrite match successes           : 14
% 0.26/1.43  # Condensation attempts                : 0
% 0.26/1.43  # Condensation successes               : 0
% 0.26/1.43  # Termbank termtop insertions          : 5847
% 0.26/1.43  
% 0.26/1.43  # -------------------------------------------------
% 0.26/1.43  # User time                : 0.024 s
% 0.26/1.43  # System time              : 0.001 s
% 0.26/1.43  # Total time               : 0.025 s
% 0.26/1.43  # Maximum resident set size: 3460 pages
%------------------------------------------------------------------------------