↑ Up

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

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

% Computer : n017.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:09:25 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_conjecture_0,axiom,
    ~ v_thesis____,
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_220,plain,
    ~ v_thesis____,
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

fof(cls_CHAINED_0,axiom,
    c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,v_sko__CHAINED__1(v_E____,v_P,v_Us____,v_es_Ha____,v_h_Ha____)),
    file('theBenchmark.p',cls_CHAINED_0) ).

cnf(c_221,plain,
    c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,v_sko__CHAINED__1(v_E____,v_P,v_Us____,v_es_Ha____,v_h_Ha____)),
    inference(clausify,[status(thm)],[cls_CHAINED_0]) ).

fof(cls_CHAINED_1,axiom,
    c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),v_sko__CHAINED__1(v_E____,v_P,v_Us____,v_es_Ha____,v_h_Ha____),v_Us____,tc_Type_Oty,tc_Type_Oty),
    file('theBenchmark.p',cls_CHAINED_1) ).

cnf(c_222,plain,
    c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),v_sko__CHAINED__1(v_E____,v_P,v_Us____,v_es_Ha____,v_h_Ha____),v_Us____,tc_Type_Oty,tc_Type_Oty),
    inference(clausify,[status(thm)],[cls_CHAINED_1]) ).

fof(cls_that_0,axiom,
    ! [VAR_0] :
      ( ~ c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,VAR_0)
      | ~ c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),VAR_0,v_Us____,tc_Type_Oty,tc_Type_Oty)
      | v_thesis____ ),
    file('theBenchmark.p',cls_that_0) ).

cnf(c_263,plain,
    ( ~ c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,A)
    | ~ c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),A,v_Us____,tc_Type_Oty,tc_Type_Oty)
    | v_thesis____ ),
    inference(clausify,[status(thm)],[cls_that_0]) ).

cnf(c_264,plain,
    ( ~ c_WellTypeRT_OWTrts(v_P,v_h_Ha____,v_E____,v_es_Ha____,A)
    | ~ c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),A,v_Us____,tc_Type_Oty,tc_Type_Oty) ),
    inference(resolve,[status(thm)],[c_220,c_263]) ).

cnf(c_880,plain,
    ~ c_List_Olist__all2(c_TypeRel_Owiden(v_P,tc_prod(tc_List_Olist(tc_List_Olist(tc_String_Ochar)),tc_Expr_Oexp(tc_List_Olist(tc_String_Ochar)))),v_sko__CHAINED__1(v_E____,v_P,v_Us____,v_es_Ha____,v_h_Ha____),v_Us____,tc_Type_Oty,tc_Type_Oty),
    inference(resolve,[status(thm)],[c_264,c_221]) ).

cnf(c_879,plain,
    $false,
    inference(resolve,[status(thm)],[c_222,c_880]) ).

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