↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LCL230-2 : 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 : n007.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:58:24 AM UTC 2026

% Result   : Unsatisfiable 0.20s 0.47s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   11 (   8 unt;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   11 (   6   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    4 (   3 usr;   4 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,
    ( r
    | p
    | ~ q ),
    file('theBenchmark.p',clause_1) ).

cnf(c_1,plain,
    ( r
    | p
    | ~ q ),
    inference(clausify,[status(thm)],[clause_1]) ).

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

cnf(c_2,plain,
    ~ p,
    inference(clausify,[status(thm)],[clause_2]) ).

fof(clause_3,axiom,
    q,
    file('theBenchmark.p',clause_3) ).

cnf(c_3,plain,
    q,
    inference(clausify,[status(thm)],[clause_3]) ).

fof(clause_4,axiom,
    ~ r,
    file('theBenchmark.p',clause_4) ).

cnf(c_4,plain,
    ~ r,
    inference(clausify,[status(thm)],[clause_4]) ).

cnf(c_6,plain,
    ( r
    | p ),
    inference(resolve,[status(thm)],[c_3,c_1]) ).

cnf(c_7,plain,
    r,
    inference(resolve,[status(thm)],[c_2,c_6]) ).

cnf(c_5,plain,
    $false,
    inference(resolve,[status(thm)],[c_4,c_7]) ).

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