↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n008.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:39 PM UTC 2026

% Result   : Unsatisfiable 4.36s 1.31s
% Output   : CNFRefutation 4.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (  10 unt;   0 def)
%            Number of atoms       :   18 (  10 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   10 (   6   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn   8   !;   0   ?;   1   :)

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

fof(f176,axiom,
    ! [X0] :
      ( second(X0) = X0
      | member(ordered_pair(first(X0),second(X0)),cross_product(universal_class,universal_class)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_1st_and_2nd_3) ).

fof(f181,negated_conjecture,
    ~ member(ordered_pair(first(x),second(x)),cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_non_sets2_1) ).

fof(f182,negated_conjecture,
    second(x) != x,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_2nd_in_pair_of_non_sets) ).

fof(f183,plain,
    x != second(x),
    inference(reorient_equations,[],[f182]) ).

fof(f184,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(f185,plain,
    ~ member(unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))),cross_product(universal_class,universal_class)),
    inference(definition_unfolding,[],[f181,f184]) ).

fof(f207,plain,
    ! [X0] :
      ( second(X0) = X0
      | member(unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))),cross_product(universal_class,universal_class)) ),
    inference(definition_unfolding,[],[f176,f184]) ).

tcf(c_210,negated_conjecture,
    ~ member(unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))),cross_product(universal_class,universal_class)),
    inference(cnf_transformation,[],[f185]) ).

tcf(c_211,negated_conjecture,
    second(x) != x,
    inference(cnf_transformation,[],[f183]) ).

tcf(c_233,plain,
    ! [X0: $i] :
      ( member(unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))),cross_product(universal_class,universal_class))
      | ( second(X0) = X0 ) ),
    inference(cnf_transformation,[],[f207]) ).

tcf(c_3111,plain,
    ( member(unordered_pair(unordered_pair(first(x),first(x)),unordered_pair(first(x),unordered_pair(second(x),second(x)))),cross_product(universal_class,universal_class))
    | ( second(x) = x ) ),
    inference(instantiation,[status(thm)],[c_233]) ).

tcf(c_3112,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_3111,c_210,c_211]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SET114-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.43  % Computer : n008.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Thu Sep 24 09:54:09 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.50  Running first-order theorem proving
% 0.17/0.50  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.27/0.51  
% 0.27/0.51  % ======== iProver multi-core TPTP/SMT =========
% 0.27/0.51  
% 0.27/0.51  % Detected problem language: tptp
% 0.27/0.53  % Proving...
% 4.36/1.31  % SZS status Started for theBenchmark.p
% 4.36/1.31  % SZS status Unsatisfiable for theBenchmark.p
% 4.36/1.31  
% 4.36/1.31  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.36/1.31  
% 4.36/1.31  % ------  iProver source info
% 4.36/1.31  
% 4.36/1.31  % git: date: 2026-07-19 20:42:38 +0200
% 4.36/1.31  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.36/1.31  % git: non_committed_changes: false
% 4.36/1.31  
% 4.36/1.31  % ------ Parsing...% successful
% 4.36/1.31  
% 4.36/1.31  
% 4.36/1.31  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 4.36/1.31  
% 4.36/1.31  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 4.36/1.31  
% 4.36/1.31  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.36/1.31  
% 4.36/1.31  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.36/1.31  % ------ Proving...
% 4.36/1.31  % ------ Problem Properties 
% 4.36/1.31  
% 4.36/1.31  % 
% 4.36/1.31  % clauses                               58
% 4.36/1.31  % conjectures                           2
% 4.36/1.31  % EPR                                   9
% 4.36/1.31  % Horn                                  44
% 4.36/1.31  % unary                                 15
% 4.36/1.31  % binary                                26
% 4.36/1.31  % lits                                  119
% 4.36/1.31  % lits eq                               43
% 4.36/1.31  % fd_pure                               0
% 4.36/1.31  % fd_pseudo                             0
% 4.36/1.31  % fd_cond                               1
% 4.36/1.31  % fd_pseudo_cond                        11
% 4.36/1.31  % AC symbols                            0
% 4.36/1.31  
% 4.36/1.31  % ------ Schedule dynamic 5 is on 
% 4.36/1.31  
% 4.36/1.31  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.36/1.31  
% 4.36/1.31  
% 4.36/1.31  % ------ 
% 4.36/1.31  % Current options:
% 4.36/1.31  % ------ 
% 4.36/1.31  
% 4.36/1.31  
% 4.36/1.31  % 
% 4.36/1.31  
% 4.36/1.31  % ------ Proving...
% 4.36/1.31  % 
% 4.36/1.31  
% 4.36/1.31  % SZS status Unsatisfiable for theBenchmark.p
% 4.36/1.31  
% 4.36/1.31  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.36/1.31  
% 4.36/1.31  
%------------------------------------------------------------------------------