↑ Up

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(p5_3,axiom,
    ! [VAR_0] : p5(f8(f6(VAR_0)),VAR_0),
    file('theBenchmark.p',p5_3) ).

cnf(c_3,plain,
    p5(f8(f6(A)),A),
    inference(clausify,[status(thm)],[p5_3]) ).

fof(not_p2_4,axiom,
    ~ p2(f6(c9),f3(f4(c10))),
    file('theBenchmark.p',not_p2_4) ).

cnf(c_4,plain,
    ~ p2(f6(c9),f3(f4(c10))),
    inference(clausify,[status(thm)],[not_p2_4]) ).

fof(not_p2_5,axiom,
    ~ p2(f6(c9),f3(f7(f4(c10)))),
    file('theBenchmark.p',not_p2_5) ).

cnf(c_5,plain,
    ~ p2(f6(c9),f3(f7(f4(c10)))),
    inference(clausify,[status(thm)],[not_p2_5]) ).

fof(not_p2_6,axiom,
    ~ p2(f6(c9),f3(f7(f7(f4(c10))))),
    file('theBenchmark.p',not_p2_6) ).

cnf(c_6,plain,
    ~ p2(f6(c9),f3(f7(f7(f4(c10))))),
    inference(clausify,[status(thm)],[not_p2_6]) ).

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

cnf(c_10,plain,
    ( ~ p5(A,B)
    | p2(f6(A),f6(B)) ),
    inference(clausify,[status(thm)],[p2_10]) ).

fof(not_p2_12,axiom,
    ~ p2(f6(c9),f3(f7(f7(f7(f4(c10)))))),
    file('theBenchmark.p',not_p2_12) ).

cnf(c_12,plain,
    ~ p2(f6(c9),f3(f7(f7(f7(f4(c10)))))),
    inference(clausify,[status(thm)],[not_p2_12]) ).

fof(p2_19,axiom,
    ! [VAR_0] :
      ( ~ p2(f6(f8(VAR_0)),VAR_0)
      | p2(VAR_0,f3(f7(f7(f7(f4(c10))))))
      | p2(VAR_0,f3(f7(f7(f4(c10)))))
      | p2(VAR_0,f3(f7(f4(c10))))
      | p2(VAR_0,f3(f4(c10))) ),
    file('theBenchmark.p',p2_19) ).

cnf(c_19,plain,
    ( ~ p2(f6(f8(A)),A)
    | p2(A,f3(f7(f7(f7(f4(c10))))))
    | p2(A,f3(f7(f7(f4(c10)))))
    | p2(A,f3(f7(f4(c10))))
    | p2(A,f3(f4(c10))) ),
    inference(clausify,[status(thm)],[p2_19]) ).

cnf(c_20,plain,
    p2(f6(f8(f6(A))),f6(A)),
    inference(resolve,[status(thm)],[c_10,c_3]) ).

cnf(c_34,plain,
    ( ~ p2(f6(f8(f6(c9))),f6(c9))
    | p2(f6(c9),f3(f7(f7(f7(f4(c10))))))
    | p2(f6(c9),f3(f7(f7(f4(c10)))))
    | p2(f6(c9),f3(f7(f4(c10)))) ),
    inference(resolve,[status(thm)],[c_19,c_4]) ).

cnf(c_35,plain,
    ( ~ p2(f6(f8(f6(c9))),f6(c9))
    | p2(f6(c9),f3(f7(f7(f7(f4(c10))))))
    | p2(f6(c9),f3(f7(f7(f4(c10))))) ),
    inference(resolve,[status(thm)],[c_34,c_5]) ).

cnf(c_36,plain,
    ( ~ p2(f6(f8(f6(c9))),f6(c9))
    | p2(f6(c9),f3(f7(f7(f7(f4(c10)))))) ),
    inference(resolve,[status(thm)],[c_35,c_6]) ).

cnf(c_37,plain,
    ~ p2(f6(f8(f6(c9))),f6(c9)),
    inference(resolve,[status(thm)],[c_36,c_12]) ).

cnf(c_33,plain,
    $false,
    inference(resolve,[status(thm)],[c_20,c_37]) ).

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