↑ Up

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

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

% Result   : Unsatisfiable 0.16s 5.64s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   21 (  12 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   39 (  23   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  11   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(p3_5,axiom,
    p3(c21,c19),
    file('theBenchmark.p',p3_5) ).

cnf(c_5,plain,
    p3(c21,c19),
    inference(clausify,[status(thm)],[p3_5]) ).

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

cnf(c_12,plain,
    ( ~ p3(A,B)
    | p3(f11(A),f11(B)) ),
    inference(clausify,[status(thm)],[p3_12]) ).

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

cnf(c_17,plain,
    ( ~ p15(C,D)
    | ~ p2(D,B)
    | ~ p2(C,A)
    | p15(A,B) ),
    inference(clausify,[status(thm)],[p15_17]) ).

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

cnf(c_20,plain,
    ( ~ p3(B,D)
    | ~ p2(A,C)
    | p2(f4(A,B),f4(C,D)) ),
    inference(clausify,[status(thm)],[p2_20]) ).

fof(p15_22,axiom,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20),
    file('theBenchmark.p',p15_22) ).

cnf(c_22,plain,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20),
    inference(clausify,[status(thm)],[p15_22]) ).

fof(not_p15_23,axiom,
    ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20),
    file('theBenchmark.p',not_p15_23) ).

cnf(c_23,plain,
    ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20),
    inference(clausify,[status(thm)],[not_p15_23]) ).

cnf(c_32,plain,
    p3(f11(c21),f11(c19)),
    inference(resolve,[status(thm)],[c_12,c_5]) ).

cnf(c_113,plain,
    ( ~ p15(A,B)
    | ~ p2(B,c20)
    | ~ p2(A,f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19))) ),
    inference(resolve,[status(thm)],[c_17,c_23]) ).

cnf(c_114,plain,
    ( ~ p15(A,c20)
    | ~ p2(A,f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19))) ),
    inference(resolve,[status(thm)],[c_113,c_4]) ).

cnf(c_51,plain,
    ~ p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19))),
    inference(resolve,[status(thm)],[c_114,c_22]) ).

cnf(c_115,plain,
    ( ~ p3(f11(c21),f11(c19))
    | ~ p2(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f6(f10(c16),f6(f7(f8(f9(c17))),c18))) ),
    inference(resolve,[status(thm)],[c_20,c_51]) ).

cnf(c_116,plain,
    ~ p2(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f6(f10(c16),f6(f7(f8(f9(c17))),c18))),
    inference(resolve,[status(thm)],[c_115,c_32]) ).

cnf(c_112,plain,
    $false,
    inference(resolve,[status(thm)],[c_4,c_116]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN586-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.16/5.61  % Computer : n007.cluster.edu
% 0.16/5.61  % Model    : x86_64 x86_64
% 0.16/5.61  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.61  % Memory   : 8046.5625MB
% 0.16/5.61  % OS       : Linux 6.8.0-71-generic
% 0.16/5.61  % CPULimit : 300
% 0.16/5.61  % WCLimit  : 300
% 0.16/5.61  % DateTime : Sat Sep 26 18:12:59 UTC 2026
% 0.16/5.61  % CPUTime  : 
% 0.16/5.61  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/5.61  % Process 184804 was started by sandbox2 on n007,
% 0.16/5.61  % Sat Sep 26 18:12:59 2026
% 0.16/5.61  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/5.62  
% 0.16/5.62  % From the command line: assign(max_seconds, 300).
% 0.16/5.64  
% 0.16/5.64  % SZS status Unsatisfiable for theBenchmark
% 0.16/5.64  
% 0.16/5.64  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.16/5.64  % Length of proof is 10.
% 0.16/5.64  % Level of proof is 2.
% 0.16/5.64  % Maximum clause weight is 70.000.
% 0.16/5.64  % Given clauses 60.
% 0.16/5.64  
% 0.16/5.64  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------