↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET149-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n011.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:46:45 PM UTC 2026

% Result   : Unsatisfiable 1.32s 1.07s
% Output   : CNFRefutation 1.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   30 (  11 unt;   2 def)
%            Number of atoms       :   84 (  11 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   49 (  25   ~;  24   |;   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  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn  36   !;   0   ?;  21   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0,X1] :
      ( subclass(X0,X1)
      | member(not_subclass_element(X0,X1),X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( subclass(X0,X1)
      | ~ member(not_subclass_element(X0,X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( X0 = X1
      | ~ subclass(X1,X0)
      | ~ subclass(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).

fof(f21,axiom,
    ! [X2,X0,X1] :
      ( member(X0,X1)
      | ~ member(X0,intersection(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).

fof(f22,axiom,
    ! [X2,X0,X1] :
      ( member(X0,X2)
      | ~ member(X0,intersection(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( member(X0,intersection(X1,X2))
      | ~ member(X0,X2)
      | ~ member(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).

fof(f122,negated_conjecture,
    intersection(x,intersection(x,y)) != intersection(x,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_idempotency_of_intersection_1) ).

fof(f123,plain,
    intersection(x,y) != intersection(x,intersection(x,y)),
    inference(reorient_equations,[],[f122]) ).

tcf(c_163,plain,
    ! [X0: $i,X1: $i] :
      ( subclass(X0,X1)
      | member(not_subclass_element(X0,X1),X0) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_164,plain,
    ! [X0: $i,X1: $i] :
      ( subclass(X0,X1)
      | ~ member(not_subclass_element(X0,X1),X1) ),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_168,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ subclass(X1,X0)
      | ~ subclass(X0,X1) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_180,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( member(X0,X1)
      | ~ member(X0,intersection(X1,X2)) ),
    inference(cnf_transformation,[],[f21]) ).

tcf(c_181,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( member(X0,X2)
      | ~ member(X0,intersection(X1,X2)) ),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_182,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( member(X0,intersection(X1,X2))
      | ~ member(X0,X2)
      | ~ member(X0,X1) ),
    inference(cnf_transformation,[],[f23]) ).

tcf(c_255,negated_conjecture,
    intersection(x,intersection(x,y)) != intersection(x,y),
    inference(cnf_transformation,[],[f123]) ).

tcf(c_2974,definition,
    iPr_def_10 = intersection(x,y),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_2975,definition,
    iPr_def_11 = intersection(x,iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_2976,negated_conjecture,
    iPr_def_11 != iPr_def_10,
    inference(demodulation,[status(thm)],[c_255,c_2974,c_2975]) ).

tcf(c_3866,plain,
    ! [X0: $i] :
      ( member(X0,x)
      | ~ member(X0,iPr_def_10) ),
    inference(superposition,[status(thm)],[c_2974,c_180]) ).

tcf(c_3937,plain,
    ! [X0: $i] :
      ( member(X0,iPr_def_10)
      | ~ member(X0,iPr_def_11) ),
    inference(superposition,[status(thm)],[c_2975,c_181]) ).

tcf(c_3969,plain,
    ! [X0: $i] :
      ( subclass(iPr_def_11,X0)
      | member(not_subclass_element(iPr_def_11,X0),iPr_def_10) ),
    inference(superposition,[status(thm)],[c_163,c_3937]) ).

tcf(c_4057,plain,
    subclass(iPr_def_11,iPr_def_10),
    inference(superposition,[status(thm)],[c_3969,c_164]) ).

tcf(c_4182,plain,
    ( ( iPr_def_10 = iPr_def_11 )
    | ~ subclass(iPr_def_10,iPr_def_11) ),
    inference(superposition,[status(thm)],[c_4057,c_168]) ).

tcf(c_4374,plain,
    ! [X0: $i] :
      ( member(X0,iPr_def_11)
      | ~ member(X0,iPr_def_10)
      | ~ member(X0,x) ),
    inference(superposition,[status(thm)],[c_2975,c_182]) ).

tcf(c_5067,plain,
    ! [X0: $i] :
      ( member(X0,iPr_def_11)
      | ~ member(X0,iPr_def_10) ),
    inference(global_subsumption_just,[status(thm)],[c_4374,c_3866,c_4374]) ).

tcf(c_5074,plain,
    ! [X0: $i] :
      ( subclass(iPr_def_10,X0)
      | member(not_subclass_element(iPr_def_10,X0),iPr_def_11) ),
    inference(superposition,[status(thm)],[c_163,c_5067]) ).

tcf(c_5096,plain,
    subclass(iPr_def_10,iPr_def_11),
    inference(superposition,[status(thm)],[c_5074,c_164]) ).

tcf(c_5105,plain,
    iPr_def_10 = iPr_def_11,
    inference(backward_subsumption_resolution,[status(thm)],[c_4182,c_5096]) ).

tcf(c_5124,plain,
    iPr_def_10 != iPr_def_10,
    inference(demodulation,[status(thm)],[c_2976,c_5105]) ).

tcf(c_5125,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_5124]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET149-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36  % Computer : n011.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 10:02:27 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  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.13/0.41  
% 0.13/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41  
% 0.13/0.41  % Detected problem language: tptp
% 0.13/0.42  % Proving...
% 1.32/1.07  % SZS status Started for theBenchmark.p
% 1.32/1.07  % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.07  
% 1.32/1.07  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.32/1.07  
% 1.32/1.07  % ------  iProver source info
% 1.32/1.07  
% 1.32/1.07  % git: date: 2026-07-19 20:42:38 +0200
% 1.32/1.07  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.32/1.07  % git: non_committed_changes: false
% 1.32/1.07  
% 1.32/1.07  % ------ Parsing...% successful
% 1.32/1.07  
% 1.32/1.07  
% 1.32/1.07  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.32/1.07  
% 1.32/1.07  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  sup_sim: 0  sf_s  rm: 3 0s  sf_e  pe_s  pe_e % 
% 1.32/1.07  
% 1.32/1.07  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.32/1.07  
% 1.32/1.07  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.32/1.07  % ------ Proving...
% 1.32/1.07  % ------ Problem Properties 
% 1.32/1.07  
% 1.32/1.07  % 
% 1.32/1.07  % clauses                               84
% 1.32/1.07  % conjectures                           1
% 1.32/1.07  % EPR                                   13
% 1.32/1.07  % Horn                                  76
% 1.32/1.07  % unary                                 23
% 1.32/1.07  % binary                                40
% 1.32/1.07  % lits                                  172
% 1.32/1.07  % lits eq                               28
% 1.32/1.07  % fd_pure                               0
% 1.32/1.07  % fd_pseudo                             0
% 1.32/1.07  % fd_cond                               3
% 1.32/1.07  % fd_pseudo_cond                        7
% 1.32/1.07  % AC symbols                            0
% 1.32/1.07  
% 1.32/1.07  % ------ Schedule dynamic 5 is on 
% 1.32/1.07  
% 1.32/1.07  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.32/1.07  
% 1.32/1.07  
% 1.32/1.07  % ------ 
% 1.32/1.07  % Current options:
% 1.32/1.07  % ------ 
% 1.32/1.07  
% 1.32/1.07  
% 1.32/1.07  % 
% 1.32/1.07  
% 1.32/1.07  % ------ Proving...
% 1.32/1.07  % 
% 1.32/1.07  
% 1.32/1.07  % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.07  
% 1.32/1.07  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.32/1.07  
% 1.32/1.07  
%------------------------------------------------------------------------------