↑ Up

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

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

% Result   : Unsatisfiable 0.88s 0.52s
% Output   : CNFRefutation 0.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   20 (  13 unt;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   32 (  18   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   20 (   7 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_26,axiom,
    n0(d,c),
    file('theBenchmark.p',axiom_26) ).

cnf(c_5,plain,
    n0(d,c),
    inference(clausify,[status(thm)],[axiom_26]) ).

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

cnf(c_242,plain,
    ( ~ k0(A)
    | p1(c,c,A) ),
    inference(resolve,[status(thm)],[c_15,c_5]) ).

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

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

fof(rule_071,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ s0(b)
      | ~ p1(VAR_1,VAR_3,VAR_0)
      | ~ l0(VAR_2)
      | p1(VAR_0,VAR_1,VAR_0) ),
    file('theBenchmark.p',rule_071) ).

cnf(c_416,plain,
    ( ~ s0(b)
    | ~ p1(B,D,A)
    | ~ l0(C)
    | p1(A,B,A) ),
    inference(clausify,[status(thm)],[rule_071]) ).

fof(axiom_28,axiom,
    k0(e),
    file('theBenchmark.p',axiom_28) ).

cnf(c_477,plain,
    k0(e),
    inference(clausify,[status(thm)],[axiom_28]) ).

fof(axiom_20,axiom,
    l0(a),
    file('theBenchmark.p',axiom_20) ).

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

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

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

cnf(c_609,plain,
    ( ~ p1(B,D,A)
    | ~ l0(C)
    | p1(A,B,A) ),
    inference(resolve,[status(thm)],[c_494,c_416]) ).

cnf(c_717,plain,
    p1(c,c,e),
    inference(resolve,[status(thm)],[c_477,c_242]) ).

cnf(c_869,plain,
    ( ~ p1(c,B,e)
    | ~ l0(A) ),
    inference(resolve,[status(thm)],[c_609,c_264]) ).

cnf(c_867,plain,
    ~ p1(c,A,e),
    inference(resolve,[status(thm)],[c_869,c_484]) ).

cnf(c_868,plain,
    $false,
    inference(resolve,[status(thm)],[c_867,c_717]) ).

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