↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN147-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 : n017.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:09 AM UTC 2026

% Result   : Unsatisfiable 0.14s 5.48s
% Output   : CNFRefutation 0.14s
% 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 :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    2 (   0 sgn   1   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,axiom,
    ! [VAR_0] : ~ n1(VAR_0,d,VAR_0),
    file('theBenchmark.p',prove_this) ).

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

fof(rule_045,axiom,
    ( ~ q0(d,d)
    | n1(d,d,d) ),
    file('theBenchmark.p',rule_045) ).

cnf(c_435,plain,
    ( ~ q0(d,d)
    | n1(d,d,d) ),
    inference(clausify,[status(thm)],[rule_045]) ).

cnf(c_436,plain,
    ~ q0(d,d),
    inference(resolve,[status(thm)],[c_264,c_435]) ).

fof(axiom_25,axiom,
    q0(d,d),
    file('theBenchmark.p',axiom_25) ).

cnf(c_480,plain,
    q0(d,d),
    inference(clausify,[status(thm)],[axiom_25]) ).

cnf(c_481,plain,
    $false,
    inference(resolve,[status(thm)],[c_436,c_480]) ).

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