↑ Up

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(ax8,axiom,
    ! [U] : ~ contains_pq(create_pq,U),
    file('theBenchmark.p',ax8) ).

fof(ax20,axiom,
    ! [U] : ~ contains_slb(create_slb,U),
    file('theBenchmark.p',ax20) ).

fof(ax39,axiom,
    ! [U,V,W,X] :
      ( contains_cpq(triple(U,V,W),X)
    <=> contains_slb(V,X) ),
    file('theBenchmark.p',ax39) ).

fof(ax54,axiom,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    file('theBenchmark.p',ax54) ).

fof(l5_co,conjecture,
    ! [U,V,W] :
      ( contains_cpq(triple(U,create_slb,V),W)
    <=> contains_pq(i(triple(U,create_slb,V)),W) ),
    file('theBenchmark.p',l5_co) ).

fof(l5_co_neg,negated_conjecture,
    ~ ! [U,V,W] :
        ( contains_cpq(triple(U,create_slb,V),W)
      <=> contains_pq(i(triple(U,create_slb,V)),W) ),
    inference(assume_negation,[status(cth)],[l5_co]) ).

fof(nnf_61,plain,
    ? [U,V,W] :
      ( ( ~ contains_pq(i(triple(U,create_slb,V)),W)
        | ~ contains_cpq(triple(U,create_slb,V),W) )
      & ( contains_pq(i(triple(U,create_slb,V)),W)
        | contains_cpq(triple(U,create_slb,V),W) ) ),
    inference(fof_nnf,[status(thm)],[l5_co_neg]) ).

fof(sk_l5_co_neg,plain,
    ( ( ~ contains_pq(i(triple(sK0,create_slb,sK1)),sK2)
      | ~ contains_cpq(triple(sK0,create_slb,sK1),sK2) )
    & ( contains_pq(i(triple(sK0,create_slb,sK1)),sK2)
      | contains_cpq(triple(sK0,create_slb,sK1),sK2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(U,sK0),skolemize(V,sK1),skolemize(W,sK2)],[nnf_61]) ).

cnf(c_133,negated_conjecture,
    ( contains_pq(i(triple(sK0,create_slb,sK1)),sK2)
    | contains_cpq(triple(sK0,create_slb,sK1),sK2) ),
    inference(split_conjunct,[status(thm)],[sk_l5_co_neg]) ).

cnf(c_136,plain,
    i(triple(A,create_slb,B)) = create_pq,
    inference(clausify,[status(thm)],[ax54]) ).

cnf(c_152,plain,
    ( contains_slb(B,D)
    | ~ contains_cpq(triple(A,B,C),D) ),
    inference(clausify,[status(thm)],[ax39]) ).

cnf(c_178,plain,
    ~ contains_slb(create_slb,A),
    inference(clausify,[status(thm)],[ax20]) ).

cnf(c_187,plain,
    ~ contains_pq(create_pq,A),
    inference(clausify,[status(thm)],[ax8]) ).

cnf(c_302,negated_conjecture,
    ( contains_pq(create_pq,sK2)
    | contains_cpq(triple(sK0,create_slb,sK1),sK2) ),
    inference(paramod,[status(thm)],[c_136,c_133]) ).

cnf(c_199,negated_conjecture,
    contains_cpq(triple(sK0,create_slb,sK1),sK2),
    inference(resolve,[status(thm)],[c_187,c_302]) ).

cnf(c_303,negated_conjecture,
    contains_slb(create_slb,sK2),
    inference(resolve,[status(thm)],[c_199,c_152]) ).

cnf(c_301,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_178,c_303]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV369+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n026.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:41:26 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38  % Process 1128525 was started by sandbox2 on n026,
% 0.10/0.38  % Sat Sep 26 13:41:26 2026
% 0.10/0.38  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.40  
% 0.10/0.40  % From the command line: assign(max_seconds, 300).
% 0.10/0.42  
% 0.10/0.42  % SZS status Theorem for theBenchmark
% 0.10/0.42  
% 0.10/0.42  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.10/0.42  % Length of proof is 12.
% 0.10/0.42  % Level of proof is 3.
% 0.10/0.42  % Maximum clause weight is 13.000.
% 0.10/0.42  % Given clauses 85.
% 0.10/0.42  
% 0.10/0.42  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------