↑ Up

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(not_p11_3,axiom,
    ~ p11(f9(c13),f9(c14)),
    file('theBenchmark.p',not_p11_3) ).

cnf(c_3,plain,
    ~ p11(f9(c13),f9(c14)),
    inference(clausify,[status(thm)],[not_p11_3]) ).

fof(p11_4,axiom,
    ! [VAR_0] : p11(f5(f6(c12)),f9(VAR_0)),
    file('theBenchmark.p',p11_4) ).

cnf(c_4,plain,
    p11(f5(f6(c12)),f9(A)),
    inference(clausify,[status(thm)],[p11_4]) ).

fof(p10_5,axiom,
    ! [VAR_0,VAR_1] :
      ( p11(VAR_1,VAR_0)
      | p10(VAR_0,VAR_1) ),
    file('theBenchmark.p',p10_5) ).

cnf(c_5,plain,
    ( p11(B,A)
    | p10(A,B) ),
    inference(clausify,[status(thm)],[p10_5]) ).

fof(not_p10_6,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p11(VAR_1,VAR_0)
      | ~ p10(VAR_0,VAR_1) ),
    file('theBenchmark.p',not_p10_6) ).

cnf(c_6,plain,
    ( ~ p11(B,A)
    | ~ p10(A,B) ),
    inference(clausify,[status(thm)],[not_p10_6]) ).

fof(not_p3_7,axiom,
    ~ p3(f6(f7(f8(c12))),f6(c12)),
    file('theBenchmark.p',not_p3_7) ).

cnf(c_7,plain,
    ~ p3(f6(f7(f8(c12))),f6(c12)),
    inference(clausify,[status(thm)],[not_p3_7]) ).

fof(p11_18,axiom,
    p11(f4(f9(c13),f6(f7(f8(c12)))),f4(f9(c14),f6(f7(f8(c12))))),
    file('theBenchmark.p',p11_18) ).

cnf(c_18,plain,
    p11(f4(f9(c13),f6(f7(f8(c12)))),f4(f9(c14),f6(f7(f8(c12))))),
    inference(clausify,[status(thm)],[p11_18]) ).

fof(p3_20,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p11(f5(f6(c12)),VAR_1)
      | ~ p10(VAR_1,VAR_2)
      | p10(f4(VAR_1,VAR_0),f4(VAR_2,VAR_0))
      | p3(VAR_0,f6(c12)) ),
    file('theBenchmark.p',p3_20) ).

cnf(c_20,plain,
    ( ~ p11(f5(f6(c12)),B)
    | ~ p10(B,C)
    | p10(f4(B,A),f4(C,A))
    | p3(A,f6(c12)) ),
    inference(clausify,[status(thm)],[p3_20]) ).

cnf(c_35,plain,
    ~ p10(f4(f9(c14),f6(f7(f8(c12)))),f4(f9(c13),f6(f7(f8(c12))))),
    inference(resolve,[status(thm)],[c_6,c_18]) ).

cnf(c_44,plain,
    ( ~ p11(f5(f6(c12)),A)
    | ~ p10(A,B)
    | p10(f4(A,f6(f7(f8(c12)))),f4(B,f6(f7(f8(c12))))) ),
    inference(resolve,[status(thm)],[c_20,c_7]) ).

cnf(c_45,plain,
    ( ~ p11(f5(f6(c12)),f9(c14))
    | ~ p10(f9(c14),f9(c13)) ),
    inference(resolve,[status(thm)],[c_44,c_35]) ).

cnf(c_42,plain,
    ~ p10(f9(c14),f9(c13)),
    inference(resolve,[status(thm)],[c_45,c_4]) ).

cnf(c_46,plain,
    p11(f9(c13),f9(c14)),
    inference(resolve,[status(thm)],[c_42,c_5]) ).

cnf(c_43,plain,
    $false,
    inference(resolve,[status(thm)],[c_3,c_46]) ).

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