↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWV153+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 09:06:55 AM UTC 2026

% Result   : Theorem 21.90s 3.40s
% Output   : CNFRefutation 21.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   9 unt;   0 def)
%            Number of atoms       :   88 (  29 equ)
%            Maximal formula atoms :   15 (   4 avg)
%            Number of connectives :   92 (  25   ~;  16   |;  39   &)
%                                         (   1 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   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   :   20 (   0 sgn  14   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(leq_gt2,axiom,
    ! [X,Y] :
      ( ( X != Y
        & leq(X,Y) )
     => gt(Y,X) ),
    file('theBenchmark.p',leq_gt2) ).

fof(leq_gt_pred,axiom,
    ! [X,Y] :
      ( leq(X,pred(Y))
    <=> gt(Y,X) ),
    file('theBenchmark.p',leq_gt_pred) ).

fof(cl5_nebula_norm_0003,conjecture,
    ( ( ! [B] :
          ( ( leq(B,pred(pv10))
            & leq(n0,B) )
         => sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1 )
      & ! [A] :
          ( ( leq(A,pred(pv12))
            & leq(n0,A) )
         => a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,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(pv12,n4)
      & leq(pv10,n135299)
      & leq(n0,pv12)
      & leq(n0,pv10)
      & 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))))) )
   => ! [C] :
        ( ( leq(C,pv12)
          & leq(n0,C) )
       => ( pv12 != C
         => a_select3(q,pv10,C) = divide(sqrt(times(minus(a_select3(center,C,n0),a_select2(x,pv10)),minus(a_select3(center,C,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('theBenchmark.p',cl5_nebula_norm_0003) ).

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

cnf(c_67,plain,
    ( gt(B,A)
    | B = A
    | ~ leq(A,B) ),
    inference(clausify,[status(thm)],[leq_gt2]) ).

cnf(c_69,plain,
    ( ~ gt(B,A)
    | leq(A,pred(B)) ),
    inference(clausify,[status(thm)],[leq_gt_pred]) ).

fof(nnf_56,plain,
    ( ? [C] :
        ( divide(sqrt(times(minus(a_select3(center,C,n0),a_select2(x,pv10)),minus(a_select3(center,C,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)))))) != a_select3(q,pv10,C)
        & pv12 != C
        & leq(C,pv12)
        & leq(n0,C) )
    & ! [B] :
        ( sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1
        | ~ leq(B,pred(pv10))
        | ~ leq(n0,B) )
    & ! [A] :
        ( divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,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)))))) = a_select3(q,pv10,A)
        | ~ leq(A,pred(pv12))
        | ~ leq(n0,A) )
    & leq(pv12,n4)
    & leq(pv10,n135299)
    & leq(n0,pv12)
    & leq(n0,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))))) = pv70 ),
    inference(fof_nnf,[status(thm)],[cl5_nebula_norm_0003_neg]) ).

fof(sk_cl5_nebula_norm_0003_neg,plain,
    ( divide(sqrt(times(minus(a_select3(center,sK0,n0),a_select2(x,pv10)),minus(a_select3(center,sK0,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)))))) != a_select3(q,pv10,sK0)
    & pv12 != sK0
    & leq(sK0,pv12)
    & leq(n0,sK0)
    & ! [B] :
        ( sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1
        | ~ leq(B,pred(pv10))
        | ~ leq(n0,B) )
    & ! [A] :
        ( divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,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)))))) = a_select3(q,pv10,A)
        | ~ leq(A,pred(pv12))
        | ~ leq(n0,A) )
    & leq(pv12,n4)
    & leq(pv10,n135299)
    & leq(n0,pv12)
    & leq(n0,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))))) = pv70 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(C,sK0)],[nnf_56]) ).

cnf(c_364,negated_conjecture,
    ( divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,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)))))) = a_select3(q,pv10,A)
    | ~ leq(A,pred(pv12))
    | ~ leq(n0,A) ),
    inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0003_neg]) ).

cnf(c_366,negated_conjecture,
    leq(n0,sK0),
    inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0003_neg]) ).

cnf(c_367,negated_conjecture,
    leq(sK0,pv12),
    inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0003_neg]) ).

cnf(c_368,negated_conjecture,
    pv12 != sK0,
    inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0003_neg]) ).

cnf(c_369,negated_conjecture,
    sK0 != pv12,
    inference(copy,[status(thm)],[c_368]) ).

cnf(c_370,negated_conjecture,
    divide(sqrt(times(minus(a_select3(center,sK0,n0),a_select2(x,pv10)),minus(a_select3(center,sK0,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)))))) != a_select3(q,pv10,sK0),
    inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0003_neg]) ).

cnf(c_11712,negated_conjecture,
    ( divide(sqrt(times(minus(a_select3(center,sK0,n0),a_select2(x,pv10)),minus(a_select3(center,sK0,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)))))) = a_select3(q,pv10,sK0)
    | ~ leq(sK0,pred(pv12)) ),
    inference(resolve,[status(thm)],[c_366,c_364]) ).

cnf(c_3125,negated_conjecture,
    ~ leq(sK0,pred(pv12)),
    inference(resolve,[status(thm)],[c_370,c_11712]) ).

cnf(c_11713,negated_conjecture,
    ( gt(pv12,sK0)
    | pv12 = sK0 ),
    inference(resolve,[status(thm)],[c_367,c_67]) ).

cnf(c_11714,negated_conjecture,
    ( gt(pv12,sK0)
    | sK0 = pv12 ),
    inference(copy,[status(thm)],[c_11713]) ).

cnf(c_3606,negated_conjecture,
    gt(pv12,sK0),
    inference(resolve,[status(thm)],[c_369,c_11714]) ).

cnf(c_11715,plain,
    leq(sK0,pred(pv12)),
    inference(resolve,[status(thm)],[c_3606,c_69]) ).

cnf(c_11711,plain,
    $false,
    inference(resolve,[status(thm)],[c_3125,c_11715]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV153+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.07  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n004.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sat Sep 26 13:16:07 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44  % Process 1799168 was started by sandbox2 on n004,
% 0.17/0.44  % Sat Sep 26 13:16:07 2026
% 0.17/0.44  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.26/0.56  
% 0.26/0.56  % From the command line: assign(max_seconds, 300).
% 21.90/3.40  
% 21.90/3.40  % given #500 (I,wt=143): 569 leq(n0,f19(A,B,C,D,E,F,n0,V6)) | leq(f21(A,B,C,D,E,F,n0,V6),n0) | leq(f24(A,B,C,D,E,F,n0,V6),n0) | -leq(n0,V7) | -leq(V7,n0) | a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),n0,V7) = a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),V7,n0).  [factor(166,d,e),flip(g),unit_del(d,64)].
% 21.90/3.40  
% 21.90/3.40  % SZS status Theorem for theBenchmark
% 21.90/3.40  
% 21.90/3.40  % Proof 1 at 2.34 (+ 0.46) seconds.
% 21.90/3.40  % Length of proof is 14.
% 21.90/3.40  % Level of proof is 4.
% 21.90/3.40  % Maximum clause weight is 87.000.
% 21.90/3.40  % Given clauses 861.
% 21.90/3.40  
% 21.90/3.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------