↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 4.16s 1.30s
% Output   : CNFRefutation 4.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   26 (  14 unt;   1 def)
%            Number of atoms       :   50 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  17   ~;  14   |;   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  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn  29   !;   0   ?;  11   :)

% 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(f12,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).

fof(f13,axiom,
    ! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',ordered_pair) ).

fof(f15,axiom,
    ! [X2,X3,X0,X1] :
      ( member(X1,X3)
      | ~ member(ordered_pair(X0,X1),cross_product(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).

fof(f107,axiom,
    subclass(domain_relation,cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-1.ax',definition_of_domain_relation1) ).

fof(f109,axiom,
    ! [X0] :
      ( member(ordered_pair(X0,domain_of(X0)),domain_relation)
      | ~ member(X0,universal_class) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-1.ax',definition_of_domain_relation3) ).

fof(f122,negated_conjecture,
    member(x,universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_replacement_property1_1) ).

fof(f123,negated_conjecture,
    ~ member(domain_of(x),universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_replacement_property1_2) ).

fof(f128,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
    inference(definition_unfolding,[],[f13,f12,f12]) ).

fof(f138,plain,
    ! [X2,X3,X0,X1] :
      ( member(X1,X3)
      | ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3)) ),
    inference(definition_unfolding,[],[f15,f128]) ).

fof(f180,plain,
    ! [X0] :
      ( member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(domain_of(X0),domain_of(X0)))),domain_relation)
      | ~ member(X0,universal_class) ),
    inference(definition_unfolding,[],[f109,f128]) ).

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

tcf(c_175,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( member(X1,X3)
      | ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3)) ),
    inference(cnf_transformation,[],[f138]) ).

tcf(c_244,plain,
    subclass(domain_relation,cross_product(universal_class,universal_class)),
    inference(cnf_transformation,[],[f107]) ).

tcf(c_246,plain,
    ! [X0: $i] :
      ( member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(domain_of(X0),domain_of(X0)))),domain_relation)
      | ~ member(X0,universal_class) ),
    inference(cnf_transformation,[],[f180]) ).

tcf(c_256,negated_conjecture,
    member(x,universal_class),
    inference(cnf_transformation,[],[f122]) ).

tcf(c_257,negated_conjecture,
    ~ member(domain_of(x),universal_class),
    inference(cnf_transformation,[],[f123]) ).

tcf(c_2980,definition,
    iPr_def_10 = domain_of(x),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_2981,negated_conjecture,
    ~ member(iPr_def_10,universal_class),
    inference(demodulation,[status(thm)],[c_257,c_2980]) ).

tcf(c_2982,negated_conjecture,
    member(x,universal_class),
    inference(demodulation,[status(thm)],[c_256]) ).

tcf(c_4843,plain,
    ( member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(iPr_def_10,iPr_def_10))),domain_relation)
    | ~ member(x,universal_class) ),
    inference(superposition,[status(thm)],[c_2980,c_246]) ).

tcf(c_4850,plain,
    member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(iPr_def_10,iPr_def_10))),domain_relation),
    inference(forward_subsumption_resolution,[status(thm)],[c_4843,c_2982]) ).

tcf(c_4956,plain,
    ! [X0: $i] :
      ( member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(iPr_def_10,iPr_def_10))),X0)
      | ~ subclass(domain_relation,X0) ),
    inference(superposition,[status(thm)],[c_4850,c_163]) ).

tcf(c_4974,plain,
    ! [X0: $i,X1: $i] :
      ( member(iPr_def_10,X1)
      | ~ subclass(domain_relation,cross_product(X0,X1)) ),
    inference(superposition,[status(thm)],[c_4956,c_175]) ).

tcf(c_5013,plain,
    ( member(iPr_def_10,universal_class)
    | ~ subclass(domain_relation,cross_product(universal_class,universal_class)) ),
    inference(instantiation,[status(thm)],[c_4974]) ).

tcf(c_5014,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_5013,c_2981,c_244]) ).


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