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

View Problem - Process Solution

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

% Computer : n023.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:23 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (  12 unt;   0 def)
%            Number of atoms       :   85 (  28 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :   86 (  26   ~;  18   |;  30   &)
%                                         (   1 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  12 con; 0-3 aty)
%            Number of variables   :   30 (   2 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0003,conjecture,
    ( ( pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
      & leq(n0,pv10)
      & leq(n0,pv12)
      & leq(pv10,n135299)
      & leq(pv12,n4)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,pred(pv12)) )
         => a_select3(q,pv10,X14) = divide(sqrt(times(minus(a_select3(center,X14,n0),a_select2(x,pv10)),minus(a_select3(center,X14,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
      & ! [X18] :
          ( ( leq(n0,X18)
            & leq(X18,pred(pv10)) )
         => sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) )
   => ! [X4] :
        ( ( leq(n0,X4)
          & leq(X4,pv12) )
       => ( pv12 != X4
         => a_select3(q,pv10,X4) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_norm_0003) ).

fof(pred_minus_1,axiom,
    ! [X1] : minus(X1,n1) = pred(X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).

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

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

fof(c_0_4,negated_conjecture,
    ~ ( ( pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
        & leq(n0,pv10)
        & leq(n0,pv12)
        & leq(pv10,n135299)
        & leq(pv12,n4)
        & ! [X14] :
            ( ( leq(n0,X14)
              & leq(X14,pred(pv12)) )
           => a_select3(q,pv10,X14) = divide(sqrt(times(minus(a_select3(center,X14,n0),a_select2(x,pv10)),minus(a_select3(center,X14,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
        & ! [X18] :
            ( ( leq(n0,X18)
              & leq(X18,pred(pv10)) )
           => sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) )
     => ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,pv12) )
         => ( pv12 != X4
           => a_select3(q,pv10,X4) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_norm_0003]) ).

fof(c_0_5,negated_conjecture,
    ! [X19,X20] :
      ( pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
      & leq(n0,pv10)
      & leq(n0,pv12)
      & leq(pv10,n135299)
      & leq(pv12,n4)
      & ( ~ leq(n0,X19)
        | ~ leq(X19,pred(pv12))
        | a_select3(q,pv10,X19) = divide(sqrt(times(minus(a_select3(center,X19,n0),a_select2(x,pv10)),minus(a_select3(center,X19,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
      & ( ~ leq(n0,X20)
        | ~ leq(X20,pred(pv10))
        | sum(n0,n4,a_select3(q,X20,tptp_sum_index)) = n1 )
      & leq(n0,esk1_0)
      & leq(esk1_0,pv12)
      & pv12 != esk1_0
      & a_select3(q,pv10,esk1_0) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ),
    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_4])])])])])]) ).

fof(c_0_6,plain,
    ! [X2] : minus(X2,n1) = pred(X2),
    inference(variable_rename,[status(thm)],[pred_minus_1]) ).

cnf(c_0_7,negated_conjecture,
    ( a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
    | ~ leq(X1,pred(pv12))
    | ~ leq(n0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    minus(X1,n1) = pred(X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    a_select3(q,pv10,esk1_0) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    ( a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
    | ~ leq(n0,X1)
    | ~ leq(X1,minus(pv12,n1)) ),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

fof(c_0_12,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])])])]) ).

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

cnf(c_0_14,negated_conjecture,
    divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),pv70) != a_select3(q,pv10,esk1_0),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ( divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),pv70) = a_select3(q,pv10,X1)
    | ~ leq(X1,minus(pv12,n1))
    | ~ leq(n0,X1) ),
    inference(rw,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    leq(n0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

cnf(c_0_18,plain,
    ( gt(X1,X2)
    | X2 = X1
    | ~ leq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    leq(esk1_0,pv12),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_20,negated_conjecture,
    pv12 != esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_21,negated_conjecture,
    ~ leq(esk1_0,minus(pv12,n1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_22,plain,
    ( leq(X1,minus(X2,n1))
    | ~ gt(X2,X1) ),
    inference(rw,[status(thm)],[c_0_17,c_0_8]) ).

cnf(c_0_23,negated_conjecture,
    gt(pv12,esk1_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
    [proof] ).

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