↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET865-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 : n005.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:51 PM UTC 2026

% Result   : Unsatisfiable 0.71s 1.21s
% Output   : CNFRefutation 0.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   25 (   8 unt;   0 def)
%            Number of atoms       :   50 (   7 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   55 (  30   ~;  25   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :   43 (   0 sgn  43   !;   0   ?;  26   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f378,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,X3,X2)
      | ~ c_lessequals(X1,X3,tc_set(X2))
      | ~ c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).

fof(f1434,axiom,
    ! [X0,X1] : c_in(c_Zorn_OHausdorff__1(X0,X1),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OHausdorff_0) ).

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

fof(f1436,axiom,
    ! [X0,X1] : c_lessequals(c_Zorn_Omaxchain(X0,X1),c_Zorn_Ochain(X0,X1),tc_set(tc_set(tc_set(X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__subset__chain_0) ).

fof(f1437,negated_conjecture,
    ! [X0] :
      ( ~ c_in(X0,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
      | c_in(c_Union(X0,t_a),v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f1438,negated_conjecture,
    ! [X0] :
      ( ~ c_in(X0,v_S,tc_set(t_a))
      | c_in(v_x(X0),v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f1439,negated_conjecture,
    ! [X0] :
      ( ~ c_in(X0,v_S,tc_set(t_a))
      | c_lessequals(X0,v_x(X0),tc_set(t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f1440,negated_conjecture,
    ! [X0] :
      ( ~ c_in(X0,v_S,tc_set(t_a))
      | X0 != v_x(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f1441,plain,
    ! [X0] :
      ( ~ c_in(X0,v_S,tc_set(t_a))
      | v_x(X0) != X0 ),
    inference(reorient_equations,[],[f1440]) ).

tcf(c_1716,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X3,X1,X2)
      | ~ c_in(X3,X0,X2)
      | ~ c_lessequals(X0,X1,tc_set(X2)) ),
    inference(cnf_transformation,[],[f378]) ).

tcf(c_2004,plain,
    ! [X0: $i,X1: $i] : c_in(c_Zorn_OHausdorff__1(X0,X1),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(X1))),
    inference(cnf_transformation,[],[f1434]) ).

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

tcf(c_2006,plain,
    ! [X0: $i,X1: $i] : c_lessequals(c_Zorn_Omaxchain(X0,X1),c_Zorn_Ochain(X0,X1),tc_set(tc_set(tc_set(X1)))),
    inference(cnf_transformation,[],[f1436]) ).

tcf(c_2007,negated_conjecture,
    ! [X0: $i] :
      ( c_in(c_Union(X0,t_a),v_S,tc_set(t_a))
      | ~ c_in(X0,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(cnf_transformation,[],[f1437]) ).

tcf(c_2008,negated_conjecture,
    ! [X0: $i] :
      ( c_in(v_x(X0),v_S,tc_set(t_a))
      | ~ c_in(X0,v_S,tc_set(t_a)) ),
    inference(cnf_transformation,[],[f1438]) ).

tcf(c_2009,negated_conjecture,
    ! [X0: $i] :
      ( c_lessequals(X0,v_x(X0),tc_set(t_a))
      | ~ c_in(X0,v_S,tc_set(t_a)) ),
    inference(cnf_transformation,[],[f1439]) ).

tcf(c_2010,negated_conjecture,
    ! [X0: $i] :
      ( ~ c_in(X0,v_S,tc_set(t_a))
      | ( v_x(X0) != X0 ) ),
    inference(cnf_transformation,[],[f1441]) ).

tcf(c_2218,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( c_in(X0,c_Zorn_Ochain(X1,X2),tc_set(tc_set(X2)))
      | ~ c_in(X0,c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))) ),
    inference(superposition,[status(thm)],[c_2006,c_1716]) ).

tcf(c_2251,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( c_Union(c_Zorn_OHausdorff__1(X0,X1),X1) = X2 )
      | ~ c_in(X2,X0,tc_set(X1))
      | ~ c_lessequals(c_Union(c_Zorn_OHausdorff__1(X0,X1),X1),X2,tc_set(X1)) ),
    inference(superposition,[status(thm)],[c_2004,c_2005]) ).

tcf(c_2264,plain,
    ! [X0: $i,X1: $i] : c_in(c_Zorn_OHausdorff__1(X0,X1),c_Zorn_Ochain(X0,X1),tc_set(tc_set(X1))),
    inference(superposition,[status(thm)],[c_2004,c_2218]) ).

tcf(c_2294,plain,
    ! [X0: $i] :
      ( ( v_x(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a)) = c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a) )
      | ~ c_in(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a),v_S,tc_set(t_a))
      | ~ c_in(v_x(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a)),X0,tc_set(t_a)) ),
    inference(superposition,[status(thm)],[c_2009,c_2251]) ).

tcf(c_2304,plain,
    c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a)),
    inference(superposition,[status(thm)],[c_2264,c_2007]) ).

tcf(c_2335,plain,
    ! [X0: $i] :
      ( ~ c_in(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a),v_S,tc_set(t_a))
      | ~ c_in(v_x(c_Union(c_Zorn_OHausdorff__1(X0,t_a),t_a)),X0,tc_set(t_a)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_2294,c_2010]) ).

tcf(c_2342,plain,
    ~ c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a)),
    inference(superposition,[status(thm)],[c_2008,c_2335]) ).

tcf(c_2344,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_2342,c_2304]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET865-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.08/0.37  % Computer : n005.cluster.edu
% 0.08/0.37  % Model    : x86_64 x86_64
% 0.08/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37  % Memory   : 8046.5625MB
% 0.08/0.37  % OS       : Linux 6.8.0-71-generic
% 0.08/0.37  % CPULimit : 300
% 0.08/0.37  % WCLimit  : 300
% 0.08/0.37  % DateTime : Thu Sep 24 12:17:47 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.41  Running first-order theorem proving
% 0.08/0.41  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.08/0.42  
% 0.08/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42  
% 0.08/0.42  % Detected problem language: tptp
% 0.08/0.43  % Proving...
% 0.71/1.21  % SZS status Started for theBenchmark.p
% 0.71/1.21  % SZS status Unsatisfiable for theBenchmark.p
% 0.71/1.21  
% 0.71/1.21  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.71/1.21  
% 0.71/1.21  % ------  iProver source info
% 0.71/1.21  
% 0.71/1.21  % git: date: 2026-07-19 20:42:38 +0200
% 0.71/1.21  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.71/1.21  % git: non_committed_changes: false
% 0.71/1.21  
% 0.71/1.21  % ------ Parsing...% successful
% 0.71/1.21  
% 0.71/1.21  
% 0.71/1.21  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.71/1.21  % ------ Proving...
% 0.71/1.21  % ------ Problem Properties 
% 0.71/1.21  
% 0.71/1.21  % 
% 0.71/1.21  % clauses                               598
% 0.71/1.21  % conjectures                           4
% 0.71/1.21  % EPR                                   289
% 0.71/1.21  % Horn                                  570
% 0.71/1.21  % unary                                 146
% 0.71/1.21  % binary                                391
% 0.71/1.21  % lits                                  1112
% 0.71/1.21  % lits eq                               194
% 0.71/1.21  % fd_pure                               0
% 0.71/1.21  % fd_pseudo                             0
% 0.71/1.21  % fd_cond                               28
% 0.71/1.21  % fd_pseudo_cond                        39
% 0.71/1.21  % AC symbols                            0
% 0.71/1.21  
% 0.71/1.21  % ------ Input Options Time Limit: Unbounded
% 0.71/1.21  
% 0.71/1.21  
% 0.71/1.21  % ------ 
% 0.71/1.21  % Current options:
% 0.71/1.21  % ------ 
% 0.71/1.21  
% 0.71/1.21  
% 0.71/1.21  % 
% 0.71/1.21  
% 0.71/1.21  % ------ Proving...
% 0.71/1.21  % 
% 0.71/1.21  
% 0.71/1.21  % ------ Proving...
% 0.71/1.21  % 
% 0.71/1.21  
% 0.71/1.21  % SZS status Unsatisfiable for theBenchmark.p
% 0.71/1.21  
% 0.71/1.21  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.71/1.21  
% 0.71/1.21  
%------------------------------------------------------------------------------