↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET852-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n015.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 : Fri Sep 25 02:48:48 PM UTC 2026

% Result   : Unsatisfiable 52.80s 13.70s
% Output   : CNFRefutation 91.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   17 (   5 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   34 (  11   ~;  23   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-4 aty)
%            Number of variables   :   30 (   0 sgn  30   !;   0   ?;  17   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1434,axiom,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(c_Union(X2,X3),X0,tc_set(X3))
      | c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
      | c_in(c_Zorn_OUnion__lemma0__1(X0,X1,X2,X3),X2,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_0) ).

fof(f1435,axiom,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(c_Union(X2,X3),X0,tc_set(X3))
      | c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
      | ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X0,X1,X2,X3),X0,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_1) ).

fof(f1436,axiom,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(c_Union(X2,X3),X1,tc_set(X3))
      | c_lessequals(X0,c_Union(X2,X3),tc_set(X3))
      | ~ c_lessequals(X0,c_Zorn_OUnion__lemma0__1(X1,X0,X2,X3),tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_2) ).

fof(f1440,negated_conjecture,
    ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f1441,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f1442,negated_conjecture,
    ! [X0] :
      ( ~ c_in(X0,v_Y,tc_set(tc_set(t_a)))
      | c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X0,tc_set(tc_set(t_a))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

tcf(c_2007,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
      | c_lessequals(c_Union(X2,X3),X0,tc_set(X3))
      | c_in(c_Zorn_OUnion__lemma0__1(X0,X1,X2,X3),X2,tc_set(X3)) ),
    inference(cnf_transformation,[],[f1434]) ).

tcf(c_2008,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
      | c_lessequals(c_Union(X2,X3),X0,tc_set(X3))
      | ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X0,X1,X2,X3),X0,tc_set(X3)) ),
    inference(cnf_transformation,[],[f1435]) ).

tcf(c_2009,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_lessequals(X0,c_Union(X2,X3),tc_set(X3))
      | c_lessequals(c_Union(X2,X3),X1,tc_set(X3))
      | ~ c_lessequals(X0,c_Zorn_OUnion__lemma0__1(X1,X0,X2,X3),tc_set(X3)) ),
    inference(cnf_transformation,[],[f1436]) ).

tcf(c_2013,negated_conjecture,
    ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
    inference(cnf_transformation,[],[f1440]) ).

tcf(c_2014,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(cnf_transformation,[],[f1441]) ).

tcf(c_2015,negated_conjecture,
    ! [X0: $i] :
      ( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X0,tc_set(tc_set(t_a)))
      | ~ c_in(X0,v_Y,tc_set(tc_set(t_a))) ),
    inference(cnf_transformation,[],[f1442]) ).

tcf(c_50982,plain,
    ! [X0: $i,X1: $i] :
      ( c_lessequals(c_Union(X1,tc_set(t_a)),X0,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(X1,tc_set(t_a)),tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
      | ~ c_in(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_2015,c_2009]) ).

tcf(c_51103,plain,
    ! [X0: $i] :
      ( c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_2007,c_50982]) ).

tcf(c_51104,plain,
    ! [X0: $i] :
      ( c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_51103,c_2014]) ).

tcf(c_51108,plain,
    ( c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))) ),
    inference(superposition,[status(thm)],[c_51104,c_2008]) ).

tcf(c_51115,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_51108,c_2013,c_2014]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET852-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.58  % Computer : n015.cluster.edu
% 0.10/0.58  % Model    : x86_64 x86_64
% 0.10/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58  % Memory   : 8046.5625MB
% 0.10/0.58  % OS       : Linux 6.8.0-71-generic
% 0.10/0.58  % CPULimit : 300
% 0.10/0.58  % WCLimit  : 300
% 0.10/0.58  % DateTime : Thu Sep 24 12:16:57 UTC 2026
% 0.10/0.58  % CPUTime  : 
% 0.10/0.58  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.62  Running first-order theorem proving
% 0.10/0.62  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.63  
% 0.10/0.63  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.63  
% 0.10/0.63  % Detected problem language: tptp
% 0.14/0.65  % Proving...
% 52.80/13.70  % SZS status Started for theBenchmark.p
% 52.80/13.70  % SZS status Unsatisfiable for theBenchmark.p
% 52.80/13.70  
% 52.80/13.70  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 52.80/13.70  
% 52.80/13.70  % ------  iProver source info
% 52.80/13.70  
% 52.80/13.70  % git: date: 2026-07-19 20:42:38 +0200
% 52.80/13.70  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 52.80/13.70  % git: non_committed_changes: false
% 52.80/13.70  
% 52.80/13.70  % ------ Parsing...% successful
% 52.80/13.70  
% 52.80/13.70  
% 52.80/13.70  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 52.80/13.70  
% 52.80/13.70  % ------ Preprocessing... sup_sim: 1  sf_s  rm: 18 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e  sup_sim: 0  sf_s  rm: 30 0s  sf_e  pe_s  pe_e % 
% 52.80/13.70  
% 52.80/13.70  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 52.80/13.70  
% 52.80/13.70  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 52.80/13.70  % ------ Proving...
% 52.80/13.70  % ------ Problem Properties 
% 52.80/13.70  
% 52.80/13.70  % 
% 52.80/13.70  % clauses                               305
% 52.80/13.70  % conjectures                           6
% 52.80/13.70  % EPR                                   26
% 52.80/13.70  % Horn                                  273
% 52.80/13.70  % unary                                 79
% 52.80/13.70  % binary                                174
% 52.80/13.70  % lits                                  584
% 52.80/13.70  % lits eq                               163
% 52.80/13.70  % fd_pure                               0
% 52.80/13.70  % fd_pseudo                             0
% 52.80/13.70  % fd_cond                               22
% 52.80/13.70  % fd_pseudo_cond                        40
% 52.80/13.70  % AC symbols                            0
% 52.80/13.70  
% 52.80/13.70  % ------ Input Options Time Limit: Unbounded
% 52.80/13.70  
% 52.80/13.70  
% 52.80/13.70  % ------ 
% 52.80/13.70  % Current options:
% 52.80/13.70  % ------ 
% 52.80/13.70  
% 52.80/13.70  
% 52.80/13.70  % 
% 52.80/13.70  
% 52.80/13.70  % ------ Proving...
% 52.80/13.70  % 
% 52.80/13.70  
% 52.80/13.70  % SZS status Unsatisfiable for theBenchmark.p
% 52.80/13.70  
% 52.80/13.70  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 91.99/13.70  
% 91.99/13.70  
%------------------------------------------------------------------------------