↑ Up

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

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

% Computer : n011.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 08:04:28 AM UTC 2026

% Result   : Unsatisfiable 0.09s 5.38s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   46 (  36 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   39 (  29   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-5 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   20 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(init,axiom,
    p(s0,s0,s0,s0,s0),
    file('theBenchmark.p',init) ).

cnf(c_1,plain,
    p(s0,s0,s0,s0,s0),
    inference(clausify,[status(thm)],[init]) ).

fof(rule1,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( p(VAR_0,VAR_1,VAR_2,VAR_3,s1)
      | ~ p(VAR_0,VAR_1,VAR_2,VAR_3,s0) ),
    file('theBenchmark.p',rule1) ).

cnf(c_2,plain,
    ( p(A,B,C,D,s1)
    | ~ p(A,B,C,D,s0) ),
    inference(clausify,[status(thm)],[rule1]) ).

fof(rule2,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( p(VAR_0,VAR_1,VAR_2,s1,s0)
      | ~ p(VAR_0,VAR_1,VAR_2,s0,s1) ),
    file('theBenchmark.p',rule2) ).

cnf(c_3,plain,
    ( p(A,B,C,s1,s0)
    | ~ p(A,B,C,s0,s1) ),
    inference(clausify,[status(thm)],[rule2]) ).

fof(rule3,axiom,
    ! [VAR_0,VAR_1] :
      ( p(VAR_0,VAR_1,s1,s0,s0)
      | ~ p(VAR_0,VAR_1,s0,s1,s1) ),
    file('theBenchmark.p',rule3) ).

cnf(c_4,plain,
    ( p(A,B,s1,s0,s0)
    | ~ p(A,B,s0,s1,s1) ),
    inference(clausify,[status(thm)],[rule3]) ).

fof(rule4,axiom,
    ! [VAR_0] :
      ( p(VAR_0,s1,s0,s0,s0)
      | ~ p(VAR_0,s0,s1,s1,s1) ),
    file('theBenchmark.p',rule4) ).

cnf(c_5,plain,
    ( p(A,s1,s0,s0,s0)
    | ~ p(A,s0,s1,s1,s1) ),
    inference(clausify,[status(thm)],[rule4]) ).

fof(rule5,axiom,
    ( p(s1,s0,s0,s0,s0)
    | ~ p(s0,s1,s1,s1,s1) ),
    file('theBenchmark.p',rule5) ).

cnf(c_6,plain,
    ( p(s1,s0,s0,s0,s0)
    | ~ p(s0,s1,s1,s1,s1) ),
    inference(clausify,[status(thm)],[rule5]) ).

fof(goal,axiom,
    ~ p(s1,s1,s1,s1,s1),
    file('theBenchmark.p',goal) ).

cnf(c_7,plain,
    ~ p(s1,s1,s1,s1,s1),
    inference(clausify,[status(thm)],[goal]) ).

cnf(c_8,plain,
    p(s0,s0,s0,s0,s1),
    inference(resolve,[status(thm)],[c_2,c_1]) ).

cnf(c_9,plain,
    ~ p(s1,s1,s1,s1,s0),
    inference(resolve,[status(thm)],[c_7,c_2]) ).

cnf(c_10,plain,
    p(s0,s0,s0,s1,s0),
    inference(resolve,[status(thm)],[c_3,c_8]) ).

cnf(c_11,plain,
    ~ p(s1,s1,s1,s0,s1),
    inference(resolve,[status(thm)],[c_9,c_3]) ).

cnf(c_12,plain,
    ~ p(s1,s1,s1,s0,s0),
    inference(resolve,[status(thm)],[c_11,c_2]) ).

cnf(c_13,plain,
    ~ p(s1,s1,s0,s1,s1),
    inference(resolve,[status(thm)],[c_12,c_4]) ).

cnf(c_14,plain,
    ~ p(s1,s1,s0,s1,s0),
    inference(resolve,[status(thm)],[c_13,c_2]) ).

cnf(c_15,plain,
    p(s0,s0,s0,s1,s1),
    inference(resolve,[status(thm)],[c_2,c_10]) ).

cnf(c_16,plain,
    p(s0,s0,s1,s0,s0),
    inference(resolve,[status(thm)],[c_4,c_15]) ).

cnf(c_17,plain,
    p(s0,s0,s1,s0,s1),
    inference(resolve,[status(thm)],[c_2,c_16]) ).

cnf(c_18,plain,
    p(s0,s0,s1,s1,s0),
    inference(resolve,[status(thm)],[c_3,c_17]) ).

cnf(c_19,plain,
    ~ p(s1,s1,s0,s0,s1),
    inference(resolve,[status(thm)],[c_14,c_3]) ).

cnf(c_20,plain,
    ~ p(s1,s1,s0,s0,s0),
    inference(resolve,[status(thm)],[c_19,c_2]) ).

cnf(c_21,plain,
    ~ p(s1,s0,s1,s1,s1),
    inference(resolve,[status(thm)],[c_20,c_5]) ).

cnf(c_22,plain,
    ~ p(s1,s0,s1,s1,s0),
    inference(resolve,[status(thm)],[c_21,c_2]) ).

cnf(c_23,plain,
    ~ p(s1,s0,s1,s0,s1),
    inference(resolve,[status(thm)],[c_22,c_3]) ).

cnf(c_24,plain,
    p(s0,s0,s1,s1,s1),
    inference(resolve,[status(thm)],[c_2,c_18]) ).

cnf(c_25,plain,
    p(s0,s1,s0,s0,s0),
    inference(resolve,[status(thm)],[c_5,c_24]) ).

cnf(c_26,plain,
    p(s0,s1,s0,s0,s1),
    inference(resolve,[status(thm)],[c_2,c_25]) ).

cnf(c_27,plain,
    p(s0,s1,s0,s1,s0),
    inference(resolve,[status(thm)],[c_3,c_26]) ).

cnf(c_28,plain,
    ~ p(s1,s0,s1,s0,s0),
    inference(resolve,[status(thm)],[c_23,c_2]) ).

cnf(c_29,plain,
    ~ p(s1,s0,s0,s1,s1),
    inference(resolve,[status(thm)],[c_28,c_4]) ).

cnf(c_30,plain,
    ~ p(s1,s0,s0,s1,s0),
    inference(resolve,[status(thm)],[c_29,c_2]) ).

cnf(c_31,plain,
    ~ p(s1,s0,s0,s0,s1),
    inference(resolve,[status(thm)],[c_30,c_3]) ).

cnf(c_32,plain,
    ~ p(s1,s0,s0,s0,s0),
    inference(resolve,[status(thm)],[c_31,c_2]) ).

cnf(c_33,plain,
    p(s0,s1,s0,s1,s1),
    inference(resolve,[status(thm)],[c_2,c_27]) ).

cnf(c_34,plain,
    p(s0,s1,s1,s0,s0),
    inference(resolve,[status(thm)],[c_4,c_33]) ).

cnf(c_35,plain,
    p(s0,s1,s1,s0,s1),
    inference(resolve,[status(thm)],[c_2,c_34]) ).

cnf(c_36,plain,
    p(s0,s1,s1,s1,s0),
    inference(resolve,[status(thm)],[c_3,c_35]) ).

cnf(c_37,plain,
    ~ p(s0,s1,s1,s1,s1),
    inference(resolve,[status(thm)],[c_32,c_6]) ).

cnf(c_38,plain,
    ~ p(s0,s1,s1,s1,s0),
    inference(resolve,[status(thm)],[c_37,c_2]) ).

cnf(c_39,plain,
    $false,
    inference(resolve,[status(thm)],[c_38,c_36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MSC015-1.005 : TPTP v9.3.1. Released v3.5.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.36  % Computer : n011.cluster.edu
% 0.09/5.36  % Model    : x86_64 x86_64
% 0.09/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36  % Memory   : 8046.5625MB
% 0.09/5.36  % OS       : Linux 6.8.0-71-generic
% 0.09/5.36  % CPULimit : 300
% 0.09/5.36  % WCLimit  : 300
% 0.09/5.36  % DateTime : Sat Sep 26 00:16:19 UTC 2026
% 0.09/5.36  % CPUTime  : 
% 0.09/5.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.36  % Process 3248358 was started by sandbox2 on n011,
% 0.09/5.36  % Sat Sep 26 00:16:19 2026
% 0.09/5.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/5.37  
% 0.09/5.37  % From the command line: assign(max_seconds, 300).
% 0.09/5.38  
% 0.09/5.38  % SZS status Unsatisfiable for theBenchmark
% 0.09/5.38  
% 0.09/5.38  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/5.38  % Length of proof is 39.
% 0.09/5.38  % Level of proof is 18.
% 0.09/5.38  % Maximum clause weight is 12.000.
% 0.09/5.38  % Given clauses 36.
% 0.09/5.38  
% 0.09/5.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------