↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN574-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n017.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:38:52 AM UTC 2026

% Result   : Unsatisfiable 0.17s 0.46s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   37 (  18 unt;   0 def)
%            Number of atoms       :   81 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   95 (  51   ~;  44   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(p7_2,axiom,
    ! [VAR_0] : p7(VAR_0,VAR_0),
    file('theBenchmark.p',p7_2) ).

cnf(c_2,plain,
    p7(A,A),
    inference(clausify,[status(thm)],[p7_2]) ).

fof(p3_3,axiom,
    ! [VAR_0] : p3(VAR_0,VAR_0),
    file('theBenchmark.p',p3_3) ).

cnf(c_3,plain,
    p3(A,A),
    inference(clausify,[status(thm)],[p3_3]) ).

fof(p2_4,axiom,
    ! [VAR_0] : p2(VAR_0,VAR_0),
    file('theBenchmark.p',p2_4) ).

cnf(c_4,plain,
    p2(A,A),
    inference(clausify,[status(thm)],[p2_4]) ).

fof(p9_5,axiom,
    p9(c12,c13),
    file('theBenchmark.p',p9_5) ).

cnf(c_5,plain,
    p9(c12,c13),
    inference(clausify,[status(thm)],[p9_5]) ).

fof(p11_6,axiom,
    p11(c14,c15),
    file('theBenchmark.p',p11_6) ).

cnf(c_6,plain,
    p11(c14,c15),
    inference(clausify,[status(thm)],[p11_6]) ).

fof(p3_7,axiom,
    ! [VAR_0] : p3(f4(f5(VAR_0)),f4(VAR_0)),
    file('theBenchmark.p',p3_7) ).

cnf(c_7,plain,
    p3(f4(f5(A)),f4(A)),
    inference(clausify,[status(thm)],[p3_7]) ).

fof(p9_10,axiom,
    ! [VAR_0] :
      ( ~ p9(VAR_0,c13)
      | p9(VAR_0,f4(c14)) ),
    file('theBenchmark.p',p9_10) ).

cnf(c_10,plain,
    ( ~ p9(A,c13)
    | p9(A,f4(c14)) ),
    inference(clausify,[status(thm)],[p9_10]) ).

fof(p3_16,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p3(VAR_2,VAR_1)
      | ~ p3(VAR_2,VAR_0)
      | p3(VAR_0,VAR_1) ),
    file('theBenchmark.p',p3_16) ).

cnf(c_16,plain,
    ( ~ p3(C,B)
    | ~ p3(C,A)
    | p3(A,B) ),
    inference(clausify,[status(thm)],[p3_16]) ).

fof(p9_19,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ p3(VAR_3,VAR_1)
      | ~ p9(VAR_2,VAR_3)
      | ~ p7(VAR_2,VAR_0)
      | p9(VAR_0,VAR_1) ),
    file('theBenchmark.p',p9_19) ).

cnf(c_19,plain,
    ( ~ p3(D,B)
    | ~ p9(C,D)
    | ~ p7(C,A)
    | p9(A,B) ),
    inference(clausify,[status(thm)],[p9_19]) ).

fof(p9_21,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p2(VAR_1,f5(VAR_2))
      | ~ p9(c12,VAR_0)
      | ~ p11(VAR_2,c15)
      | p9(f8(VAR_0,VAR_1),f4(VAR_1))
      | p9(f8(VAR_0,VAR_1),VAR_0) ),
    file('theBenchmark.p',p9_21) ).

cnf(c_21,plain,
    ( ~ p2(B,f5(C))
    | ~ p9(c12,A)
    | ~ p11(C,c15)
    | p9(f8(A,B),f4(B))
    | p9(f8(A,B),A) ),
    inference(clausify,[status(thm)],[p9_21]) ).

fof(not_p11_22,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p9(f8(VAR_1,VAR_2),f4(VAR_2))
      | ~ p9(f8(VAR_1,VAR_2),VAR_1)
      | ~ p2(VAR_2,f5(VAR_0))
      | ~ p9(c12,VAR_1)
      | ~ p11(VAR_0,c15) ),
    file('theBenchmark.p',not_p11_22) ).

cnf(c_22,plain,
    ( ~ p9(f8(B,C),f4(C))
    | ~ p9(f8(B,C),B)
    | ~ p2(C,f5(A))
    | ~ p9(c12,B)
    | ~ p11(A,c15) ),
    inference(clausify,[status(thm)],[not_p11_22]) ).

cnf(c_23,plain,
    ( ~ p2(A,f5(B))
    | ~ p9(c12,f4(A))
    | ~ p11(B,c15)
    | p9(f8(f4(A),A),f4(A)) ),
    inference(factor,[status(thm)],[c_21]) ).

cnf(c_25,plain,
    p9(c12,f4(c14)),
    inference(resolve,[status(thm)],[c_10,c_5]) ).

cnf(c_32,plain,
    ( ~ p3(B,A)
    | p3(A,B) ),
    inference(resolve,[status(thm)],[c_16,c_3]) ).

cnf(c_35,plain,
    ( ~ p3(C,B)
    | ~ p9(A,C)
    | p9(A,B) ),
    inference(resolve,[status(thm)],[c_19,c_2]) ).

cnf(c_41,plain,
    ( ~ p9(f8(A,B),f4(B))
    | ~ p9(f8(A,B),A)
    | ~ p2(B,f5(c14))
    | ~ p9(c12,A) ),
    inference(resolve,[status(thm)],[c_22,c_6]) ).

cnf(c_42,plain,
    ( ~ p9(f8(f4(A),A),f4(A))
    | ~ p2(A,f5(c14))
    | ~ p9(c12,f4(A)) ),
    inference(factor,[status(thm)],[c_41]) ).

cnf(c_44,plain,
    p3(f4(A),f4(f5(A))),
    inference(resolve,[status(thm)],[c_32,c_7]) ).

cnf(c_46,plain,
    ( ~ p3(f4(c14),A)
    | p9(c12,A) ),
    inference(resolve,[status(thm)],[c_35,c_25]) ).

cnf(c_53,plain,
    p9(c12,f4(f5(c14))),
    inference(resolve,[status(thm)],[c_44,c_46]) ).

cnf(c_67,plain,
    ( ~ p9(f8(f4(f5(c14)),f5(c14)),f4(f5(c14)))
    | ~ p2(f5(c14),f5(c14)) ),
    inference(resolve,[status(thm)],[c_42,c_53]) ).

cnf(c_59,plain,
    ~ p9(f8(f4(f5(c14)),f5(c14)),f4(f5(c14))),
    inference(resolve,[status(thm)],[c_67,c_4]) ).

cnf(c_68,plain,
    ( ~ p2(f5(c14),f5(A))
    | ~ p9(c12,f4(f5(c14)))
    | ~ p11(A,c15) ),
    inference(resolve,[status(thm)],[c_23,c_59]) ).

cnf(c_69,plain,
    ( ~ p2(f5(c14),f5(A))
    | ~ p11(A,c15) ),
    inference(resolve,[status(thm)],[c_68,c_53]) ).

cnf(c_70,plain,
    ~ p11(c14,c15),
    inference(resolve,[status(thm)],[c_69,c_4]) ).

cnf(c_66,plain,
    $false,
    inference(resolve,[status(thm)],[c_6,c_70]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN574-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n017.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sat Sep 26 18:09:48 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44  % Process 1345192 was started by sandbox2 on n017,
% 0.17/0.44  % Sat Sep 26 18:09:48 2026
% 0.17/0.44  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.45  
% 0.17/0.45  % From the command line: assign(max_seconds, 300).
% 0.17/0.46  
% 0.17/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.46  
% 0.17/0.46  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.17/0.46  % Length of proof is 22.
% 0.17/0.46  % Level of proof is 5.
% 0.17/0.46  % Maximum clause weight is 33.000.
% 0.17/0.46  % Given clauses 48.
% 0.17/0.46  
% 0.17/0.46  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------