↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN553-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 : n018.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.12s 0.38s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  13 unt;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   28 (  16   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   47 (   0 sgn  13   !;   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(p2_5,axiom,
    ! [VAR_0,VAR_1] : p2(f8(VAR_0,VAR_1),f8(VAR_1,VAR_0)),
    file('theBenchmark.p',p2_5) ).

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

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

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

fof(p2_7,axiom,
    ! [VAR_0,VAR_1,VAR_2] : p2(f8(VAR_0,f8(VAR_1,VAR_2)),f8(f8(VAR_0,VAR_1),VAR_2)),
    file('theBenchmark.p',p2_7) ).

cnf(c_7,plain,
    p2(f8(A,f8(B,C)),f8(f8(A,B),C)),
    inference(clausify,[status(thm)],[p2_7]) ).

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

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

fof(not_p2_9,axiom,
    ~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
    file('theBenchmark.p',not_p2_9) ).

cnf(c_9,plain,
    ~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
    inference(clausify,[status(thm)],[not_p2_9]) ).

cnf(c_299,plain,
    ( ~ p2(f8(B,A),C)
    | p2(f8(A,B),C) ),
    inference(resolve,[status(thm)],[c_6,c_5]) ).

cnf(c_13,plain,
    p2(f8(f8(A,B),C),f8(f8(C,A),B)),
    inference(resolve,[status(thm)],[c_299,c_7]) ).

cnf(c_300,plain,
    ( ~ p2(C,D)
    | p2(f8(f8(A,B),C),f8(f8(B,A),D)) ),
    inference(resolve,[status(thm)],[c_8,c_5]) ).

cnf(c_22,plain,
    p2(f8(f8(A,B),C),f8(f8(B,A),C)),
    inference(resolve,[status(thm)],[c_300,c_1]) ).

cnf(c_301,plain,
    ( ~ p2(A,f8(f9(c4),f8(f9(c3),c4)))
    | ~ p2(f8(f8(f9(c4),c4),f9(c3)),A) ),
    inference(resolve,[status(thm)],[c_6,c_9]) ).

cnf(c_32,plain,
    ~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f8(f9(c3),c4),f9(c4))),
    inference(resolve,[status(thm)],[c_301,c_5]) ).

cnf(c_302,plain,
    ( ~ p2(f8(f8(B,A),C),D)
    | p2(f8(f8(A,B),C),D) ),
    inference(resolve,[status(thm)],[c_6,c_22]) ).

cnf(c_297,plain,
    p2(f8(f8(A,B),C),f8(f8(C,B),A)),
    inference(resolve,[status(thm)],[c_302,c_13]) ).

cnf(c_298,plain,
    $false,
    inference(resolve,[status(thm)],[c_297,c_32]) ).

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