↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN177-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 : n012.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.25s 0.41s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   20 (  12 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  15   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   18 (   2 sgn   8   !;   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_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_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_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]) ).

cnf(c_202,plain,
    ( ~ q2(a,b,A)
    | q3(b,A) ),
    inference(resolve,[status(thm)],[c_27,c_6]) ).

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

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

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

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_331,plain,
    ( ~ p1(A,A,A)
    | ~ k0(B)
    | q2(A,B,B) ),
    inference(clausify,[status(thm)],[rule_177]) ).

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

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

cnf(c_666,plain,
    ~ q2(a,b,b),
    inference(resolve,[status(thm)],[c_261,c_202]) ).

cnf(c_691,plain,
    ( ~ p1(A,A,A)
    | q2(A,b,b) ),
    inference(resolve,[status(thm)],[c_331,c_471]) ).

cnf(c_692,plain,
    q2(a,b,b),
    inference(resolve,[status(thm)],[c_691,c_235]) ).

cnf(c_690,plain,
    $false,
    inference(resolve,[status(thm)],[c_666,c_692]) ).

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