↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 0.57s 0.96s
% Output   : CNFRefutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   21 (  14 unt;   2 def)
%            Number of atoms       :   36 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    2 (   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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn   8   !;   0   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
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(f101,negated_conjecture,
    member(not_subclass_element(x,y),y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equality4_1) ).

fof(f102,negated_conjecture,
    member(not_subclass_element(y,x),x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equality4_2) ).

fof(f103,negated_conjecture,
    x != y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equality4_3) ).

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

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

tcf(c_218,negated_conjecture,
    member(not_subclass_element(x,y),y),
    inference(cnf_transformation,[],[f101]) ).

tcf(c_219,negated_conjecture,
    member(not_subclass_element(y,x),x),
    inference(cnf_transformation,[],[f102]) ).

tcf(c_220,negated_conjecture,
    x != y,
    inference(cnf_transformation,[],[f103]) ).

tcf(c_2653,definition,
    iPr_def_10 = not_subclass_element(y,x),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_2654,definition,
    iPr_def_11 = not_subclass_element(x,y),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_2655,negated_conjecture,
    x != y,
    inference(demodulation,[status(thm)],[c_220]) ).

tcf(c_2656,negated_conjecture,
    member(iPr_def_10,x),
    inference(demodulation,[status(thm)],[c_219,c_2653]) ).

tcf(c_2657,negated_conjecture,
    member(iPr_def_11,y),
    inference(demodulation,[status(thm)],[c_218,c_2654]) ).

tcf(c_3473,plain,
    ( subclass(x,y)
    | ~ member(iPr_def_11,y) ),
    inference(superposition,[status(thm)],[c_2654,c_145]) ).

tcf(c_3474,plain,
    ( subclass(y,x)
    | ~ member(iPr_def_10,x) ),
    inference(superposition,[status(thm)],[c_2653,c_145]) ).

tcf(c_3475,plain,
    subclass(y,x),
    inference(forward_subsumption_resolution,[status(thm)],[c_3474,c_2656]) ).

tcf(c_3476,plain,
    subclass(x,y),
    inference(forward_subsumption_resolution,[status(thm)],[c_3473,c_2657]) ).

tcf(c_3708,plain,
    ( ( x = y )
    | ~ subclass(x,y) ),
    inference(superposition,[status(thm)],[c_3475,c_149]) ).

tcf(c_3712,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3708,c_2655,c_3476]) ).


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