↑ Up

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(rule_001,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ n0(VAR_1,VAR_0)
      | k1(VAR_0) ),
    file('theBenchmark.p',rule_001) ).

cnf(c_1,plain,
    ( ~ n0(B,A)
    | k1(A) ),
    inference(clausify,[status(thm)],[rule_001]) ).

fof(axiom_15,axiom,
    n0(a,b),
    file('theBenchmark.p',axiom_15) ).

cnf(c_6,plain,
    n0(a,b),
    inference(clausify,[status(thm)],[axiom_15]) ).

cnf(c_259,plain,
    k1(b),
    inference(resolve,[status(thm)],[c_1,c_6]) ).

fof(prove_this,axiom,
    ~ l3(b,e),
    file('theBenchmark.p',prove_this) ).

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

fof(rule_215,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p2(VAR_0,VAR_1,VAR_0)
      | ~ r0(VAR_0)
      | l3(VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_215) ).

cnf(c_314,plain,
    ( ~ p2(A,B,A)
    | ~ r0(A)
    | l3(A,B) ),
    inference(clausify,[status(thm)],[rule_215]) ).

fof(rule_170,axiom,
    ! [VAR_0] :
      ( ~ n1(VAR_0,e,e)
      | p2(VAR_0,e,VAR_0) ),
    file('theBenchmark.p',rule_170) ).

cnf(c_338,plain,
    ( ~ n1(A,e,e)
    | p2(A,e,A) ),
    inference(clausify,[status(thm)],[rule_170]) ).

fof(rule_040,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ k1(VAR_0)
      | ~ m0(VAR_0,VAR_1,e)
      | n1(VAR_0,e,e) ),
    file('theBenchmark.p',rule_040) ).

cnf(c_433,plain,
    ( ~ k1(A)
    | ~ m0(A,B,e)
    | n1(A,e,e) ),
    inference(clausify,[status(thm)],[rule_040]) ).

fof(axiom_31,axiom,
    m0(b,b,e),
    file('theBenchmark.p',axiom_31) ).

cnf(c_467,plain,
    m0(b,b,e),
    inference(clausify,[status(thm)],[axiom_31]) ).

fof(axiom_9,axiom,
    r0(b),
    file('theBenchmark.p',axiom_9) ).

cnf(c_484,plain,
    r0(b),
    inference(clausify,[status(thm)],[axiom_9]) ).

cnf(c_642,plain,
    ( ~ k1(b)
    | n1(b,e,e) ),
    inference(resolve,[status(thm)],[c_433,c_467]) ).

cnf(c_569,plain,
    n1(b,e,e),
    inference(resolve,[status(thm)],[c_642,c_259]) ).

cnf(c_643,plain,
    ( ~ p2(b,e,b)
    | ~ r0(b) ),
    inference(resolve,[status(thm)],[c_314,c_264]) ).

cnf(c_631,plain,
    ~ p2(b,e,b),
    inference(resolve,[status(thm)],[c_643,c_484]) ).

cnf(c_640,plain,
    ~ n1(b,e,e),
    inference(resolve,[status(thm)],[c_631,c_338]) ).

cnf(c_641,plain,
    $false,
    inference(resolve,[status(thm)],[c_640,c_569]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN228-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.10/11.00  % Computer : n008.cluster.edu
% 0.10/11.00  % Model    : x86_64 x86_64
% 0.10/11.00  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/11.00  % Memory   : 8046.5625MB
% 0.10/11.00  % OS       : Linux 6.8.0-71-generic
% 0.10/11.00  % CPULimit : 300
% 0.10/11.00  % WCLimit  : 300
% 0.10/11.00  % DateTime : Sat Sep 26 17:25:05 UTC 2026
% 0.10/11.00  % CPUTime  : 
% 0.10/11.00  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/11.00  % Process 4145063 was started by sandbox on n008,
% 0.10/11.00  % Sat Sep 26 17:25:05 2026
% 0.10/11.00  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/11.02  
% 0.10/11.02  % From the command line: assign(max_seconds, 300).
% 0.14/11.14  
% 0.14/11.14  % SZS status Unsatisfiable for theBenchmark
% 0.14/11.14  
% 0.14/11.14  % Proof 1 at 0.11 (+ 0.01) seconds.
% 0.14/11.14  % Length of proof is 13.
% 0.14/11.14  % Level of proof is 3.
% 0.14/11.14  % Maximum clause weight is 10.000.
% 0.14/11.14  % Given clauses 371.
% 0.14/11.14  
% 0.14/11.14  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------