↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 0.07s 10.98s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   32 (  13 unt;   1 def)
%            Number of atoms       :   73 (  10 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   53 (  27   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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  :    5 (   3 usr;   2 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(f1,axiom,
    ! [X2,X0,X1] :
      ( member(X2,X1)
      | ~ member(X2,X0)
      | ~ subclass(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).

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(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,
    subclass(x,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property1_1) ).

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

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

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

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

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

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

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

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

tcf(c_256,negated_conjecture,
    subclass(x,y),
    inference(cnf_transformation,[],[f122]) ).

tcf(c_257,negated_conjecture,
    intersection(x,y) != x,
    inference(cnf_transformation,[],[f124]) ).

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

tcf(c_2982,negated_conjecture,
    iPr_def_10 != x,
    inference(demodulation,[status(thm)],[c_257,c_2981]) ).

tcf(c_2983,negated_conjecture,
    subclass(x,y),
    inference(demodulation,[status(thm)],[c_256]) ).

tcf(c_3873,plain,
    ! [X0: $i] :
      ( member(X0,x)
      | ~ member(X0,iPr_def_10) ),
    inference(superposition,[status(thm)],[c_2981,c_181]) ).

tcf(c_3887,plain,
    ! [X0: $i] :
      ( subclass(iPr_def_10,X0)
      | member(not_subclass_element(iPr_def_10,X0),x) ),
    inference(superposition,[status(thm)],[c_164,c_3873]) ).

tcf(c_3898,plain,
    subclass(iPr_def_10,x),
    inference(superposition,[status(thm)],[c_3887,c_165]) ).

tcf(c_3991,plain,
    ! [X0: $i] :
      ( member(X0,y)
      | ~ member(X0,x) ),
    inference(superposition,[status(thm)],[c_2983,c_163]) ).

tcf(c_4203,plain,
    ( ( x = iPr_def_10 )
    | ~ subclass(x,iPr_def_10) ),
    inference(superposition,[status(thm)],[c_3898,c_169]) ).

tcf(c_4334,plain,
    ! [X0: $i] :
      ( member(X0,iPr_def_10)
      | ~ member(X0,y)
      | ~ member(X0,x) ),
    inference(superposition,[status(thm)],[c_2981,c_183]) ).

tcf(c_5017,plain,
    ! [X0: $i] :
      ( member(X0,iPr_def_10)
      | ~ member(X0,x) ),
    inference(global_subsumption_just,[status(thm)],[c_4334,c_3991,c_4334]) ).

tcf(c_5024,plain,
    ! [X0: $i] :
      ( subclass(x,X0)
      | member(not_subclass_element(x,X0),iPr_def_10) ),
    inference(superposition,[status(thm)],[c_164,c_5017]) ).

tcf(c_5048,plain,
    subclass(x,iPr_def_10),
    inference(superposition,[status(thm)],[c_5024,c_165]) ).

tcf(c_5054,plain,
    x = iPr_def_10,
    inference(backward_subsumption_resolution,[status(thm)],[c_4203,c_5048]) ).

tcf(c_5066,plain,
    iPr_def_10 != iPr_def_10,
    inference(demodulation,[status(thm)],[c_2982,c_5054]) ).

tcf(c_5068,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_5066]) ).


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