↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET825-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n016.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 08:37:02 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_Relation_OIdI_0,axiom,
    ! [VAR_0,VAR_1] : c_in(c_Pair(VAR_0,VAR_0,VAR_1,VAR_1),c_Relation_OId,tc_prod(VAR_1,VAR_1)),
    file('theBenchmark.p',cls_Relation_OIdI_0) ).

cnf(c_1,plain,
    c_in(c_Pair(A,A,B,B),c_Relation_OId,tc_prod(B,B)),
    inference(clausify,[status(thm)],[cls_Relation_OIdI_0]) ).

fof(cls_Relation_Opair__in__Id__conv__iff1_0,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( VAR_0 = VAR_1
      | ~ c_in(c_Pair(VAR_0,VAR_1,VAR_2,VAR_2),c_Relation_OId,tc_prod(VAR_2,VAR_2)) ),
    file('theBenchmark.p',cls_Relation_Opair__in__Id__conv__iff1_0) ).

cnf(c_2,plain,
    ( A = B
    | ~ c_in(c_Pair(A,B,C,C),c_Relation_OId,tc_prod(C,C)) ),
    inference(clausify,[status(thm)],[cls_Relation_Opair__in__Id__conv__iff1_0]) ).

fof(cls_conjecture_0,axiom,
    v_Q(v_n),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_3,plain,
    v_Q(v_n),
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

fof(cls_conjecture_1,axiom,
    ~ v_Q(v_m),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(c_4,plain,
    ~ v_Q(v_m),
    inference(clausify,[status(thm)],[cls_conjecture_1]) ).

fof(cls_conjecture_2,axiom,
    ! [VAR_0] :
      ( ~ c_in(c_Pair(c_0,c_0,tc_nat,tc_nat),VAR_0,tc_prod(tc_nat,tc_nat))
      | c_in(c_Pair(v_x(VAR_0),v_xa(VAR_0),tc_nat,tc_nat),VAR_0,tc_prod(tc_nat,tc_nat))
      | c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),VAR_0,tc_prod(tc_nat,tc_nat)) ),
    file('theBenchmark.p',cls_conjecture_2) ).

cnf(c_5,plain,
    ( ~ c_in(c_Pair(c_0,c_0,tc_nat,tc_nat),A,tc_prod(tc_nat,tc_nat))
    | c_in(c_Pair(v_x(A),v_xa(A),tc_nat,tc_nat),A,tc_prod(tc_nat,tc_nat))
    | c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),A,tc_prod(tc_nat,tc_nat)) ),
    inference(clausify,[status(thm)],[cls_conjecture_2]) ).

fof(cls_conjecture_3,axiom,
    ! [VAR_0] :
      ( ~ c_in(c_Pair(c_0,c_0,tc_nat,tc_nat),VAR_0,tc_prod(tc_nat,tc_nat))
      | ~ c_in(c_Pair(c_Suc(v_x(VAR_0)),c_Suc(v_xa(VAR_0)),tc_nat,tc_nat),VAR_0,tc_prod(tc_nat,tc_nat))
      | c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),VAR_0,tc_prod(tc_nat,tc_nat)) ),
    file('theBenchmark.p',cls_conjecture_3) ).

cnf(c_6,plain,
    ( ~ c_in(c_Pair(c_0,c_0,tc_nat,tc_nat),A,tc_prod(tc_nat,tc_nat))
    | ~ c_in(c_Pair(c_Suc(v_x(A)),c_Suc(v_xa(A)),tc_nat,tc_nat),A,tc_prod(tc_nat,tc_nat))
    | c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),A,tc_prod(tc_nat,tc_nat)) ),
    inference(clausify,[status(thm)],[cls_conjecture_3]) ).

cnf(c_7,plain,
    ( c_in(c_Pair(v_x(c_Relation_OId),v_xa(c_Relation_OId),tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat))
    | c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat)) ),
    inference(resolve,[status(thm)],[c_5,c_1]) ).

cnf(c_15,plain,
    ( v_x(c_Relation_OId) = v_xa(c_Relation_OId)
    | c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat)) ),
    inference(resolve,[status(thm)],[c_7,c_2]) ).

cnf(c_8,plain,
    ( v_xa(c_Relation_OId) = v_x(c_Relation_OId)
    | c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat)) ),
    inference(copy,[status(thm)],[c_15]) ).

cnf(c_16,plain,
    ( v_n = v_m
    | v_xa(c_Relation_OId) = v_x(c_Relation_OId) ),
    inference(resolve,[status(thm)],[c_8,c_2]) ).

cnf(c_9,plain,
    ( v_m = v_n
    | v_xa(c_Relation_OId) = v_x(c_Relation_OId) ),
    inference(copy,[status(thm)],[c_16]) ).

cnf(c_17,plain,
    ( ~ c_in(c_Pair(c_0,c_0,tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat))
    | ~ c_in(c_Pair(c_Suc(v_x(c_Relation_OId)),c_Suc(v_x(c_Relation_OId)),tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat))
    | c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat))
    | v_m = v_n ),
    inference(paramod,[status(thm)],[c_9,c_6]) ).

cnf(c_18,plain,
    ( ~ c_in(c_Pair(c_0,c_0,tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat))
    | c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat))
    | v_m = v_n ),
    inference(resolve,[status(thm)],[c_1,c_17]) ).

cnf(c_10,plain,
    ( c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),c_Relation_OId,tc_prod(tc_nat,tc_nat))
    | v_m = v_n ),
    inference(resolve,[status(thm)],[c_1,c_18]) ).

cnf(c_19,plain,
    ( v_n = v_m
    | v_m = v_n ),
    inference(resolve,[status(thm)],[c_10,c_2]) ).

cnf(c_20,plain,
    ( v_m = v_n
    | v_m = v_n ),
    inference(copy,[status(thm)],[c_19]) ).

cnf(c_11,plain,
    v_m = v_n,
    inference(copy,[status(thm)],[c_20]) ).

cnf(c_21,plain,
    ~ v_Q(v_n),
    inference(paramod,[status(thm)],[c_11,c_4]) ).

cnf(c_14,plain,
    $false,
    inference(resolve,[status(thm)],[c_3,c_21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET825-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.38   % Computer : n016.cluster.edu
% 0.09/5.38   % Model    : x86_64 x86_64
% 0.09/5.38   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38   % Memory   : 8046.5625MB
% 0.09/5.38   % OS       : Linux 6.8.0-71-generic
% 0.13/15.52  % CPULimit : 300
% 0.13/15.52  % WCLimit  : 300
% 0.13/15.52  % DateTime : Sat Sep 26 08:21:51 UTC 2026
% 0.13/15.52  % CPUTime  : 
% 0.13/15.52  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/15.52  % Process 1244129 was started by sandbox on n002,
% 0.13/15.52  % Sat Sep 26 08:21:51 2026
% 0.13/15.52  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/15.53  
% 0.13/15.53  % From the command line: assign(max_seconds, 300).
% 0.13/15.54  
% 0.13/15.54  % SZS status Unsatisfiable for theBenchmark
% 0.13/15.54  
% 0.13/15.54  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/15.54  % Length of proof is 12.
% 0.13/15.54  % Level of proof is 6.
% 0.13/15.54  % Maximum clause weight is 34.000.
% 0.13/15.54  % Given clauses 10.
% 0.13/15.54  
% 0.13/15.54  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------