↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n016.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:42 PM UTC 2026

% Result   : Unsatisfiable 2.40s 1.15s
% Output   : CNFRefutation 2.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   38 (  16 unt;   1 def)
%            Number of atoms       :   82 (   1 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   65 (  32   ~;  33   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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  :    5 (   3 usr;   2 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   74 (   0 sgn  74   !;   0   ?;  51   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,X2,X3)
      | ~ c_in(X0,c_inter(X1,X2,X3),X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OIntE_0) ).

fof(f2,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,X1,X3)
      | ~ c_in(X0,c_inter(X1,X2,X3),X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OIntE_1) ).

fof(f3,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,c_inter(X3,X1,X2),X2)
      | ~ c_in(X0,X3,X2)
      | ~ c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OIntI_0) ).

fof(f4,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/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( c_lessequals(X0,X1,tc_set(X2))
      | c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

fof(f6,axiom,
    ! [X2,X0,X1] :
      ( c_lessequals(X0,X1,tc_set(X2))
      | ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).

fof(f7,negated_conjecture,
    c_in(v_x,v_Y,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f8,negated_conjecture,
    c_in(v_x,v_Z,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f9,negated_conjecture,
    ~ c_in(v_x,v_X,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f10,negated_conjecture,
    ! [X0] :
      ( ~ c_lessequals(X0,v_Y,tc_set(t_a))
      | ~ c_lessequals(X0,v_Z,tc_set(t_a))
      | c_lessequals(X0,v_X,tc_set(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

tcf(c_59,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X0,X2,X3)
      | ~ c_in(X0,c_inter(X1,X2,X3),X3) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X0,X1,X3)
      | ~ c_in(X0,c_inter(X1,X2,X3),X3) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X0,c_inter(X3,X1,X2),X2)
      | ~ c_in(X0,X3,X2)
      | ~ c_in(X0,X1,X2) ),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_62,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,[],[f4]) ).

tcf(c_63,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( c_lessequals(X0,X1,tc_set(X2))
      | c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( c_lessequals(X0,X1,tc_set(X2))
      | ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_65,negated_conjecture,
    c_in(v_x,v_Y,t_a),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_66,negated_conjecture,
    c_in(v_x,v_Z,t_a),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_67,negated_conjecture,
    ~ c_in(v_x,v_X,t_a),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_68,negated_conjecture,
    ! [X0: $i] :
      ( c_lessequals(X0,v_X,tc_set(t_a))
      | ~ c_lessequals(X0,v_Z,tc_set(t_a))
      | ~ c_lessequals(X0,v_Y,tc_set(t_a)) ),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_114,definition,
    iPr_def_10 = tc_set(t_a),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_115,negated_conjecture,
    ! [X0: $i] :
      ( c_lessequals(X0,v_X,iPr_def_10)
      | ~ c_lessequals(X0,v_Z,iPr_def_10)
      | ~ c_lessequals(X0,v_Y,iPr_def_10) ),
    inference(demodulation,[status(thm)],[c_68,c_114]) ).

tcf(c_116,negated_conjecture,
    ~ c_in(v_x,v_X,t_a),
    inference(demodulation,[status(thm)],[c_67]) ).

tcf(c_117,negated_conjecture,
    c_in(v_x,v_Z,t_a),
    inference(demodulation,[status(thm)],[c_66]) ).

tcf(c_118,negated_conjecture,
    c_in(v_x,v_Y,t_a),
    inference(demodulation,[status(thm)],[c_65]) ).

tcf(c_290,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_lessequals(c_inter(X0,X1,X2),X3,tc_set(X2))
      | c_in(c_Main_OsubsetI__1(c_inter(X0,X1,X2),X3,X2),X0,X2) ),
    inference(superposition,[status(thm)],[c_63,c_60]) ).

tcf(c_291,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_lessequals(c_inter(X0,X1,X2),X3,tc_set(X2))
      | c_in(c_Main_OsubsetI__1(c_inter(X0,X1,X2),X3,X2),X1,X2) ),
    inference(superposition,[status(thm)],[c_63,c_59]) ).

tcf(c_313,plain,
    ! [X0: $i,X1: $i,X2: $i] : c_lessequals(c_inter(X0,X1,X2),X0,tc_set(X2)),
    inference(superposition,[status(thm)],[c_290,c_64]) ).

tcf(c_322,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( c_in(X0,X2,t_a)
      | ~ c_lessequals(X1,X2,iPr_def_10)
      | ~ c_in(X0,X1,t_a) ),
    inference(superposition,[status(thm)],[c_114,c_62]) ).

tcf(c_345,plain,
    ! [X0: $i,X1: $i] : c_lessequals(c_inter(X0,X1,t_a),X0,iPr_def_10),
    inference(superposition,[status(thm)],[c_114,c_313]) ).

tcf(c_369,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( c_in(X3,X2,t_a)
      | ~ c_in(X3,X1,t_a)
      | ~ c_in(X3,X0,t_a)
      | ~ c_lessequals(c_inter(X0,X1,t_a),X2,iPr_def_10) ),
    inference(superposition,[status(thm)],[c_61,c_322]) ).

tcf(c_431,plain,
    ! [X0: $i,X1: $i,X2: $i] : c_lessequals(c_inter(X0,X1,X2),X1,tc_set(X2)),
    inference(superposition,[status(thm)],[c_291,c_64]) ).

tcf(c_450,plain,
    ! [X0: $i,X1: $i] : c_lessequals(c_inter(X0,X1,t_a),X1,iPr_def_10),
    inference(superposition,[status(thm)],[c_114,c_431]) ).

tcf(c_452,plain,
    ! [X0: $i] :
      ( c_lessequals(c_inter(X0,v_Y,t_a),v_X,iPr_def_10)
      | ~ c_lessequals(c_inter(X0,v_Y,t_a),v_Z,iPr_def_10) ),
    inference(superposition,[status(thm)],[c_450,c_115]) ).

tcf(c_500,plain,
    c_lessequals(c_inter(v_Z,v_Y,t_a),v_X,iPr_def_10),
    inference(superposition,[status(thm)],[c_345,c_452]) ).

tcf(c_1739,plain,
    ! [X0: $i] :
      ( c_in(X0,v_X,t_a)
      | ~ c_in(X0,v_Z,t_a)
      | ~ c_in(X0,v_Y,t_a) ),
    inference(superposition,[status(thm)],[c_500,c_369]) ).

tcf(c_2255,plain,
    ( c_in(v_x,v_X,t_a)
    | ~ c_in(v_x,v_Z,t_a) ),
    inference(superposition,[status(thm)],[c_118,c_1739]) ).

tcf(c_2272,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2255,c_116,c_117]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET830-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35  % Computer : n016.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 : Thu Sep 24 12:11:12 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.39  Running first-order theorem proving
% 0.10/0.39  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.40  
% 0.10/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.40  
% 0.10/0.40  % Detected problem language: tptp
% 0.10/0.41  % Proving...
% 2.40/1.15  % SZS status Started for theBenchmark.p
% 2.40/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 2.40/1.15  
% 2.40/1.15  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.40/1.15  
% 2.40/1.15  % ------  iProver source info
% 2.40/1.15  
% 2.40/1.15  % git: date: 2026-07-19 20:42:38 +0200
% 2.40/1.15  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.40/1.15  % git: non_committed_changes: false
% 2.40/1.15  
% 2.40/1.15  % ------ Parsing...% successful
% 2.40/1.15  
% 2.40/1.15  
% 2.40/1.15  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.40/1.15  
% 2.40/1.15  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 2.40/1.15  
% 2.40/1.15  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.40/1.15  
% 2.40/1.15  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.40/1.15  % ------ Proving...
% 2.40/1.15  % ------ Problem Properties 
% 2.40/1.15  
% 2.40/1.15  % 
% 2.40/1.15  % clauses                               11
% 2.40/1.15  % conjectures                           4
% 2.40/1.15  % EPR                                   4
% 2.40/1.15  % Horn                                  10
% 2.40/1.15  % unary                                 4
% 2.40/1.15  % binary                                4
% 2.40/1.15  % lits                                  21
% 2.40/1.15  % lits eq                               1
% 2.40/1.15  % fd_pure                               0
% 2.40/1.15  % fd_pseudo                             0
% 2.40/1.15  % fd_cond                               0
% 2.40/1.15  % fd_pseudo_cond                        0
% 2.40/1.15  % AC symbols                            0
% 2.40/1.15  
% 2.40/1.15  % ------ Schedule dynamic 5 is on 
% 2.40/1.15  
% 2.40/1.15  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.40/1.15  
% 2.40/1.15  
% 2.40/1.15  % ------ 
% 2.40/1.15  % Current options:
% 2.40/1.15  % ------ 
% 2.40/1.15  
% 2.40/1.15  
% 2.40/1.15  % 
% 2.40/1.15  
% 2.40/1.15  % ------ Proving...
% 2.40/1.15  % 
% 2.40/1.15  
% 2.40/1.15  % SZS status Unsatisfiable for theBenchmark.p
% 2.40/1.15  
% 2.40/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.40/1.15  
% 2.40/1.15  
%------------------------------------------------------------------------------