↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWV395+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 : n015.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:37 AM UTC 2026

% Result   : Theorem 0.14s 5.41s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   4 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   17 (   5   ~;   0   |;  10   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   16 (   2 sgn  10   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax22,axiom,
    ! [U,V] : ~ pair_in_list(create_slb,U,V),
    file('theBenchmark.p',ax22) ).

fof(l31_co,conjecture,
    ! [U,V,W,X] :
      ( ( ok(remove_cpq(triple(U,create_slb,V),W))
        & strictly_less_than(W,X)
        & pair_in_list(create_slb,W,X) )
     => pair_in_list(remove_slb(create_slb,W),W,X) ),
    file('theBenchmark.p',l31_co) ).

fof(l31_co_neg,negated_conjecture,
    ~ ! [U,V,W,X] :
        ( ( ok(remove_cpq(triple(U,create_slb,V),W))
          & strictly_less_than(W,X)
          & pair_in_list(create_slb,W,X) )
       => pair_in_list(remove_slb(create_slb,W),W,X) ),
    inference(assume_negation,[status(cth)],[l31_co]) ).

cnf(c_55,plain,
    ~ pair_in_list(create_slb,A,B),
    inference(clausify,[status(thm)],[ax22]) ).

fof(nnf_41,plain,
    ? [U,V,W,X] :
      ( ~ pair_in_list(remove_slb(create_slb,W),W,X)
      & ok(remove_cpq(triple(U,create_slb,V),W))
      & strictly_less_than(W,X)
      & pair_in_list(create_slb,W,X) ),
    inference(fof_nnf,[status(thm)],[l31_co_neg]) ).

fof(sk_l31_co_neg,plain,
    ( ~ pair_in_list(remove_slb(create_slb,sK0),sK0,sK1)
    & ok(remove_cpq(triple(sK2,create_slb,sK3),sK0))
    & strictly_less_than(sK0,sK1)
    & pair_in_list(create_slb,sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(U,sK2),skolemize(V,sK3),skolemize(W,sK0),skolemize(X,sK1)],[nnf_41]) ).

cnf(c_97,negated_conjecture,
    pair_in_list(create_slb,sK0,sK1),
    inference(split_conjunct,[status(thm)],[sk_l31_co_neg]) ).

cnf(c_98,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_55,c_97]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV395+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.11/5.38  % Computer : n015.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Sat Sep 26 13:44:03 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.39  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.39  % Process 16429 was started by sandbox on n015,
% 0.11/5.39  % Sat Sep 26 13:44:03 2026
% 0.11/5.39  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/5.40  
% 0.14/5.40  % From the command line: assign(max_seconds, 300).
% 0.14/5.41  
% 0.14/5.41  % SZS status Theorem for theBenchmark
% 0.14/5.41  
% 0.14/5.41  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/5.41  % Length of proof is 5.
% 0.14/5.41  % Level of proof is 2.
% 0.14/5.41  % Maximum clause weight is 4.000.
% 0.14/5.41  % Given clauses 0.
% 0.14/5.41  
% 0.14/5.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------