↑ Up

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

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

% Result   : Unsatisfiable 0.10s 0.39s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   25 (  14 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   45 (  26   ~;  19   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn  10   !;   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(not_p4_2,axiom,
    ! [VAR_0] : ~ p4(VAR_0,VAR_0),
    file('theBenchmark.p',not_p4_2) ).

cnf(c_2,plain,
    ~ p4(A,A),
    inference(clausify,[status(thm)],[not_p4_2]) ).

fof(not_p2_3,axiom,
    ~ p2(c6,c7),
    file('theBenchmark.p',not_p2_3) ).

cnf(c_3,plain,
    ~ p2(c6,c7),
    inference(clausify,[status(thm)],[not_p2_3]) ).

fof(p2_4,axiom,
    p2(f3(c5,c6),f3(c5,c7)),
    file('theBenchmark.p',p2_4) ).

cnf(c_4,plain,
    p2(f3(c5,c6),f3(c5,c7)),
    inference(clausify,[status(thm)],[p2_4]) ).

fof(p2_5,axiom,
    ! [VAR_0,VAR_1] :
      ( p4(VAR_1,VAR_0)
      | p4(VAR_0,VAR_1)
      | p2(VAR_0,VAR_1) ),
    file('theBenchmark.p',p2_5) ).

cnf(c_5,plain,
    ( p4(B,A)
    | p4(A,B)
    | p2(A,B) ),
    inference(clausify,[status(thm)],[p2_5]) ).

fof(p4_7,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p4(VAR_0,VAR_1)
      | p4(f3(c5,VAR_0),f3(c5,VAR_1)) ),
    file('theBenchmark.p',p4_7) ).

cnf(c_7,plain,
    ( ~ p4(A,B)
    | p4(f3(c5,A),f3(c5,B)) ),
    inference(clausify,[status(thm)],[p4_7]) ).

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

cnf(c_8,plain,
    ( ~ p2(D,A)
    | ~ p4(D,C)
    | ~ p2(C,B)
    | p4(A,B) ),
    inference(clausify,[status(thm)],[p4_8]) ).

cnf(c_30,plain,
    ( ~ p2(C,B)
    | ~ p4(C,A)
    | ~ p2(A,B) ),
    inference(resolve,[status(thm)],[c_8,c_2]) ).

cnf(c_31,plain,
    ( ~ p2(A,f3(c5,c7))
    | ~ p4(A,f3(c5,c6)) ),
    inference(resolve,[status(thm)],[c_30,c_4]) ).

cnf(c_19,plain,
    ~ p4(f3(c5,c7),f3(c5,c6)),
    inference(resolve,[status(thm)],[c_31,c_1]) ).

cnf(c_32,plain,
    ( ~ p2(C,B)
    | ~ p4(C,A)
    | ~ p2(A,B) ),
    inference(resolve,[status(thm)],[c_8,c_2]) ).

cnf(c_33,plain,
    ( ~ p2(A,B)
    | ~ p4(A,B) ),
    inference(resolve,[status(thm)],[c_32,c_1]) ).

cnf(c_20,plain,
    ~ p4(f3(c5,c6),f3(c5,c7)),
    inference(resolve,[status(thm)],[c_33,c_4]) ).

cnf(c_27,plain,
    ~ p4(c7,c6),
    inference(resolve,[status(thm)],[c_7,c_19]) ).

cnf(c_34,plain,
    ( p4(c6,c7)
    | p2(c6,c7) ),
    inference(resolve,[status(thm)],[c_27,c_5]) ).

cnf(c_28,plain,
    p4(c6,c7),
    inference(resolve,[status(thm)],[c_3,c_34]) ).

cnf(c_35,plain,
    ~ p4(c6,c7),
    inference(resolve,[status(thm)],[c_7,c_20]) ).

cnf(c_29,plain,
    $false,
    inference(resolve,[status(thm)],[c_28,c_35]) ).

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