↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN032-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 : n004.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:36:17 AM UTC 2026

% Result   : Unsatisfiable 0.15s 0.44s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (   4 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   51 (  19   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    7 (   6 usr;   7 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(three,axiom,
    ( ~ j
    | a
    | h ),
    file('theBenchmark.p',three) ).

cnf(c_1,plain,
    ( ~ j
    | a
    | h ),
    inference(clausify,[status(thm)],[three]) ).

fof(four,axiom,
    ( j
    | k
    | h ),
    file('theBenchmark.p',four) ).

cnf(c_2,plain,
    ( j
    | k
    | h ),
    inference(clausify,[status(thm)],[four]) ).

fof(five,axiom,
    ( ~ k
    | j
    | h ),
    file('theBenchmark.p',five) ).

cnf(c_3,plain,
    ( ~ k
    | j
    | h ),
    inference(clausify,[status(thm)],[five]) ).

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

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

fof(seven,axiom,
    ( ~ h
    | c ),
    file('theBenchmark.p',seven) ).

cnf(c_5,plain,
    ( ~ h
    | c ),
    inference(clausify,[status(thm)],[seven]) ).

fof(one,axiom,
    ( ~ c
    | ~ h ),
    file('theBenchmark.p',one) ).

cnf(c_6,plain,
    ( ~ c
    | ~ h ),
    inference(clausify,[status(thm)],[one]) ).

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

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

cnf(c_15,plain,
    ( j
    | h
    | j
    | h ),
    inference(resolve,[status(thm)],[c_3,c_2]) ).

cnf(c_16,plain,
    ( j
    | j
    | h ),
    inference(copy,[status(thm)],[c_15]) ).

cnf(c_8,plain,
    ( j
    | h ),
    inference(copy,[status(thm)],[c_16]) ).

cnf(c_17,plain,
    ( a
    | h
    | h ),
    inference(resolve,[status(thm)],[c_8,c_1]) ).

cnf(c_9,plain,
    ( a
    | h ),
    inference(copy,[status(thm)],[c_17]) ).

cnf(c_10,plain,
    ( b
    | h ),
    inference(resolve,[status(thm)],[c_9,c_4]) ).

cnf(c_11,plain,
    ( ~ a
    | h ),
    inference(resolve,[status(thm)],[c_10,c_7]) ).

cnf(c_18,plain,
    ( h
    | h ),
    inference(resolve,[status(thm)],[c_11,c_9]) ).

cnf(c_12,plain,
    h,
    inference(copy,[status(thm)],[c_18]) ).

cnf(c_13,plain,
    ~ c,
    inference(resolve,[status(thm)],[c_12,c_6]) ).

cnf(c_19,plain,
    ~ h,
    inference(resolve,[status(thm)],[c_13,c_5]) ).

cnf(c_14,plain,
    $false,
    inference(resolve,[status(thm)],[c_12,c_19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN032-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.41  % Computer : n004.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.41  % DateTime : Sat Sep 26 17:04:21 UTC 2026
% 0.15/0.42  % CPUTime  : 
% 0.15/0.42  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.42  % Process 2215003 was started by sandbox2 on n004,
% 0.15/0.42  % Sat Sep 26 17:04:21 2026
% 0.15/0.42  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/0.42  
% 0.15/0.42  % From the command line: assign(max_seconds, 300).
% 0.15/0.44  
% 0.15/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.44  
% 0.15/0.44  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/0.44  % Length of proof is 14.
% 0.15/0.44  % Level of proof is 7.
% 0.15/0.44  % Maximum clause weight is 3.000.
% 0.15/0.44  % Given clauses 11.
% 0.15/0.44  
% 0.15/0.44  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------