↑ Up

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

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

% Computer : n019.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:45:57 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
    ! [X] :
      ( ~ cowlNothing(X)
      & cowlThing(X) ),
    file('theBenchmark.p',axiom_0) ).

fof(axiom_2,axiom,
    ! [X] :
      ( cowlThing(X)
    <=> cowlNothing(X) ),
    file('theBenchmark.p',axiom_2) ).

cnf(c_4,plain,
    ( cowlNothing(A)
    | ~ cowlThing(A) ),
    inference(clausify,[status(thm)],[axiom_2]) ).

cnf(c_5,plain,
    cowlThing(A),
    inference(clausify,[status(thm)],[axiom_0]) ).

cnf(c_7,plain,
    ~ cowlNothing(A),
    inference(clausify,[status(thm)],[axiom_0]) ).

cnf(c_8,plain,
    cowlNothing(A),
    inference(resolve,[status(thm)],[c_4,c_5]) ).

cnf(c_11,plain,
    $false,
    inference(resolve,[status(thm)],[c_7,c_8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KRS066+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n019.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Fri Sep 25 19:37:49 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35  % Process 3487860 was started by sandbox on n019,
% 0.08/0.35  % Fri Sep 25 19:37:49 2026
% 0.08/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.36  
% 0.08/0.36  % From the command line: assign(max_seconds, 300).
% 0.08/0.36  
% 0.08/0.36  % SZS status Unsatisfiable for theBenchmark
% 0.08/0.36  
% 0.08/0.36  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.36  % Length of proof is 7.
% 0.08/0.36  % Level of proof is 3.
% 0.08/0.36  % Maximum clause weight is 0.000.
% 0.08/0.36  % Given clauses 0.
% 0.08/0.36  
% 0.08/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------