↑ Up

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

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

% Result   : Unsatisfiable 0.81s 0.51s
% Output   : CNFRefutation 0.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   47 (  21 unt;   0 def)
%            Number of atoms       :   89 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   90 (  48   ~;  42   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   58 (  20 sgn  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_37,axiom,
    n0(b,a),
    file('theBenchmark.p',axiom_37) ).

cnf(c_2,plain,
    n0(b,a),
    inference(clausify,[status(thm)],[axiom_37]) ).

fof(axiom_34,axiom,
    n0(c,d),
    file('theBenchmark.p',axiom_34) ).

cnf(c_3,plain,
    n0(c,d),
    inference(clausify,[status(thm)],[axiom_34]) ).

fof(axiom_30,axiom,
    n0(e,e),
    file('theBenchmark.p',axiom_30) ).

cnf(c_4,plain,
    n0(e,e),
    inference(clausify,[status(thm)],[axiom_30]) ).

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

cnf(c_21,plain,
    ( ~ p0(D,A)
    | ~ n0(C,B)
    | q1(A,B,A) ),
    inference(clausify,[status(thm)],[rule_092]) ).

fof(rule_255,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ n0(VAR_2,VAR_0)
      | ~ q2(VAR_2,VAR_0,VAR_1)
      | q3(VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_255) ).

cnf(c_27,plain,
    ( ~ n0(C,A)
    | ~ q2(C,A,B)
    | q3(A,B) ),
    inference(clausify,[status(thm)],[rule_255]) ).

fof(rule_274,axiom,
    ( ~ n3(e)
    | ~ q3(e,b)
    | ~ n0(c,d)
    | k4(c) ),
    file('theBenchmark.p',rule_274) ).

cnf(c_28,plain,
    ( ~ n3(e)
    | ~ q3(e,b)
    | ~ n0(c,d)
    | k4(c) ),
    inference(clausify,[status(thm)],[rule_274]) ).

fof(rule_240,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p2(VAR_1,VAR_2,VAR_0)
      | n3(VAR_0) ),
    file('theBenchmark.p',rule_240) ).

cnf(c_91,plain,
    ( ~ p2(B,C,A)
    | n3(A) ),
    inference(clausify,[status(thm)],[rule_240]) ).

cnf(c_98,plain,
    ( ~ n3(e)
    | ~ q3(e,b)
    | k4(c) ),
    inference(resolve,[status(thm)],[c_28,c_3]) ).

fof(rule_328,axiom,
    ! [VAR_0] :
      ( ~ k4(VAR_0)
      | r5(VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_328) ).

cnf(c_108,plain,
    ( ~ k4(A)
    | r5(A,A) ),
    inference(clausify,[status(thm)],[rule_328]) ).

cnf(c_112,plain,
    ( ~ q3(e,b)
    | k4(c)
    | ~ p2(A,B,e) ),
    inference(resolve,[status(thm)],[c_91,c_98]) ).

fof(prove_this,axiom,
    ~ r5(c,c),
    file('theBenchmark.p',prove_this) ).

cnf(c_132,plain,
    ~ r5(c,c),
    inference(clausify,[status(thm)],[prove_this]) ).

cnf(c_134,plain,
    ( r5(c,c)
    | ~ q3(e,b)
    | ~ p2(A,B,e) ),
    inference(resolve,[status(thm)],[c_112,c_108]) ).

cnf(c_137,plain,
    ( ~ q3(e,b)
    | ~ p2(A,B,e) ),
    inference(resolve,[status(thm)],[c_132,c_134]) ).

cnf(c_213,plain,
    ( ~ q2(e,e,A)
    | q3(e,A) ),
    inference(resolve,[status(thm)],[c_27,c_4]) ).

cnf(c_237,plain,
    ( ~ p0(B,A)
    | q1(A,a,A) ),
    inference(resolve,[status(thm)],[c_21,c_2]) ).

fof(rule_186,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ l1(VAR_1,VAR_0)
      | q2(VAR_0,VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_186) ).

cnf(c_330,plain,
    ( ~ l1(B,A)
    | q2(A,A,B) ),
    inference(clausify,[status(thm)],[rule_186]) ).

fof(rule_141,axiom,
    ! [VAR_0] :
      ( ~ q1(VAR_0,a,VAR_0)
      | p2(VAR_0,a,VAR_0) ),
    file('theBenchmark.p',rule_141) ).

cnf(c_370,plain,
    ( ~ q1(A,a,A)
    | p2(A,a,A) ),
    inference(clausify,[status(thm)],[rule_141]) ).

fof(rule_003,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ m0(VAR_1,VAR_0,VAR_2)
      | ~ r0(VAR_3)
      | ~ p0(VAR_2,VAR_0)
      | l1(VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_003) ).

cnf(c_474,plain,
    ( ~ m0(B,A,C)
    | ~ r0(D)
    | ~ p0(C,A)
    | l1(A,B) ),
    inference(clausify,[status(thm)],[rule_003]) ).

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

cnf(c_483,plain,
    m0(e,b,c),
    inference(clausify,[status(thm)],[axiom_27]) ).

fof(axiom_18,axiom,
    p0(c,b),
    file('theBenchmark.p',axiom_18) ).

cnf(c_491,plain,
    p0(c,b),
    inference(clausify,[status(thm)],[axiom_18]) ).

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

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

fof(axiom_13,axiom,
    r0(e),
    file('theBenchmark.p',axiom_13) ).

cnf(c_495,plain,
    r0(e),
    inference(clausify,[status(thm)],[axiom_13]) ).

cnf(c_658,plain,
    ( ~ p2(A,B,e)
    | ~ q2(e,e,b) ),
    inference(resolve,[status(thm)],[c_213,c_137]) ).

cnf(c_843,plain,
    q1(A,a,A),
    inference(resolve,[status(thm)],[c_494,c_237]) ).

cnf(c_873,plain,
    p2(A,a,A),
    inference(resolve,[status(thm)],[c_843,c_370]) ).

cnf(c_938,plain,
    ( ~ m0(A,b,c)
    | ~ r0(B)
    | l1(b,A) ),
    inference(resolve,[status(thm)],[c_474,c_491]) ).

cnf(c_939,plain,
    ( ~ m0(A,b,c)
    | l1(b,A) ),
    inference(resolve,[status(thm)],[c_938,c_495]) ).

cnf(c_876,plain,
    l1(b,e),
    inference(resolve,[status(thm)],[c_939,c_483]) ).

cnf(c_940,plain,
    ( ~ l1(b,e)
    | ~ p2(A,B,e) ),
    inference(resolve,[status(thm)],[c_658,c_330]) ).

cnf(c_936,plain,
    ~ p2(A,B,e),
    inference(resolve,[status(thm)],[c_876,c_940]) ).

cnf(c_937,plain,
    $false,
    inference(resolve,[status(thm)],[c_936,c_873]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN194-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.36  % Computer : n006.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 17:20:25 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 1760592 was started by sandbox on n006,
% 0.09/0.37  % Sat Sep 26 17:20:25 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.81/0.51  
% 0.81/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.81/0.51  
% 0.81/0.51  % Proof 1 at 0.11 (+ 0.01) seconds.
% 0.81/0.51  % Length of proof is 28.
% 0.81/0.51  % Level of proof is 7.
% 0.81/0.51  % Maximum clause weight is 17.000.
% 0.81/0.51  % Given clauses 317.
% 0.81/0.51  
% 0.81/0.51  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------