↑ Up

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

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

% Computer : n006.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 07:19:21 AM UTC 2026

% Result   : Unsatisfiable 0.24s 5.52s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   50 (   6 unt;   0 def)
%            Number of atoms       :  118 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  108 (  40   ~;  68   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    6 (   5 usr;   6 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(clause_1,axiom,
    ( b
    | a ),
    file('theBenchmark.p',clause_1) ).

cnf(c_1,plain,
    ( b
    | a ),
    inference(clausify,[status(thm)],[clause_1]) ).

fof(clause_2,axiom,
    ( ~ b
    | ~ a ),
    file('theBenchmark.p',clause_2) ).

cnf(c_2,plain,
    ( ~ b
    | ~ a ),
    inference(clausify,[status(thm)],[clause_2]) ).

fof(clause_3,axiom,
    ( ~ d
    | c
    | a ),
    file('theBenchmark.p',clause_3) ).

cnf(c_3,plain,
    ( ~ d
    | c
    | a ),
    inference(clausify,[status(thm)],[clause_3]) ).

fof(clause_4,axiom,
    ( d
    | ~ c
    | a ),
    file('theBenchmark.p',clause_4) ).

cnf(c_4,plain,
    ( d
    | ~ c
    | a ),
    inference(clausify,[status(thm)],[clause_4]) ).

fof(clause_5,axiom,
    ( d
    | c
    | ~ a ),
    file('theBenchmark.p',clause_5) ).

cnf(c_5,plain,
    ( d
    | c
    | ~ a ),
    inference(clausify,[status(thm)],[clause_5]) ).

fof(clause_6,axiom,
    ( ~ d
    | ~ c
    | ~ a ),
    file('theBenchmark.p',clause_6) ).

cnf(c_6,plain,
    ( ~ d
    | ~ c
    | ~ a ),
    inference(clausify,[status(thm)],[clause_6]) ).

fof(clause_7,axiom,
    ( ~ e
    | c
    | b ),
    file('theBenchmark.p',clause_7) ).

cnf(c_7,plain,
    ( ~ e
    | c
    | b ),
    inference(clausify,[status(thm)],[clause_7]) ).

fof(clause_8,axiom,
    ( e
    | ~ c
    | b ),
    file('theBenchmark.p',clause_8) ).

cnf(c_8,plain,
    ( e
    | ~ c
    | b ),
    inference(clausify,[status(thm)],[clause_8]) ).

fof(clause_9,axiom,
    ( e
    | c
    | ~ b ),
    file('theBenchmark.p',clause_9) ).

cnf(c_9,plain,
    ( e
    | c
    | ~ b ),
    inference(clausify,[status(thm)],[clause_9]) ).

fof(clause_10,axiom,
    ( ~ e
    | ~ c
    | ~ b ),
    file('theBenchmark.p',clause_10) ).

cnf(c_10,plain,
    ( ~ e
    | ~ c
    | ~ b ),
    inference(clausify,[status(thm)],[clause_10]) ).

fof(clause_11,axiom,
    ( ~ e
    | d ),
    file('theBenchmark.p',clause_11) ).

cnf(c_11,plain,
    ( ~ e
    | d ),
    inference(clausify,[status(thm)],[clause_11]) ).

fof(clause_12,axiom,
    ( e
    | ~ d ),
    file('theBenchmark.p',clause_12) ).

cnf(c_12,plain,
    ( e
    | ~ d ),
    inference(clausify,[status(thm)],[clause_12]) ).

cnf(c_13,plain,
    ( a
    | e
    | c ),
    inference(resolve,[status(thm)],[c_9,c_1]) ).

cnf(c_14,plain,
    ( a
    | ~ e
    | ~ c ),
    inference(resolve,[status(thm)],[c_10,c_1]) ).

cnf(c_33,plain,
    ( d
    | c
    | e
    | c ),
    inference(resolve,[status(thm)],[c_13,c_5]) ).

cnf(c_15,plain,
    ( d
    | e
    | c ),
    inference(copy,[status(thm)],[c_33]) ).

cnf(c_34,plain,
    ( d
    | d
    | c ),
    inference(resolve,[status(thm)],[c_15,c_11]) ).

cnf(c_16,plain,
    ( d
    | c ),
    inference(copy,[status(thm)],[c_34]) ).

cnf(c_17,plain,
    ( e
    | c ),
    inference(resolve,[status(thm)],[c_16,c_12]) ).

cnf(c_35,plain,
    ( c
    | a
    | c ),
    inference(resolve,[status(thm)],[c_16,c_3]) ).

cnf(c_18,plain,
    ( a
    | c ),
    inference(copy,[status(thm)],[c_35]) ).

cnf(c_36,plain,
    ( c
    | b
    | c ),
    inference(resolve,[status(thm)],[c_17,c_7]) ).

cnf(c_19,plain,
    ( b
    | c ),
    inference(copy,[status(thm)],[c_36]) ).

cnf(c_20,plain,
    ( ~ a
    | c ),
    inference(resolve,[status(thm)],[c_19,c_2]) ).

cnf(c_37,plain,
    ( c
    | c ),
    inference(resolve,[status(thm)],[c_20,c_18]) ).

cnf(c_21,plain,
    c,
    inference(copy,[status(thm)],[c_37]) ).

cnf(c_22,plain,
    ( a
    | ~ e ),
    inference(resolve,[status(thm)],[c_21,c_14]) ).

cnf(c_24,plain,
    ( e
    | b ),
    inference(resolve,[status(thm)],[c_21,c_8]) ).

cnf(c_25,plain,
    ( ~ d
    | ~ a ),
    inference(resolve,[status(thm)],[c_21,c_6]) ).

cnf(c_26,plain,
    ( d
    | a ),
    inference(resolve,[status(thm)],[c_21,c_4]) ).

cnf(c_27,plain,
    ( ~ a
    | e ),
    inference(resolve,[status(thm)],[c_24,c_2]) ).

cnf(c_28,plain,
    ( d
    | e ),
    inference(resolve,[status(thm)],[c_27,c_26]) ).

cnf(c_38,plain,
    ( d
    | d ),
    inference(resolve,[status(thm)],[c_28,c_11]) ).

cnf(c_29,plain,
    d,
    inference(copy,[status(thm)],[c_38]) ).

cnf(c_30,plain,
    ~ a,
    inference(resolve,[status(thm)],[c_29,c_25]) ).

cnf(c_31,plain,
    e,
    inference(resolve,[status(thm)],[c_29,c_12]) ).

cnf(c_39,plain,
    a,
    inference(resolve,[status(thm)],[c_31,c_22]) ).

cnf(c_32,plain,
    $false,
    inference(resolve,[status(thm)],[c_30,c_39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRA001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/5.49  % Computer : n006.cluster.edu
% 0.19/5.49  % Model    : x86_64 x86_64
% 0.19/5.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.49  % Memory   : 8046.5625MB
% 0.19/5.49  % OS       : Linux 6.8.0-71-generic
% 0.19/5.49  % CPULimit : 300
% 0.19/5.49  % WCLimit  : 300
% 0.19/5.49  % DateTime : Fri Sep 25 13:47:18 UTC 2026
% 0.19/5.49  % CPUTime  : 
% 0.19/5.50  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/5.50  % Process 3045829 was started by sandbox2 on n006,
% 0.19/5.50  % Fri Sep 25 13:47:18 2026
% 0.19/5.50  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.24/5.50  
% 0.24/5.50  % From the command line: assign(max_seconds, 300).
% 0.24/5.52  
% 0.24/5.52  % SZS status Unsatisfiable for theBenchmark
% 0.24/5.52  
% 0.24/5.52  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.24/5.52  % Length of proof is 31.
% 0.24/5.52  % Level of proof is 13.
% 0.24/5.52  % Maximum clause weight is 3.000.
% 0.24/5.52  % Given clauses 28.
% 0.24/5.52  
% 0.24/5.52  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------