↑ Up

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

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

% Result   : Unsatisfiable 0.97s 0.57s
% Output   : CNFRefutation 0.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   46 (  19 unt;   0 def)
%            Number of atoms       :   89 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   93 (  50   ~;  43   |;   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    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   48 (  12 sgn  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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_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_058,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ n0(VAR_1,VAR_0)
      | ~ l1(VAR_1,VAR_0)
      | n1(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_058) ).

cnf(c_14,plain,
    ( ~ n0(B,A)
    | ~ l1(B,A)
    | n1(A,A,A) ),
    inference(clausify,[status(thm)],[rule_058]) ).

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_304,axiom,
    ! [VAR_0] :
      ( ~ k4(VAR_0)
      | m5(VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_304) ).

cnf(c_106,plain,
    ( ~ k4(A)
    | m5(A,A) ),
    inference(clausify,[status(thm)],[rule_304]) ).

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,
    ! [VAR_0] : ~ m5(c,VAR_0),
    file('theBenchmark.p',prove_this) ).

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

cnf(c_135,plain,
    ( m5(c,c)
    | ~ q3(e,b)
    | ~ p2(A,B,e) ),
    inference(resolve,[status(thm)],[c_112,c_106]) ).

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

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

cnf(c_258,plain,
    ( ~ l1(e,e)
    | n1(e,e,e) ),
    inference(resolve,[status(thm)],[c_14,c_4]) ).

cnf(c_266,plain,
    l1(e,e),
    inference(resolve,[status(thm)],[c_10,c_4]) ).

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

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

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

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_478,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_487,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_495,plain,
    p0(c,b),
    inference(clausify,[status(thm)],[axiom_18]) ).

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

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

cnf(c_560,plain,
    n1(e,e,e),
    inference(resolve,[status(thm)],[c_266,c_258]) ).

cnf(c_849,plain,
    ( ~ q3(e,b)
    | ~ n1(e,e,e) ),
    inference(resolve,[status(thm)],[c_348,c_140]) ).

cnf(c_696,plain,
    ~ q3(e,b),
    inference(resolve,[status(thm)],[c_560,c_849]) ).

cnf(c_850,plain,
    ( ~ m0(A,b,c)
    | ~ r0(B)
    | l1(b,A) ),
    inference(resolve,[status(thm)],[c_478,c_495]) ).

cnf(c_851,plain,
    ( ~ m0(A,b,c)
    | l1(b,A) ),
    inference(resolve,[status(thm)],[c_850,c_499]) ).

cnf(c_792,plain,
    l1(b,e),
    inference(resolve,[status(thm)],[c_851,c_487]) ).

cnf(c_846,plain,
    ~ q2(e,e,b),
    inference(resolve,[status(thm)],[c_696,c_217]) ).

cnf(c_852,plain,
    ~ l1(b,e),
    inference(resolve,[status(thm)],[c_846,c_334]) ).

cnf(c_848,plain,
    $false,
    inference(resolve,[status(thm)],[c_792,c_852]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN141-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.35  % Computer : n014.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:14:47 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36  % Process 3702559 was started by sandbox on n014,
% 0.09/0.36  % Sat Sep 26 17:14:47 2026
% 0.09/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.37  
% 0.13/0.37  % From the command line: assign(max_seconds, 300).
% 0.97/0.57  
% 0.97/0.57  % SZS status Unsatisfiable for theBenchmark
% 0.97/0.57  
% 0.97/0.57  % Proof 1 at 0.13 (+ 0.01) seconds.
% 0.97/0.57  % Length of proof is 27.
% 0.97/0.57  % Level of proof is 7.
% 0.97/0.57  % Maximum clause weight is 14.000.
% 0.97/0.57  % Given clauses 323.
% 0.97/0.57  
% 0.97/0.57  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------