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

View Problem - Process Solution

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

% Computer : n008.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:31 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   23 (   9 unt;   0 def)
%            Number of atoms       :   62 (  11 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   59 (  20   ~;  15   |;  13   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-3 aty)
%            Number of variables   :   30 (   0 sgn  21   !;   0   ?)

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

fof(finite_domain_0,axiom,
    ! [X1] :
      ( ( leq(n0,X1)
        & leq(X1,n0) )
     => X1 = n0 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_0) ).

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

fof(transitivity_leq,axiom,
    ! [X1,X2,X3] :
      ( ( leq(X1,X2)
        & leq(X2,X3) )
     => leq(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).

fof(gt_0_tptp_minus_1,axiom,
    gt(n0,tptp_minus_1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_0_tptp_minus_1) ).

fof(irreflexivity_gt,axiom,
    ! [X1] : ~ gt(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).

fof(c_0_6,negated_conjecture,
    ~ ( ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,n4) )
         => a_select3(center_init,X14,n0) = init )
     => ! [X18] :
          ( ( leq(n0,X18)
            & leq(X18,tptp_minus_1) )
         => ! [X4] :
              ( ( leq(n0,X4)
                & leq(X4,n4) )
             => a_select3(q_init,X18,X4) = init ) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_init_0121]) ).

fof(c_0_7,plain,
    ! [X2] :
      ( ~ leq(n0,X2)
      | ~ leq(X2,n0)
      | X2 = n0 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).

fof(c_0_8,plain,
    ! [X3,X4] :
      ( ~ gt(X4,X3)
      | leq(X3,X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).

fof(c_0_9,plain,
    ! [X4,X5,X6] :
      ( ~ leq(X4,X5)
      | ~ leq(X5,X6)
      | leq(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).

fof(c_0_10,negated_conjecture,
    ! [X19] :
      ( ( ~ leq(n0,X19)
        | ~ leq(X19,n4)
        | a_select3(center_init,X19,n0) = init )
      & leq(n0,esk1_0)
      & leq(esk1_0,tptp_minus_1)
      & leq(n0,esk2_0)
      & leq(esk2_0,n4)
      & 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_6])])])])])]) ).

cnf(c_0_11,plain,
    ( X1 = n0
    | ~ leq(X1,n0)
    | ~ leq(n0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( leq(X1,X2)
    | ~ gt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( leq(X1,X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    leq(esk1_0,tptp_minus_1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ( X1 = n0
    | ~ leq(n0,X1)
    | ~ gt(n0,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ( leq(X1,tptp_minus_1)
    | ~ leq(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    gt(n0,tptp_minus_1),
    inference(split_conjunct,[status(thm)],[gt_0_tptp_minus_1]) ).

cnf(c_0_18,negated_conjecture,
    leq(n0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_19,plain,
    ! [X2] : ~ gt(X2,X2),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).

cnf(c_0_20,negated_conjecture,
    n0 = tptp_minus_1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_21,plain,
    ~ gt(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_22,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV189+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n008.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 : Wed Jun 15 17:14:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.017 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 23
% 0.23/1.41  # Proof object clause steps            : 11
% 0.23/1.41  # Proof object formula steps           : 12
% 0.23/1.41  # Proof object conjectures             : 7
% 0.23/1.41  # Proof object clause conjectures      : 4
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 7
% 0.23/1.41  # Proof object initial formulas used   : 6
% 0.23/1.41  # Proof object generating inferences   : 3
% 0.23/1.41  # Proof object simplifying inferences  : 5
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 85
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 29
% 0.23/1.41  # Initial clauses                      : 63
% 0.23/1.41  # Removed in clause preprocessing      : 1
% 0.23/1.41  # Initial clauses in saturation        : 62
% 0.23/1.41  # Processed clauses                    : 147
% 0.23/1.41  # ...of these trivial                  : 4
% 0.23/1.41  # ...subsumed                          : 13
% 0.23/1.41  # ...remaining for further processing  : 130
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 53
% 0.23/1.41  # Generated clauses                    : 526
% 0.23/1.41  # ...of the previous two non-trivial   : 478
% 0.23/1.41  # Contextual simplify-reflections      : 11
% 0.23/1.41  # Paramodulations                      : 523
% 0.23/1.41  # Factorizations                       : 3
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 77
% 0.23/1.41  #    Positive orientable unit clauses  : 41
% 0.23/1.41  #    Positive unorientable unit clauses: 3
% 0.23/1.41  #    Negative unit clauses             : 3
% 0.23/1.41  #    Non-unit-clauses                  : 30
% 0.23/1.41  # Current number of unprocessed clauses: 205
% 0.23/1.41  # ...number of literals in the above   : 484
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 54
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 126
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 104
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 24
% 0.23/1.41  # Unit Clause-clause subsumption calls : 18
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 9
% 0.23/1.41  # BW rewrite match successes           : 9
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 7977
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.026 s
% 0.23/1.41  # System time              : 0.005 s
% 0.23/1.41  # Total time               : 0.031 s
% 0.23/1.41  # Maximum resident set size: 3692 pages
%------------------------------------------------------------------------------