↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN347-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n020.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:37:39 AM UTC 2026

% Result   : Unsatisfiable 0.09s 0.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (   4 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   51 (  21   ~;  30   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(clause1,axiom,
    ! [VAR_0,VAR_1] :
      ( f(a,b)
      | ~ f(VAR_1,y(VAR_0,VAR_1))
      | f(VAR_0,y(VAR_0,VAR_1)) ),
    file('theBenchmark.p',clause1) ).

cnf(c_1,plain,
    ( f(a,b)
    | ~ f(B,y(A,B))
    | f(A,y(A,B)) ),
    inference(clausify,[status(thm)],[clause1]) ).

fof(clause2,axiom,
    ! [VAR_0,VAR_1] :
      ( f(a,b)
      | f(VAR_1,y(VAR_0,VAR_1))
      | ~ f(VAR_0,y(VAR_0,VAR_1)) ),
    file('theBenchmark.p',clause2) ).

cnf(c_2,plain,
    ( f(a,b)
    | f(B,y(A,B))
    | ~ f(A,y(A,B)) ),
    inference(clausify,[status(thm)],[clause2]) ).

fof(clause3,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ f(a,b)
      | ~ f(VAR_1,y(VAR_0,VAR_1))
      | ~ f(VAR_0,y(VAR_0,VAR_1)) ),
    file('theBenchmark.p',clause3) ).

cnf(c_3,plain,
    ( ~ f(a,b)
    | ~ f(B,y(A,B))
    | ~ f(A,y(A,B)) ),
    inference(clausify,[status(thm)],[clause3]) ).

fof(clause4,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ f(a,b)
      | f(VAR_1,y(VAR_0,VAR_1))
      | f(VAR_0,y(VAR_0,VAR_1)) ),
    file('theBenchmark.p',clause4) ).

cnf(c_4,plain,
    ( ~ f(a,b)
    | f(B,y(A,B))
    | f(A,y(A,B)) ),
    inference(clausify,[status(thm)],[clause4]) ).

fof(clause5,axiom,
    ! [VAR_0,VAR_1] :
      ( f(b,y(VAR_0,VAR_1))
      | f(a,y(VAR_0,VAR_1)) ),
    file('theBenchmark.p',clause5) ).

cnf(c_5,plain,
    ( f(b,y(A,B))
    | f(a,y(A,B)) ),
    inference(clausify,[status(thm)],[clause5]) ).

fof(clause6,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ f(b,y(VAR_0,VAR_1))
      | ~ f(a,y(VAR_0,VAR_1)) ),
    file('theBenchmark.p',clause6) ).

cnf(c_6,plain,
    ( ~ f(b,y(A,B))
    | ~ f(a,y(A,B)) ),
    inference(clausify,[status(thm)],[clause6]) ).

cnf(c_7,plain,
    ( ~ f(a,b)
    | ~ f(A,y(A,A)) ),
    inference(factor,[status(thm)],[c_3]) ).

cnf(c_8,plain,
    ( ~ f(a,b)
    | f(A,y(A,A)) ),
    inference(factor,[status(thm)],[c_4]) ).

cnf(c_11,plain,
    ( f(a,b)
    | f(A,y(b,A))
    | f(a,y(b,A)) ),
    inference(resolve,[status(thm)],[c_5,c_2]) ).

cnf(c_13,plain,
    ( f(a,b)
    | f(a,y(b,a)) ),
    inference(factor,[status(thm)],[c_11]) ).

cnf(c_26,plain,
    ( f(a,b)
    | f(b,y(b,a))
    | f(a,b) ),
    inference(resolve,[status(thm)],[c_13,c_1]) ).

cnf(c_16,plain,
    ( f(b,y(b,a))
    | f(a,b) ),
    inference(copy,[status(thm)],[c_26]) ).

cnf(c_18,plain,
    ( ~ f(a,y(b,a))
    | f(a,b) ),
    inference(resolve,[status(thm)],[c_16,c_6]) ).

cnf(c_27,plain,
    ( f(a,b)
    | f(a,b) ),
    inference(resolve,[status(thm)],[c_18,c_13]) ).

cnf(c_20,plain,
    f(a,b),
    inference(copy,[status(thm)],[c_27]) ).

cnf(c_24,plain,
    f(A,y(A,A)),
    inference(resolve,[status(thm)],[c_20,c_8]) ).

cnf(c_28,plain,
    ~ f(a,b),
    inference(resolve,[status(thm)],[c_24,c_7]) ).

cnf(c_25,plain,
    $false,
    inference(resolve,[status(thm)],[c_20,c_28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN347-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n020.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep 26 17:37:33 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.38  % Process 2134524 was started by sandbox on n020,
% 0.09/0.38  % Sat Sep 26 17:37:33 2026
% 0.09/0.38  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38  
% 0.09/0.38  % From the command line: assign(max_seconds, 300).
% 0.09/0.39  
% 0.09/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.39  
% 0.09/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.39  % Length of proof is 15.
% 0.09/0.39  % Level of proof is 7.
% 0.09/0.39  % Maximum clause weight is 13.000.
% 0.09/0.39  % Given clauses 16.
% 0.09/0.39  
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------