↑ Up

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
    ! [VAR_0,VAR_1] :
      ( c_lessequals(VAR_1,VAR_1,VAR_0)
      | ~ class_Orderings_Oorder(VAR_0) ),
    file('theBenchmark.p',cls_Orderings_Oorder__class_Oaxioms__1_0) ).

cnf(c_2,plain,
    ( c_lessequals(B,B,A)
    | ~ class_Orderings_Oorder(A) ),
    inference(clausify,[status(thm)],[cls_Orderings_Oorder__class_Oaxioms__1_0]) ).

fof(clsarity_set_2,axiom,
    ! [VAR_0] : class_Orderings_Oorder(tc_set(VAR_0)),
    file('theBenchmark.p',clsarity_set_2) ).

cnf(c_9,plain,
    class_Orderings_Oorder(tc_set(A)),
    inference(clausify,[status(thm)],[clsarity_set_2]) ).

fof(cls_Zorn_OTFin__subsetD_0,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( VAR_0 = VAR_3
      | c_lessequals(c_Zorn_Osucc(VAR_1,VAR_0,VAR_2),VAR_3,tc_set(tc_set(VAR_2)))
      | ~ c_lessequals(VAR_0,VAR_3,tc_set(tc_set(VAR_2)))
      | ~ c_in(VAR_3,c_Zorn_OTFin(VAR_1,VAR_2),tc_set(tc_set(VAR_2)))
      | ~ c_in(VAR_0,c_Zorn_OTFin(VAR_1,VAR_2),tc_set(tc_set(VAR_2))) ),
    file('theBenchmark.p',cls_Zorn_OTFin__subsetD_0) ).

cnf(c_405,plain,
    ( A = D
    | c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C)))
    | ~ c_lessequals(A,D,tc_set(tc_set(C)))
    | ~ c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))
    | ~ c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C))) ),
    inference(clausify,[status(thm)],[cls_Zorn_OTFin__subsetD_0]) ).

fof(cls_conjecture_0,axiom,
    c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_406,plain,
    c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

fof(cls_conjecture_1,axiom,
    v_m = c_Zorn_Osucc(v_S,v_m,t_a),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(c_407,plain,
    v_m = c_Zorn_Osucc(v_S,v_m,t_a),
    inference(clausify,[status(thm)],[cls_conjecture_1]) ).

cnf(c_408,plain,
    c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
    inference(copy,[status(thm)],[c_407]) ).

fof(cls_conjecture_2,axiom,
    c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_2) ).

cnf(c_409,plain,
    c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    inference(clausify,[status(thm)],[cls_conjecture_2]) ).

fof(cls_conjecture_3,axiom,
    c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_3) ).

cnf(c_410,plain,
    c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
    inference(clausify,[status(thm)],[cls_conjecture_3]) ).

fof(cls_conjecture_4,axiom,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_4) ).

cnf(c_411,plain,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
    inference(clausify,[status(thm)],[cls_conjecture_4]) ).

cnf(c_424,plain,
    c_lessequals(A,A,tc_set(B)),
    inference(resolve,[status(thm)],[c_9,c_2]) ).

cnf(c_3149,plain,
    ( A = v_m
    | c_lessequals(c_Zorn_Osucc(v_S,A,t_a),v_m,tc_set(tc_set(t_a)))
    | ~ c_lessequals(A,v_m,tc_set(tc_set(t_a)))
    | ~ c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(resolve,[status(thm)],[c_406,c_405]) ).

cnf(c_1924,plain,
    ( v_m = A
    | c_lessequals(c_Zorn_Osucc(v_S,A,t_a),v_m,tc_set(tc_set(t_a)))
    | ~ c_lessequals(A,v_m,tc_set(tc_set(t_a)))
    | ~ c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(copy,[status(thm)],[c_3149]) ).

cnf(c_3150,plain,
    ( v_m = v_x
    | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a)))
    | ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) ),
    inference(resolve,[status(thm)],[c_1924,c_409]) ).

cnf(c_3151,plain,
    ( v_x = v_m
    | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a)))
    | ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) ),
    inference(copy,[status(thm)],[c_3150]) ).

cnf(c_3152,plain,
    ( v_x = v_m
    | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))) ),
    inference(resolve,[status(thm)],[c_410,c_3151]) ).

cnf(c_3147,plain,
    v_x = v_m,
    inference(resolve,[status(thm)],[c_411,c_3152]) ).

cnf(c_3153,plain,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))),
    inference(paramod,[status(thm)],[c_3147,c_411]) ).

cnf(c_3154,plain,
    ~ c_lessequals(v_m,v_m,tc_set(tc_set(t_a))),
    inference(paramod,[status(thm)],[c_408,c_3153]) ).

cnf(c_3148,plain,
    $false,
    inference(resolve,[status(thm)],[c_424,c_3154]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET841-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n020.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 08:21:18 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36  % Process 1070924 was started by sandbox on n020,
% 0.09/0.36  % Sat Sep 26 08:21:18 2026
% 0.09/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.39  
% 0.13/0.39  % From the command line: assign(max_seconds, 300).
% 10.04/4.02  
% 10.04/4.02  % given #500 (I,wt=2): 854 class_OrderedGroup_Osemigroup__mult(tc_nat).  [resolve(176,a,171,a)].
% 10.04/4.02  
% 10.04/4.02  % given #1000 (I,wt=4): 1354 -class_OrderedGroup_Olordered__ab__group__abs(A) | class_LOrder_Ojoin__semilorder(A) # tptp_name(clsrel_OrderedGroup_Olordered__ab__group__abs_15) # clausal_fof(1).  [assumption].
% 10.04/4.02  
% 10.04/4.02  % SZS status Unsatisfiable for theBenchmark
% 10.04/4.02  
% 10.04/4.02  % Proof 1 at 1.52 (+ 0.14) seconds.
% 10.04/4.02  % Length of proof is 13.
% 10.04/4.02  % Level of proof is 3.
% 10.04/4.02  % Maximum clause weight is 34.000.
% 10.04/4.02  % Given clauses 1494.
% 10.04/4.02  
% 10.04/4.02  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------