↑ Up

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

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

% Computer : n001.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:07:36 AM UTC 2026

% Result   : Theorem 0.17s 0.49s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   6 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   44 (  22   ~;  10   |;   6   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-3 aty)
%            Number of variables   :   30 (   0 sgn  18   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l19_l20,axiom,
    ! [U,V,W] :
      ( ( ~ ok(triple(U,V,W))
        | ~ check_cpq(triple(U,V,W)) )
     => ! [X,Y,Z] :
          ( succ_cpq(triple(U,V,W),triple(X,Y,Z))
         => ( ~ check_cpq(triple(X,Y,Z))
            | ~ ok(triple(X,Y,Z)) ) ) ),
    file('theBenchmark.p',l19_l20) ).

fof(l19_co,conjecture,
    ! [U,V,W] :
      ( ~ check_cpq(triple(U,V,W))
     => ! [X,Y,Z] :
          ( succ_cpq(triple(U,V,W),triple(X,Y,Z))
         => ( ~ check_cpq(triple(X,Y,Z))
            | ~ ok(triple(X,Y,Z)) ) ) ),
    file('theBenchmark.p',l19_co) ).

fof(l19_co_neg,negated_conjecture,
    ~ ! [U,V,W] :
        ( ~ check_cpq(triple(U,V,W))
       => ! [X,Y,Z] :
            ( succ_cpq(triple(U,V,W),triple(X,Y,Z))
           => ( ~ check_cpq(triple(X,Y,Z))
              | ~ ok(triple(X,Y,Z)) ) ) ),
    inference(assume_negation,[status(cth)],[l19_co]) ).

cnf(c_98,plain,
    ( ~ check_cpq(triple(D,E,F))
    | ~ ok(triple(D,E,F))
    | ~ succ_cpq(triple(A,B,C),triple(D,E,F))
    | check_cpq(triple(A,B,C)) ),
    inference(clausify,[status(thm)],[l19_l20]) ).

fof(nnf_42,plain,
    ? [U,V,W] :
      ( ? [X,Y,Z] :
          ( check_cpq(triple(X,Y,Z))
          & ok(triple(X,Y,Z))
          & succ_cpq(triple(U,V,W),triple(X,Y,Z)) )
      & ~ check_cpq(triple(U,V,W)) ),
    inference(fof_nnf,[status(thm)],[l19_co_neg]) ).

fof(sk_l19_co_neg,plain,
    ( check_cpq(triple(sK3,sK4,sK5))
    & ok(triple(sK3,sK4,sK5))
    & succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5))
    & ~ check_cpq(triple(sK0,sK1,sK2)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(U,sK0),skolemize(V,sK1),skolemize(W,sK2),skolemize(X,sK3),skolemize(Y,sK4),skolemize(Z,sK5)],[nnf_42]) ).

cnf(c_100,negated_conjecture,
    ~ check_cpq(triple(sK0,sK1,sK2)),
    inference(split_conjunct,[status(thm)],[sk_l19_co_neg]) ).

cnf(c_101,negated_conjecture,
    succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)),
    inference(split_conjunct,[status(thm)],[sk_l19_co_neg]) ).

cnf(c_102,negated_conjecture,
    ok(triple(sK3,sK4,sK5)),
    inference(split_conjunct,[status(thm)],[sk_l19_co_neg]) ).

cnf(c_103,negated_conjecture,
    check_cpq(triple(sK3,sK4,sK5)),
    inference(split_conjunct,[status(thm)],[sk_l19_co_neg]) ).

cnf(c_179,negated_conjecture,
    ( ~ check_cpq(triple(sK3,sK4,sK5))
    | ~ ok(triple(sK3,sK4,sK5))
    | check_cpq(triple(sK0,sK1,sK2)) ),
    inference(resolve,[status(thm)],[c_101,c_98]) ).

cnf(c_180,negated_conjecture,
    ( ~ check_cpq(triple(sK3,sK4,sK5))
    | ~ ok(triple(sK3,sK4,sK5)) ),
    inference(resolve,[status(thm)],[c_100,c_179]) ).

cnf(c_181,negated_conjecture,
    ~ check_cpq(triple(sK3,sK4,sK5)),
    inference(resolve,[status(thm)],[c_102,c_180]) ).

cnf(c_178,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_103,c_181]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV383+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.42  % Computer : n001.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Sat Sep 26 13:46:12 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.43  % Process 1934824 was started by sandbox2 on n001,
% 0.17/0.43  % Sat Sep 26 13:46:12 2026
% 0.17/0.43  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.45  
% 0.17/0.45  % From the command line: assign(max_seconds, 300).
% 0.17/0.49  
% 0.17/0.49  % SZS status Theorem for theBenchmark
% 0.17/0.49  
% 0.17/0.49  % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.17/0.49  % Length of proof is 8.
% 0.17/0.49  % Level of proof is 2.
% 0.17/0.49  % Maximum clause weight is 24.000.
% 0.17/0.49  % Given clauses 53.
% 0.17/0.49  
% 0.17/0.49  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------