↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SET859-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/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 08:37:10 AM UTC 2026

% Result   : Unsatisfiable 23.97s 3.56s
% Output   : CNFRefutation 23.97s
% 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 :   12 (   7   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-3 aty)
%            Number of variables   :   15 (   1 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cls_conjecture_3,axiom,
    ~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_3) ).

cnf(c_1074,plain,
    ~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
    inference(clausify,[status(thm)],[cls_conjecture_3]) ).

fof(cls_conjecture_2,axiom,
    c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_2) ).

cnf(c_1075,plain,
    c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))),
    inference(clausify,[status(thm)],[cls_conjecture_2]) ).

fof(cls_Zorn_OAbrial__axiom1_0,axiom,
    ! [VAR_0,VAR_1,VAR_2] : c_lessequals(VAR_0,c_Zorn_Osucc(VAR_1,VAR_0,VAR_2),tc_set(tc_set(VAR_2))),
    file('theBenchmark.p',cls_Zorn_OAbrial__axiom1_0) ).

cnf(c_1083,plain,
    c_lessequals(A,c_Zorn_Osucc(B,A,C),tc_set(tc_set(C))),
    inference(clausify,[status(thm)],[cls_Zorn_OAbrial__axiom1_0]) ).

fof(cls_Set_Osubset__trans_0,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( c_lessequals(VAR_3,VAR_1,tc_set(VAR_2))
      | ~ c_lessequals(VAR_3,VAR_0,tc_set(VAR_2))
      | ~ c_lessequals(VAR_0,VAR_1,tc_set(VAR_2)) ),
    file('theBenchmark.p',cls_Set_Osubset__trans_0) ).

cnf(c_1084,plain,
    ( c_lessequals(D,B,tc_set(C))
    | ~ c_lessequals(D,A,tc_set(C))
    | ~ c_lessequals(A,B,tc_set(C)) ),
    inference(clausify,[status(thm)],[cls_Set_Osubset__trans_0]) ).

cnf(c_2040,plain,
    ( c_lessequals(A,v_m,tc_set(tc_set(t_a)))
    | ~ c_lessequals(A,c_Zorn_Osucc(v_S,v_n,t_a),tc_set(tc_set(t_a))) ),
    inference(resolve,[status(thm)],[c_1084,c_1075]) ).

cnf(c_2041,plain,
    c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
    inference(resolve,[status(thm)],[c_2040,c_1083]) ).

cnf(c_2039,plain,
    $false,
    inference(resolve,[status(thm)],[c_1074,c_2041]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET859-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n020.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Sat Sep 26 08:23:34 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.46  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/0.46  % Process 1076154 was started by sandbox2 on n020,
% 0.19/0.46  % Sat Sep 26 08:23:34 2026
% 0.19/0.46  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.28/0.51  
% 0.28/0.51  % From the command line: assign(max_seconds, 300).
% 23.97/3.56  
% 23.97/3.56  % given #500 (I,wt=25): 985 -class_OrderedGroup_Opordered__cancel__ab__semigroup__add(A) | -c_lessequals(B,C,A) | c_lessequals(c_SetInterval_OatLeast(C,A),c_SetInterval_OatLeast(B,A),tc_set(A)).  [resolve(21,b,5,a)].
% 23.97/3.56  
% 23.97/3.56  % SZS status Unsatisfiable for theBenchmark
% 23.97/3.56  
% 23.97/3.56  % Proof 1 at 2.90 (+ 0.12) seconds.
% 23.97/3.56  % Length of proof is 5.
% 23.97/3.56  % Level of proof is 1.
% 23.97/3.56  % Maximum clause weight is 29.000.
% 23.97/3.56  % Given clauses 599.
% 23.97/3.56  
% 23.97/3.56  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------