↑ Up

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

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

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

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

cnf(c_1,plain,
    p11(A,A),
    inference(clausify,[status(thm)],[p11_1]) ).

fof(p8_3,axiom,
    ! [VAR_0] : p8(VAR_0,VAR_0),
    file('theBenchmark.p',p8_3) ).

cnf(c_3,plain,
    p8(A,A),
    inference(clausify,[status(thm)],[p8_3]) ).

fof(p8_8,axiom,
    ! [VAR_0,VAR_1] : p8(f16(VAR_0,f17(VAR_1,VAR_0)),VAR_1),
    file('theBenchmark.p',p8_8) ).

cnf(c_8,plain,
    p8(f16(A,f17(B,A)),B),
    inference(clausify,[status(thm)],[p8_8]) ).

fof(p8_21,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p8(VAR_2,VAR_1)
      | ~ p8(VAR_2,VAR_0)
      | p8(VAR_0,VAR_1) ),
    file('theBenchmark.p',p8_21) ).

cnf(c_21,plain,
    ( ~ p8(C,B)
    | ~ p8(C,A)
    | p8(A,B) ),
    inference(clausify,[status(thm)],[p8_21]) ).

fof(p8_24,axiom,
    ! [VAR_0] : p8(f12(f13(c23),VAR_0),f12(f13(c26),f16(c27,VAR_0))),
    file('theBenchmark.p',p8_24) ).

cnf(c_24,plain,
    p8(f12(f13(c23),A),f12(f13(c26),f16(c27,A))),
    inference(clausify,[status(thm)],[p8_24]) ).

fof(not_p8_26,axiom,
    ~ p8(f12(f13(c23),f17(c28,c27)),f12(f13(c26),c28)),
    file('theBenchmark.p',not_p8_26) ).

cnf(c_26,plain,
    ~ p8(f12(f13(c23),f17(c28,c27)),f12(f13(c26),c28)),
    inference(clausify,[status(thm)],[not_p8_26]) ).

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

cnf(c_31,plain,
    ( ~ p8(B,D)
    | ~ p11(A,C)
    | p8(f12(A,B),f12(C,D)) ),
    inference(clausify,[status(thm)],[p8_31]) ).

cnf(c_49,plain,
    ( ~ p8(B,A)
    | p8(A,B) ),
    inference(resolve,[status(thm)],[c_21,c_3]) ).

cnf(c_378,plain,
    ( ~ p8(A,f12(f13(c26),c28))
    | ~ p8(A,f12(f13(c23),f17(c28,c27))) ),
    inference(resolve,[status(thm)],[c_21,c_26]) ).

cnf(c_61,plain,
    ~ p8(f12(f13(c26),c28),f12(f13(c23),f17(c28,c27))),
    inference(resolve,[status(thm)],[c_378,c_3]) ).

cnf(c_67,plain,
    ( ~ p8(B,C)
    | p8(f12(A,B),f12(A,C)) ),
    inference(resolve,[status(thm)],[c_31,c_1]) ).

cnf(c_98,plain,
    p8(f12(f13(c26),f16(c27,A)),f12(f13(c23),A)),
    inference(resolve,[status(thm)],[c_49,c_24]) ).

cnf(c_183,plain,
    p8(f12(A,f16(B,f17(C,B))),f12(A,C)),
    inference(resolve,[status(thm)],[c_67,c_8]) ).

cnf(c_379,plain,
    ( ~ p8(A,f12(f13(c23),f17(c28,c27)))
    | ~ p8(A,f12(f13(c26),c28)) ),
    inference(resolve,[status(thm)],[c_21,c_61]) ).

cnf(c_380,plain,
    ~ p8(f12(f13(c26),f16(c27,f17(c28,c27))),f12(f13(c26),c28)),
    inference(resolve,[status(thm)],[c_379,c_98]) ).

cnf(c_377,plain,
    $false,
    inference(resolve,[status(thm)],[c_183,c_380]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN622-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.36  % Computer : n001.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % 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:22:28 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 2411495 was started by sandbox on n001,
% 0.10/0.37  % Sat Sep 26 18:22:28 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37  
% 0.10/0.37  % From the command line: assign(max_seconds, 300).
% 0.14/0.41  
% 0.14/0.41  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.41  
% 0.14/0.41  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.14/0.41  % Length of proof is 13.
% 0.14/0.41  % Level of proof is 3.
% 0.14/0.41  % Maximum clause weight is 19.000.
% 0.14/0.41  % Given clauses 149.
% 0.14/0.41  
% 0.14/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------