↑ Up

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

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

% Computer : n014.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.10s 0.41s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   24 (  14   ~;   3   |;   4   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-3 aty)
%            Number of variables   :   21 (   2 sgn  12   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l22_l26,axiom,
    ! [U,V,W] :
      ( ~ check_cpq(triple(U,V,W))
     => ! [X] : ~ check_cpq(insert_cpq(triple(U,V,W),X)) ),
    file('theBenchmark.p',l22_l26) ).

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

fof(l22_co_neg,negated_conjecture,
    ~ ! [U,V,W] :
        ( ~ check_cpq(triple(U,V,W))
       => ! [X] :
            ( ~ ok(insert_cpq(triple(U,V,W),X))
            | ~ check_cpq(insert_cpq(triple(U,V,W),X)) ) ),
    inference(assume_negation,[status(cth)],[l22_co]) ).

cnf(c_98,plain,
    ( ~ check_cpq(insert_cpq(triple(A,B,C),D))
    | check_cpq(triple(A,B,C)) ),
    inference(clausify,[status(thm)],[l22_l26]) ).

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

fof(sk_l22_co_neg,plain,
    ( ok(insert_cpq(triple(sK0,sK1,sK2),sK3))
    & check_cpq(insert_cpq(triple(sK0,sK1,sK2),sK3))
    & ~ check_cpq(triple(sK0,sK1,sK2)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(U,sK0),skolemize(V,sK1),skolemize(W,sK2),skolemize(X,sK3)],[nnf_42]) ).

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

cnf(c_100,negated_conjecture,
    check_cpq(insert_cpq(triple(sK0,sK1,sK2),sK3)),
    inference(split_conjunct,[status(thm)],[sk_l22_co_neg]) ).

cnf(c_171,negated_conjecture,
    ~ check_cpq(insert_cpq(triple(sK0,sK1,sK2),A)),
    inference(resolve,[status(thm)],[c_98,c_99]) ).

cnf(c_172,plain,
    $false,
    inference(resolve,[status(thm)],[c_171,c_100]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV386+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n014.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 13:40:16 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 3289338 was started by sandbox on n014,
% 0.10/0.37  % Sat Sep 26 13:40:16 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 0.10/0.41  
% 0.10/0.41  % SZS status Theorem for theBenchmark
% 0.10/0.41  
% 0.10/0.41  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.10/0.41  % Length of proof is 7.
% 0.10/0.41  % Level of proof is 3.
% 0.10/0.41  % Maximum clause weight is 12.000.
% 0.10/0.41  % Given clauses 51.
% 0.10/0.41  
% 0.10/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------