↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : COL122-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 : n010.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 06:57:47 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
    c_in(c_Pair(v_x,v_xaa,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_1,plain,
    c_in(c_Pair(v_x,v_xaa,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

fof(cls_conjecture_1,axiom,
    ! [VAR_0] :
      ( ~ c_in(c_Pair(v_xaa,VAR_0,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_x,VAR_0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(c_2,plain,
    ( ~ c_in(c_Pair(v_xaa,A,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_x,A,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    inference(clausify,[status(thm)],[cls_conjecture_1]) ).

fof(cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0,axiom,
    ! [VAR_0,VAR_1,VAR_2] : c_in(c_Pair(VAR_0,VAR_0,VAR_1,VAR_1),c_Transitive__Closure_Ortrancl(VAR_2,VAR_1),tc_prod(VAR_1,VAR_1)),
    file('theBenchmark.p',cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0) ).

cnf(c_3,plain,
    c_in(c_Pair(A,A,B,B),c_Transitive__Closure_Ortrancl(C,B),tc_prod(B,B)),
    inference(clausify,[status(thm)],[cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0]) ).

cnf(c_5,plain,
    ~ c_in(c_Pair(v_xaa,v_xaa,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
    inference(resolve,[status(thm)],[c_2,c_1]) ).

cnf(c_4,plain,
    $false,
    inference(resolve,[status(thm)],[c_3,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COL122-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/5.37  % Computer : n010.cluster.edu
% 0.11/5.37  % Model    : x86_64 x86_64
% 0.11/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37  % Memory   : 8046.5625MB
% 0.11/5.37  % OS       : Linux 6.8.0-71-generic
% 0.11/5.37  % CPULimit : 300
% 0.11/5.37  % WCLimit  : 300
% 0.11/5.37  % DateTime : Sat Sep 26 23:17:54 UTC 2026
% 0.11/5.37  % CPUTime  : 
% 0.11/5.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.37  % Process 287640 was started by sandbox on n010,
% 0.11/5.37  % Sat Sep 26 23:17:54 2026
% 0.11/5.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/5.38  
% 0.11/5.38  % From the command line: assign(max_seconds, 300).
% 0.11/5.39  
% 0.11/5.39  % SZS status Unsatisfiable for theBenchmark
% 0.11/5.39  
% 0.11/5.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.11/5.39  % Length of proof is 4.
% 0.11/5.39  % Level of proof is 1.
% 0.11/5.39  % Maximum clause weight is 22.000.
% 0.11/5.39  % Given clauses 2.
% 0.11/5.39  
% 0.11/5.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------