↑ Up

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

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

% Computer : n026.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:37:29 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,axiom,
    ~ q1(d,b,b),
    file('theBenchmark.p',prove_this) ).

cnf(c_264,plain,
    ~ q1(d,b,b),
    inference(clausify,[status(thm)],[prove_this]) ).

fof(rule_095,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p0(VAR_1,VAR_0)
      | q1(VAR_0,VAR_1,VAR_1) ),
    file('theBenchmark.p',rule_095) ).

cnf(c_393,plain,
    ( ~ p0(B,A)
    | q1(A,B,B) ),
    inference(clausify,[status(thm)],[rule_095]) ).

fof(axiom_14,axiom,
    ! [VAR_0] : p0(b,VAR_0),
    file('theBenchmark.p',axiom_14) ).

cnf(c_481,plain,
    p0(b,A),
    inference(clausify,[status(thm)],[axiom_14]) ).

cnf(c_556,plain,
    ~ p0(b,d),
    inference(resolve,[status(thm)],[c_393,c_264]) ).

cnf(c_557,plain,
    $false,
    inference(resolve,[status(thm)],[c_556,c_481]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN292-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n026.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep 26 17:33:11 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 1559998 was started by sandbox on n026,
% 0.09/0.37  % Sat Sep 26 17:33:11 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38  
% 0.09/0.38  % From the command line: assign(max_seconds, 300).
% 0.69/0.50  
% 0.69/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.69/0.50  
% 0.69/0.50  % Proof 1 at 0.10 (+ 0.00) seconds.
% 0.69/0.50  % Length of proof is 5.
% 0.69/0.50  % Level of proof is 2.
% 0.69/0.50  % Maximum clause weight is 12.000.
% 0.69/0.50  % Given clauses 252.
% 0.69/0.50  
% 0.69/0.50  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------