↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN571-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 : n003.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.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   24 (  13 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   40 (  22   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-2 aty)
%            Number of variables   :   44 (   5 sgn  16   !;   0   ?)

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

cnf(c_2,plain,
    p2(A,A),
    inference(clausify,[status(thm)],[p2_2]) ).

fof(p11_3,axiom,
    ! [VAR_0] : p11(f5(VAR_0),c14),
    file('theBenchmark.p',p11_3) ).

cnf(c_3,plain,
    p11(f5(A),c14),
    inference(clausify,[status(thm)],[p11_3]) ).

fof(not_p11_6,axiom,
    ! [VAR_0] : ~ p11(VAR_0,f3(VAR_0,f5(f6(f7(c12))))),
    file('theBenchmark.p',not_p11_6) ).

cnf(c_6,plain,
    ~ p11(A,f3(A,f5(f6(f7(c12))))),
    inference(clausify,[status(thm)],[not_p11_6]) ).

fof(p11_7,axiom,
    ! [VAR_0] :
      ( ~ p11(f5(f10(VAR_0)),VAR_0)
      | p11(c14,VAR_0) ),
    file('theBenchmark.p',p11_7) ).

cnf(c_7,plain,
    ( ~ p11(f5(f10(A)),A)
    | p11(c14,A) ),
    inference(clausify,[status(thm)],[p11_7]) ).

fof(p2_12,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_12) ).

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

fof(p2_14,axiom,
    ! [VAR_0,VAR_1] : p2(f9(f5(VAR_0),f5(VAR_1)),f5(f8(VAR_0,VAR_1))),
    file('theBenchmark.p',p2_14) ).

cnf(c_14,plain,
    p2(f9(f5(A),f5(B)),f5(f8(A,B))),
    inference(clausify,[status(thm)],[p2_14]) ).

fof(p11_15,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p11(f9(VAR_0,VAR_2),VAR_1)
      | p11(VAR_0,f3(VAR_1,VAR_2)) ),
    file('theBenchmark.p',p11_15) ).

cnf(c_15,plain,
    ( ~ p11(f9(A,C),B)
    | p11(A,f3(B,C)) ),
    inference(clausify,[status(thm)],[p11_15]) ).

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

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

cnf(c_28,plain,
    ~ p11(f5(f10(f3(c14,f5(f6(f7(c12)))))),f3(c14,f5(f6(f7(c12))))),
    inference(resolve,[status(thm)],[c_7,c_6]) ).

cnf(c_203,plain,
    ( ~ p2(f9(f5(A),f5(B)),C)
    | p2(f5(f8(A,B)),C) ),
    inference(resolve,[status(thm)],[c_12,c_14]) ).

cnf(c_34,plain,
    p2(f5(f8(A,B)),f9(f5(A),f5(B))),
    inference(resolve,[status(thm)],[c_203,c_2]) ).

cnf(c_40,plain,
    ( ~ p2(c14,B)
    | ~ p2(f5(C),A)
    | p11(A,B) ),
    inference(resolve,[status(thm)],[c_17,c_3]) ).

cnf(c_150,plain,
    ( ~ p2(f5(B),A)
    | p11(A,c14) ),
    inference(resolve,[status(thm)],[c_40,c_2]) ).

cnf(c_159,plain,
    ~ p11(f9(f5(f10(f3(c14,f5(f6(f7(c12)))))),f5(f6(f7(c12)))),c14),
    inference(resolve,[status(thm)],[c_15,c_28]) ).

cnf(c_201,plain,
    p11(f9(f5(A),f5(B)),c14),
    inference(resolve,[status(thm)],[c_34,c_150]) ).

cnf(c_202,plain,
    $false,
    inference(resolve,[status(thm)],[c_201,c_159]) ).

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