↑ Up

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

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

% Result   : Unsatisfiable 0.67s 0.51s
% Output   : CNFRefutation 0.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   43 (  19 unt;   0 def)
%            Number of atoms       :   94 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  111 (  60   ~;  51   |;   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    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   56 (  15 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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]) ).

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_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(prove_this,axiom,
    ! [VAR_0] : ~ s3(VAR_0,b),
    file('theBenchmark.p',prove_this) ).

cnf(c_100,plain,
    ~ s3(A,b),
    inference(clausify,[status(thm)],[prove_this]) ).

cnf(c_103,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_140,plain,
    ( ~ s1(b)
    | ~ q2(b,B,b)
    | ~ m0(A,C,b)
    | ~ q2(A,B,A) ),
    inference(resolve,[status(thm)],[c_103,c_100]) ).

cnf(c_238,plain,
    p1(b,b,b),
    inference(resolve,[status(thm)],[c_17,c_6]) ).

cnf(c_258,plain,
    l1(b,b),
    inference(resolve,[status(thm)],[c_10,c_6]) ).

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_328,plain,
    ( ~ l1(B,A)
    | q2(A,A,B) ),
    inference(clausify,[status(thm)],[rule_186]) ).

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_332,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_125,axiom,
    ! [VAR_0] :
      ( ~ p0(VAR_0,VAR_0)
      | s1(VAR_0) ),
    file('theBenchmark.p',rule_125) ).

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

fof(rule_061,axiom,
    ! [VAR_0] :
      ( ~ s0(VAR_0)
      | ~ k0(VAR_0)
      | n1(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_061) ).

cnf(c_425,plain,
    ( ~ s0(A)
    | ~ k0(A)
    | n1(A,A,A) ),
    inference(clausify,[status(thm)],[rule_061]) ).

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

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

fof(axiom_19,axiom,
    ! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
    file('theBenchmark.p',axiom_19) ).

cnf(c_488,plain,
    m0(A,d,B),
    inference(clausify,[status(thm)],[axiom_19]) ).

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

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

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

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

cnf(c_686,plain,
    q2(b,b,b),
    inference(resolve,[status(thm)],[c_328,c_258]) ).

cnf(c_694,plain,
    ( ~ s1(b)
    | ~ m0(C,D,b)
    | ~ q2(C,B,C)
    | ~ q2(B,A,b)
    | ~ n1(B,b,A)
    | ~ p1(b,b,A) ),
    inference(resolve,[status(thm)],[c_332,c_140]) ).

cnf(c_876,plain,
    ( ~ s1(b)
    | ~ m0(b,A,b)
    | ~ q2(b,b,b)
    | ~ n1(b,b,b)
    | ~ p1(b,b,b) ),
    inference(factor,[status(thm)],[c_694]) ).

cnf(c_877,plain,
    ( ~ s1(b)
    | ~ m0(b,A,b)
    | ~ q2(b,b,b)
    | ~ n1(b,b,b) ),
    inference(resolve,[status(thm)],[c_238,c_876]) ).

cnf(c_696,plain,
    ( ~ s1(b)
    | ~ m0(b,A,b)
    | ~ n1(b,b,b) ),
    inference(resolve,[status(thm)],[c_686,c_877]) ).

cnf(c_878,plain,
    ( ~ s0(b)
    | n1(b,b,b) ),
    inference(resolve,[status(thm)],[c_477,c_425]) ).

cnf(c_747,plain,
    n1(b,b,b),
    inference(resolve,[status(thm)],[c_497,c_878]) ).

cnf(c_755,plain,
    ( ~ s1(b)
    | ~ m0(b,A,b) ),
    inference(resolve,[status(thm)],[c_747,c_696]) ).

cnf(c_857,plain,
    s1(b),
    inference(resolve,[status(thm)],[c_492,c_380]) ).

cnf(c_874,plain,
    ~ m0(b,A,b),
    inference(resolve,[status(thm)],[c_857,c_755]) ).

cnf(c_875,plain,
    $false,
    inference(resolve,[status(thm)],[c_874,c_488]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN203-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.08/0.35  % Computer : n005.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 26 17:21:02 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36  % Process 2635792 was started by sandbox on n005,
% 0.08/0.36  % Sat Sep 26 17:21:02 2026
% 0.08/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.37  
% 0.08/0.37  % From the command line: assign(max_seconds, 300).
% 0.67/0.51  
% 0.67/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.67/0.51  
% 0.67/0.51  % Proof 1 at 0.11 (+ 0.01) seconds.
% 0.67/0.51  % Length of proof is 26.
% 0.67/0.51  % Level of proof is 7.
% 0.67/0.51  % Maximum clause weight is 27.000.
% 0.67/0.51  % Given clauses 254.
% 0.67/0.51  
% 0.67/0.51  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------