↑ Up

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

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

% Computer : n011.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:24 AM UTC 2026

% Result   : Unsatisfiable 0.84s 0.50s
% Output   : CNFRefutation 0.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   76 (  30 unt;   0 def)
%            Number of atoms       :  173 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  212 ( 115   ~;  97   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   17 (  16 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :  115 (  36 sgn  36   !;   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_7,axiom,
    n0(d,b),
    file('theBenchmark.p',axiom_7) ).

cnf(c_8,plain,
    n0(d,b),
    inference(clausify,[status(thm)],[axiom_7]) ).

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

cnf(c_10,plain,
    ( ~ n0(B,A)
    | l1(A,A) ),
    inference(clausify,[status(thm)],[rule_002]) ).

fof(rule_063,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ k0(VAR_1)
      | ~ n0(d,VAR_0)
      | p1(VAR_0,VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_063) ).

cnf(c_15,plain,
    ( ~ k0(B)
    | ~ n0(d,A)
    | p1(A,A,B) ),
    inference(clausify,[status(thm)],[rule_063]) ).

fof(rule_066,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ n0(VAR_1,VAR_0)
      | p1(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_066) ).

cnf(c_17,plain,
    ( ~ n0(B,A)
    | p1(A,A,A) ),
    inference(clausify,[status(thm)],[rule_066]) ).

fof(rule_189,axiom,
    ! [VAR_0] :
      ( ~ s1(b)
      | ~ q2(b,VAR_0,b)
      | s2(VAR_0) ),
    file('theBenchmark.p',rule_189) ).

cnf(c_78,plain,
    ( ~ s1(b)
    | ~ q2(b,A,b)
    | s2(A) ),
    inference(clausify,[status(thm)],[rule_189]) ).

fof(rule_273,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ m0(VAR_2,VAR_3,VAR_1)
      | ~ s2(VAR_0)
      | ~ q2(VAR_2,VAR_0,VAR_2)
      | s3(VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_273) ).

cnf(c_90,plain,
    ( ~ m0(C,D,B)
    | ~ s2(A)
    | ~ q2(C,A,C)
    | s3(A,B) ),
    inference(clausify,[status(thm)],[rule_273]) ).

fof(rule_279,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ s3(a,VAR_0)
      | ~ l2(VAR_2,VAR_1)
      | m4(VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_279) ).

cnf(c_101,plain,
    ( ~ s3(a,A)
    | ~ l2(C,B)
    | m4(A,B) ),
    inference(clausify,[status(thm)],[rule_279]) ).

cnf(c_102,plain,
    ( ~ s1(b)
    | ~ q2(b,A,b)
    | ~ m0(C,D,B)
    | ~ q2(C,A,C)
    | s3(A,B) ),
    inference(resolve,[status(thm)],[c_90,c_78]) ).

cnf(c_137,plain,
    ( ~ l2(E,D)
    | m4(C,D)
    | ~ s1(b)
    | ~ q2(b,a,b)
    | ~ m0(A,B,C)
    | ~ q2(A,a,A) ),
    inference(resolve,[status(thm)],[c_102,c_101]) ).

cnf(c_238,plain,
    p1(a,a,a),
    inference(resolve,[status(thm)],[c_17,c_2]) ).

cnf(c_241,plain,
    ( ~ k0(A)
    | p1(b,b,A) ),
    inference(resolve,[status(thm)],[c_15,c_8]) ).

cnf(c_258,plain,
    l1(a,a),
    inference(resolve,[status(thm)],[c_10,c_2]) ).

fof(prove_this,axiom,
    ! [VAR_0] : ~ m4(e,VAR_0),
    file('theBenchmark.p',prove_this) ).

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

fof(rule_182,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ q2(VAR_1,VAR_2,VAR_0)
      | ~ n1(VAR_1,VAR_0,VAR_2)
      | ~ p1(VAR_0,VAR_0,VAR_2)
      | q2(VAR_0,VAR_1,VAR_0) ),
    file('theBenchmark.p',rule_182) ).

cnf(c_328,plain,
    ( ~ q2(B,C,A)
    | ~ n1(B,A,C)
    | ~ p1(A,A,C)
    | q2(A,B,A) ),
    inference(clausify,[status(thm)],[rule_182]) ).

fof(rule_177,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p1(VAR_0,VAR_0,VAR_0)
      | ~ k0(VAR_1)
      | q2(VAR_0,VAR_1,VAR_1) ),
    file('theBenchmark.p',rule_177) ).

cnf(c_333,plain,
    ( ~ p1(A,A,A)
    | ~ k0(B)
    | q2(A,B,B) ),
    inference(clausify,[status(thm)],[rule_177]) ).

fof(rule_133,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ m0(VAR_3,VAR_2,VAR_0)
      | ~ s1(VAR_2)
      | ~ p0(VAR_1,VAR_1)
      | l2(VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_133) ).

cnf(c_365,plain,
    ( ~ m0(D,C,A)
    | ~ s1(C)
    | ~ p0(B,B)
    | l2(A,A) ),
    inference(clausify,[status(thm)],[rule_133]) ).

fof(rule_126,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ s1(VAR_2)
      | ~ q0(VAR_0,VAR_1)
      | s1(VAR_0) ),
    file('theBenchmark.p',rule_126) ).

cnf(c_370,plain,
    ( ~ s1(C)
    | ~ q0(A,B)
    | s1(A) ),
    inference(clausify,[status(thm)],[rule_126]) ).

fof(rule_125,axiom,
    ! [VAR_0] :
      ( ~ p0(VAR_0,VAR_0)
      | s1(VAR_0) ),
    file('theBenchmark.p',rule_125) ).

cnf(c_371,plain,
    ( ~ p0(A,A)
    | s1(A) ),
    inference(clausify,[status(thm)],[rule_125]) ).

fof(rule_054,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ n1(VAR_0,VAR_1,VAR_0)
      | ~ l1(VAR_2,VAR_0)
      | ~ l0(VAR_2)
      | n1(VAR_0,VAR_1,VAR_1) ),
    file('theBenchmark.p',rule_054) ).

cnf(c_420,plain,
    ( ~ n1(A,B,A)
    | ~ l1(C,A)
    | ~ l0(C)
    | n1(A,B,B) ),
    inference(clausify,[status(thm)],[rule_054]) ).

fof(rule_050,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p0(b,VAR_1)
      | ~ l0(VAR_0)
      | ~ s0(b)
      | n1(VAR_0,VAR_1,VAR_0) ),
    file('theBenchmark.p',rule_050) ).

cnf(c_424,plain,
    ( ~ p0(b,B)
    | ~ l0(A)
    | ~ s0(b)
    | n1(A,B,A) ),
    inference(clausify,[status(thm)],[rule_050]) ).

fof(axiom_32,axiom,
    k0(b),
    file('theBenchmark.p',axiom_32) ).

cnf(c_466,plain,
    k0(b),
    inference(clausify,[status(thm)],[axiom_32]) ).

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_20,axiom,
    l0(a),
    file('theBenchmark.p',axiom_20) ).

cnf(c_476,plain,
    l0(a),
    inference(clausify,[status(thm)],[axiom_20]) ).

fof(axiom_17,axiom,
    ! [VAR_0] : q0(VAR_0,d),
    file('theBenchmark.p',axiom_17) ).

cnf(c_479,plain,
    q0(A,d),
    inference(clausify,[status(thm)],[axiom_17]) ).

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]) ).

fof(axiom_12,axiom,
    ! [VAR_0] : m0(a,VAR_0,a),
    file('theBenchmark.p',axiom_12) ).

cnf(c_483,plain,
    m0(a,A,a),
    inference(clausify,[status(thm)],[axiom_12]) ).

fof(axiom_5,axiom,
    s0(b),
    file('theBenchmark.p',axiom_5) ).

cnf(c_486,plain,
    s0(b),
    inference(clausify,[status(thm)],[axiom_5]) ).

cnf(c_543,plain,
    ( ~ l2(C,D)
    | ~ s1(b)
    | ~ q2(b,a,b)
    | ~ m0(A,B,e)
    | ~ q2(A,a,A) ),
    inference(resolve,[status(thm)],[c_264,c_137]) ).

cnf(c_792,plain,
    ( ~ p1(A,A,A)
    | q2(A,b,b) ),
    inference(resolve,[status(thm)],[c_333,c_466]) ).

cnf(c_560,plain,
    q2(a,b,b),
    inference(resolve,[status(thm)],[c_792,c_238]) ).

cnf(c_620,plain,
    s1(b),
    inference(resolve,[status(thm)],[c_371,c_481]) ).

cnf(c_793,plain,
    ( ~ p0(b,B)
    | ~ l0(A)
    | n1(A,B,A) ),
    inference(resolve,[status(thm)],[c_424,c_486]) ).

cnf(c_794,plain,
    ( ~ p0(b,A)
    | n1(a,A,a) ),
    inference(resolve,[status(thm)],[c_793,c_476]) ).

cnf(c_635,plain,
    n1(a,A,a),
    inference(resolve,[status(thm)],[c_794,c_481]) ).

cnf(c_795,plain,
    ( ~ l2(A,B)
    | ~ s1(b)
    | ~ q2(b,a,b)
    | ~ q2(b,a,b) ),
    inference(resolve,[status(thm)],[c_543,c_467]) ).

cnf(c_650,plain,
    ( ~ l2(A,B)
    | ~ s1(b)
    | ~ q2(b,a,b) ),
    inference(copy,[status(thm)],[c_795]) ).

cnf(c_659,plain,
    ( ~ p0(b,b)
    | ~ l2(A,B)
    | ~ q2(b,a,b) ),
    inference(resolve,[status(thm)],[c_650,c_371]) ).

cnf(c_667,plain,
    ( ~ l2(A,B)
    | ~ q2(b,a,b) ),
    inference(resolve,[status(thm)],[c_659,c_481]) ).

cnf(c_670,plain,
    ( ~ m0(C,B,D)
    | ~ s1(B)
    | ~ p0(A,A)
    | ~ q2(b,a,b) ),
    inference(resolve,[status(thm)],[c_667,c_365]) ).

cnf(c_796,plain,
    ( ~ s1(B)
    | s1(A) ),
    inference(resolve,[status(thm)],[c_370,c_479]) ).

cnf(c_672,plain,
    s1(A),
    inference(resolve,[status(thm)],[c_796,c_620]) ).

cnf(c_797,plain,
    ( ~ m0(B,A,C)
    | ~ s1(A)
    | ~ q2(b,a,b) ),
    inference(resolve,[status(thm)],[c_670,c_481]) ).

cnf(c_798,plain,
    ( ~ m0(A,B,C)
    | ~ q2(b,a,b) ),
    inference(resolve,[status(thm)],[c_797,c_672]) ).

cnf(c_691,plain,
    ~ q2(b,a,b),
    inference(resolve,[status(thm)],[c_798,c_483]) ).

cnf(c_693,plain,
    ( ~ q2(a,A,b)
    | ~ n1(a,b,A)
    | ~ p1(b,b,A) ),
    inference(resolve,[status(thm)],[c_691,c_328]) ).

cnf(c_698,plain,
    ( ~ k0(A)
    | ~ q2(a,A,b)
    | ~ n1(a,b,A) ),
    inference(resolve,[status(thm)],[c_693,c_241]) ).

cnf(c_716,plain,
    ( ~ q2(a,b,b)
    | ~ n1(a,b,b) ),
    inference(resolve,[status(thm)],[c_698,c_466]) ).

cnf(c_786,plain,
    ~ n1(a,b,b),
    inference(resolve,[status(thm)],[c_560,c_716]) ).

cnf(c_799,plain,
    ( ~ n1(a,b,a)
    | ~ l1(A,a)
    | ~ l0(A) ),
    inference(resolve,[status(thm)],[c_420,c_786]) ).

cnf(c_800,plain,
    ( ~ n1(a,b,a)
    | ~ l1(a,a) ),
    inference(resolve,[status(thm)],[c_799,c_476]) ).

cnf(c_790,plain,
    ~ n1(a,b,a),
    inference(resolve,[status(thm)],[c_800,c_258]) ).

cnf(c_791,plain,
    $false,
    inference(resolve,[status(thm)],[c_790,c_635]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN253-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n011.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 17:26:14 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35  % Process 1141060 was started by sandbox2 on n011,
% 0.09/0.35  % Sat Sep 26 17:26:14 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.36  
% 0.12/0.36  % From the command line: assign(max_seconds, 300).
% 0.84/0.50  
% 0.84/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.84/0.50  
% 0.84/0.50  % Proof 1 at 0.12 (+ 0.01) seconds.
% 0.84/0.50  % Length of proof is 44.
% 0.84/0.50  % Level of proof is 14.
% 0.84/0.50  % Maximum clause weight is 25.000.
% 0.84/0.50  % Given clauses 439.
% 0.84/0.50  
% 0.84/0.50  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------