↑ Up

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

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

% Computer : n013.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:49 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.39s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   36 (  15 unt;   0 def)
%            Number of atoms       :   74 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   86 (  48   ~;  38   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-3 aty)
%            Number of variables   :   60 (   0 sgn  22   !;   0   ?)

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

cnf(c_1,plain,
    p2(A,A),
    inference(clausify,[status(thm)],[p2_1]) ).

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

cnf(c_2,plain,
    p3(A,A),
    inference(clausify,[status(thm)],[p3_2]) ).

fof(p2_3,axiom,
    p2(c10,c13),
    file('theBenchmark.p',p2_3) ).

cnf(c_3,plain,
    p2(c10,c13),
    inference(clausify,[status(thm)],[p2_3]) ).

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

cnf(c_6,plain,
    ( ~ p2(C,B)
    | ~ p2(C,A)
    | p2(A,B) ),
    inference(clausify,[status(thm)],[p2_6]) ).

fof(p3_7,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_7) ).

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

fof(p3_8,axiom,
    p3(c9,f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11)),
    file('theBenchmark.p',p3_8) ).

cnf(c_8,plain,
    p3(c9,f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11)),
    inference(clausify,[status(thm)],[p3_8]) ).

fof(not_p3_9,axiom,
    ~ p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11)),
    file('theBenchmark.p',not_p3_9) ).

cnf(c_9,plain,
    ~ p3(c9,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11)),
    inference(clausify,[status(thm)],[not_p3_9]) ).

fof(p2_10,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ p2(VAR_1,VAR_3)
      | ~ p2(VAR_0,VAR_2)
      | p2(f5(VAR_0,VAR_1),f5(VAR_2,VAR_3)) ),
    file('theBenchmark.p',p2_10) ).

cnf(c_10,plain,
    ( ~ p2(B,D)
    | ~ p2(A,C)
    | p2(f5(A,B),f5(C,D)) ),
    inference(clausify,[status(thm)],[p2_10]) ).

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

cnf(c_11,plain,
    ( ~ p3(A,C)
    | ~ p2(B,D)
    | p2(f8(A,B),f8(C,D)) ),
    inference(clausify,[status(thm)],[p2_11]) ).

fof(p3_12,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
      ( ~ p2(VAR_0,VAR_3)
      | ~ p3(VAR_2,VAR_5)
      | ~ p2(VAR_1,VAR_4)
      | p3(f4(VAR_0,VAR_1,VAR_2),f4(VAR_3,VAR_4,VAR_5)) ),
    file('theBenchmark.p',p3_12) ).

cnf(c_12,plain,
    ( ~ p2(A,D)
    | ~ p3(C,F)
    | ~ p2(B,E)
    | p3(f4(A,B,C),f4(D,E,F)) ),
    inference(clausify,[status(thm)],[p3_12]) ).

cnf(c_17,plain,
    ( ~ p2(c10,A)
    | p2(c13,A) ),
    inference(resolve,[status(thm)],[c_6,c_3]) ).

cnf(c_230,plain,
    ( ~ p2(c10,A)
    | p2(c13,A) ),
    inference(resolve,[status(thm)],[c_6,c_3]) ).

cnf(c_20,plain,
    p2(c13,c10),
    inference(resolve,[status(thm)],[c_230,c_1]) ).

cnf(c_231,plain,
    ( ~ p3(c9,A)
    | p3(f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11),A) ),
    inference(resolve,[status(thm)],[c_7,c_8]) ).

cnf(c_24,plain,
    p3(f4(c13,f5(f8(c11,c13),f6(f7(c12))),c11),c9),
    inference(resolve,[status(thm)],[c_231,c_2]) ).

cnf(c_25,plain,
    ( ~ p3(A,f4(c10,f5(f8(c11,c10),f6(f7(c12))),c11))
    | ~ p3(A,c9) ),
    inference(resolve,[status(thm)],[c_9,c_7]) ).

cnf(c_105,plain,
    ( ~ p2(A,c10)
    | ~ p3(C,c11)
    | ~ p2(B,f5(f8(c11,c10),f6(f7(c12))))
    | ~ p3(f4(A,B,C),c9) ),
    inference(resolve,[status(thm)],[c_25,c_12]) ).

cnf(c_113,plain,
    ( ~ p2(A,c10)
    | ~ p2(B,f5(f8(c11,c10),f6(f7(c12))))
    | ~ p3(f4(A,B,c11),c9) ),
    inference(resolve,[status(thm)],[c_105,c_2]) ).

cnf(c_232,plain,
    ( ~ p2(c10,c10)
    | ~ p2(A,f5(f8(c11,c10),f6(f7(c12))))
    | ~ p3(f4(c13,A,c11),c9) ),
    inference(resolve,[status(thm)],[c_113,c_17]) ).

cnf(c_125,plain,
    ( ~ p2(A,f5(f8(c11,c10),f6(f7(c12))))
    | ~ p3(f4(c13,A,c11),c9) ),
    inference(resolve,[status(thm)],[c_1,c_232]) ).

cnf(c_233,plain,
    ( ~ p3(A,B)
    | p2(f8(A,c13),f8(B,c10)) ),
    inference(resolve,[status(thm)],[c_11,c_20]) ).

cnf(c_154,plain,
    p2(f8(A,c13),f8(A,c10)),
    inference(resolve,[status(thm)],[c_233,c_2]) ).

cnf(c_227,plain,
    ( ~ p2(B,f6(f7(c12)))
    | ~ p2(A,f8(c11,c10))
    | ~ p3(f4(c13,f5(A,B),c11),c9) ),
    inference(resolve,[status(thm)],[c_125,c_10]) ).

cnf(c_234,plain,
    ( ~ p2(f6(f7(c12)),f6(f7(c12)))
    | ~ p2(f8(c11,c13),f8(c11,c10)) ),
    inference(resolve,[status(thm)],[c_227,c_24]) ).

cnf(c_235,plain,
    ~ p2(f6(f7(c12)),f6(f7(c12))),
    inference(resolve,[status(thm)],[c_154,c_234]) ).

cnf(c_229,plain,
    $false,
    inference(resolve,[status(thm)],[c_1,c_235]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN556-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  % Computer : n013.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Sat Sep 26 18:12:51 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.35  % Process 3339212 was started by sandbox on n013,
% 0.07/0.35  % Sat Sep 26 18:12:51 2026
% 0.07/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.07/0.35  
% 0.07/0.35  % From the command line: assign(max_seconds, 300).
% 0.13/0.39  
% 0.13/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.39  
% 0.13/0.39  % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.13/0.39  % Length of proof is 20.
% 0.13/0.39  % Level of proof is 6.
% 0.13/0.39  % Maximum clause weight is 41.000.
% 0.13/0.39  % Given clauses 32.
% 0.13/0.39  
% 0.13/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------