↑ Up

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

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

% Result   : Unsatisfiable 0.75s 0.54s
% Output   : CNFRefutation 0.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   27 (  15 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   49 (  27   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   28 (   4 sgn  11   !;   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_30,axiom,
    n0(e,e),
    file('theBenchmark.p',axiom_30) ).

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

cnf(c_261,plain,
    k1(e),
    inference(resolve,[status(thm)],[c_1,c_4]) ).

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

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

fof(rule_183,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ l2(VAR_1,VAR_0)
      | ~ l0(c)
      | ~ k1(VAR_1)
      | q2(VAR_0,c,VAR_1) ),
    file('theBenchmark.p',rule_183) ).

cnf(c_328,plain,
    ( ~ l2(B,A)
    | ~ l0(c)
    | ~ k1(B)
    | q2(A,c,B) ),
    inference(clausify,[status(thm)],[rule_183]) ).

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_370,plain,
    ( ~ m0(D,C,A)
    | ~ s1(C)
    | ~ p0(B,B)
    | l2(A,A) ),
    inference(clausify,[status(thm)],[rule_133]) ).

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

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

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

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

fof(axiom_24,axiom,
    l0(c),
    file('theBenchmark.p',axiom_24) ).

cnf(c_480,plain,
    l0(c),
    inference(clausify,[status(thm)],[axiom_24]) ).

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

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

cnf(c_604,plain,
    ( ~ l2(B,A)
    | ~ k1(B)
    | q2(A,c,B) ),
    inference(resolve,[status(thm)],[c_480,c_328]) ).

cnf(c_742,plain,
    ( ~ s1(b)
    | ~ p0(A,A)
    | l2(e,e) ),
    inference(resolve,[status(thm)],[c_475,c_370]) ).

cnf(c_835,plain,
    s1(b),
    inference(resolve,[status(thm)],[c_489,c_377]) ).

cnf(c_850,plain,
    ( ~ p0(A,A)
    | l2(e,e) ),
    inference(resolve,[status(thm)],[c_835,c_742]) ).

cnf(c_887,plain,
    ( ~ l2(A,e)
    | ~ k1(A) ),
    inference(resolve,[status(thm)],[c_604,c_264]) ).

cnf(c_882,plain,
    ~ l2(e,e),
    inference(resolve,[status(thm)],[c_887,c_261]) ).

cnf(c_885,plain,
    ~ p0(A,A),
    inference(resolve,[status(thm)],[c_882,c_850]) ).

cnf(c_886,plain,
    $false,
    inference(resolve,[status(thm)],[c_885,c_489]) ).

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