↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SET190-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/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:46:53 PM UTC 2026

% Result   : Unsatisfiable 3.11s 1.35s
% Output   : CNFRefutation 3.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   46 (  20 unt;   5 def)
%            Number of atoms       :  106 (  16 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   71 (  37   ~;  34   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   6 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   52 (   0 sgn  52   !;   0   ?;  30   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] :
      ( member(X2,X1)
      | ~ member(X2,X0)
      | ~ subclass(X0,X1) ),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).

fof(f4,axiom,
    ! [X0] : subclass(X0,universal_class),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( X0 = X1
      | ~ subclass(X1,X0)
      | ~ subclass(X0,X1) ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).

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

fof(f24,axiom,
    ! [X0,X1] :
      ( ~ member(X0,X1)
      | ~ member(X0,complement(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).

fof(f25,axiom,
    ! [X0,X1] :
      ( member(X0,X1)
      | member(X0,complement(X1))
      | ~ member(X0,universal_class) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).

fof(f26,axiom,
    ! [X0,X1] : complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).

fof(f122,negated_conjecture,
    subclass(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property7_1) ).

fof(f123,negated_conjecture,
    union(complement(x),y) != universal_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property7_2) ).

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

fof(f187,plain,
    universal_class != complement(intersection(complement(complement(x)),complement(y))),
    inference(definition_unfolding,[],[f124,f26]) ).

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_166,plain,
    ! [X0: $i] : subclass(X0,universal_class),
    inference(cnf_transformation,[],[f4]) ).

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_182,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( member(X0,X2)
      | ~ member(X0,intersection(X1,X2)) ),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_184,plain,
    ! [X0: $i,X1: $i] :
      ( ~ member(X0,X1)
      | ~ member(X0,complement(X1)) ),
    inference(cnf_transformation,[],[f24]) ).

tcf(c_185,plain,
    ! [X0: $i,X1: $i] :
      ( member(X0,X1)
      | member(X0,complement(X1))
      | ~ member(X0,universal_class) ),
    inference(cnf_transformation,[],[f25]) ).

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

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

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

tcf(c_2982,definition,
    iPr_def_11 = complement(iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_2983,definition,
    iPr_def_12 = complement(y),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_2984,definition,
    iPr_def_13 = intersection(iPr_def_11,iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_2985,definition,
    iPr_def_14 = complement(iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_2986,negated_conjecture,
    iPr_def_14 != universal_class,
    inference(demodulation,[status(thm)],[c_257,c_2983,c_2981,c_2982,c_2984,c_2985]) ).

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

tcf(c_3893,plain,
    ! [X0: $i] :
      ( member(X0,iPr_def_11)
      | ~ member(X0,iPr_def_13) ),
    inference(superposition,[status(thm)],[c_2984,c_181]) ).

tcf(c_3929,plain,
    ! [X0: $i] :
      ( member(X0,iPr_def_12)
      | ~ member(X0,iPr_def_13) ),
    inference(superposition,[status(thm)],[c_2984,c_182]) ).

tcf(c_3976,plain,
    ! [X0: $i] :
      ( ~ member(X0,iPr_def_12)
      | ~ member(X0,y) ),
    inference(superposition,[status(thm)],[c_2983,c_184]) ).

tcf(c_3977,plain,
    ! [X0: $i] :
      ( ~ member(X0,iPr_def_11)
      | ~ member(X0,iPr_def_10) ),
    inference(superposition,[status(thm)],[c_2982,c_184]) ).

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

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

tcf(c_4201,plain,
    ! [X0: $i] :
      ( member(X0,iPr_def_14)
      | member(X0,iPr_def_13)
      | ~ member(X0,universal_class) ),
    inference(superposition,[status(thm)],[c_2985,c_185]) ).

tcf(c_4234,plain,
    ! [X0: $i] :
      ( ( X0 = universal_class )
      | ~ subclass(universal_class,X0) ),
    inference(superposition,[status(thm)],[c_166,c_169]) ).

tcf(c_5062,plain,
    ! [X0: $i] :
      ( member(X0,iPr_def_14)
      | ~ member(X0,universal_class) ),
    inference(global_subsumption_just,[status(thm)],[c_4201,c_3893,c_3929,c_3977,c_3976,c_4135,c_4201,c_4198]) ).

tcf(c_5069,plain,
    ! [X0: $i] :
      ( subclass(universal_class,X0)
      | member(not_subclass_element(universal_class,X0),iPr_def_14) ),
    inference(superposition,[status(thm)],[c_164,c_5062]) ).

tcf(c_5123,plain,
    subclass(universal_class,iPr_def_14),
    inference(superposition,[status(thm)],[c_5069,c_165]) ).

tcf(c_5129,plain,
    universal_class = iPr_def_14,
    inference(superposition,[status(thm)],[c_5123,c_4234]) ).

tcf(c_5176,plain,
    iPr_def_14 != iPr_def_14,
    inference(demodulation,[status(thm)],[c_2986,c_5129]) ).

tcf(c_5177,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_5176]) ).


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