↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n019.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:41 PM UTC 2026

% Result   : Unsatisfiable 5.76s 2.27s
% Output   : CNFRefutation 5.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   43 (  23 unt;   0 def)
%            Number of atoms       :   63 (  37 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   37 (  17   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 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    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn  58   !;   0   ?;  33   :)

% Comments : 
%------------------------------------------------------------------------------
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(f104,axiom,
    ! [X2,X3,X0,X1] :
      ( member(X1,universal_class)
      | ~ member(ordered_pair(X0,X1),cross_product(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_2_to_cartesian_product) ).

fof(f120,axiom,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).

fof(f124,axiom,
    ! [X0,X1] :
      ( unordered_pair(X0,X1) = singleton(X1)
      | member(X0,universal_class) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_equals_singleton2) ).

fof(f138,axiom,
    ! [X0] :
      ( singleton(X0) = null_class
      | member(X0,universal_class) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_is_null_class) ).

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

fof(f178,axiom,
    ! [X0] :
      ( second(X0) = X0
      | ordered_pair(first(X0),second(X0)) = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_5) ).

fof(f191,negated_conjecture,
    ~ member(y,universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_OP_determines_components2_1) ).

fof(f192,negated_conjecture,
    second(ordered_pair(x,y)) != ordered_pair(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_OP_determines_components2_2) ).

fof(f193,plain,
    ordered_pair(x,y) != second(ordered_pair(x,y)),
    inference(reorient_equations,[],[f192]) ).

fof(f194,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(f195,plain,
    unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))) != second(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))),
    inference(definition_unfolding,[],[f193,f194,f194]) ).

fof(f200,plain,
    ! [X2,X3,X0,X1] :
      ( member(X1,universal_class)
      | ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3)) ),
    inference(definition_unfolding,[],[f104,f194]) ).

fof(f212,plain,
    ! [X0] :
      ( second(X0) = X0
      | unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0 ),
    inference(definition_unfolding,[],[f178,f194]) ).

fof(f214,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,f194]) ).

fof(f222,plain,
    ! [X0] :
      ( unordered_pair(X0,X0) = null_class
      | member(X0,universal_class) ),
    inference(definition_unfolding,[],[f138,f12]) ).

fof(f243,plain,
    ! [X0,X1] :
      ( unordered_pair(X0,X1) = unordered_pair(X1,X1)
      | member(X0,universal_class) ),
    inference(definition_unfolding,[],[f124,f12]) ).

tcf(c_218,negated_conjecture,
    ~ member(y,universal_class),
    inference(cnf_transformation,[],[f191]) ).

tcf(c_219,negated_conjecture,
    second(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))) != unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),
    inference(cnf_transformation,[],[f195]) ).

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

tcf(c_236,plain,
    ! [X0: $i] :
      ( ( second(X0) = X0 )
      | ( unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0 ) ),
    inference(cnf_transformation,[],[f212]) ).

tcf(c_238,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,[],[f214]) ).

tcf(c_246,plain,
    ! [X0: $i] :
      ( member(X0,universal_class)
      | ( unordered_pair(X0,X0) = null_class ) ),
    inference(cnf_transformation,[],[f222]) ).

tcf(c_283,plain,
    ! [X0: $i,X1: $i] :
      ( member(X1,universal_class)
      | ( unordered_pair(X0,X0) = unordered_pair(X1,X0) ) ),
    inference(cnf_transformation,[],[f243]) ).

tcf(c_285,plain,
    ! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[],[f120]) ).

tcf(c_2155,plain,
    unordered_pair(y,y) = null_class,
    inference(superposition,[status(thm)],[c_246,c_218]) ).

tcf(c_2156,plain,
    second(unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class))) != unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class)),
    inference(demodulation,[status(thm)],[c_219,c_2155]) ).

tcf(c_2163,plain,
    second(unordered_pair(unordered_pair(null_class,x),unordered_pair(x,x))) != unordered_pair(unordered_pair(null_class,x),unordered_pair(x,x)),
    inference(demodulation,[status(thm)],[c_2156,c_285]) ).

tcf(c_2327,plain,
    ! [X0: $i] : unordered_pair(X0,X0) = unordered_pair(y,X0),
    inference(superposition,[status(thm)],[c_283,c_218]) ).

tcf(c_2328,plain,
    ! [X0: $i] :
      ( ( second(X0) = X0 )
      | ( unordered_pair(unordered_pair(y,first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0 ) ),
    inference(demodulation,[status(thm)],[c_236,c_2327]) ).

tcf(c_2330,plain,
    second(unordered_pair(unordered_pair(null_class,x),unordered_pair(y,x))) != unordered_pair(unordered_pair(null_class,x),unordered_pair(y,x)),
    inference(demodulation,[status(thm)],[c_2163,c_2327]) ).

tcf(c_2362,plain,
    ! [X0: $i] : unordered_pair(X0,X0) = unordered_pair(X0,y),
    inference(superposition,[status(thm)],[c_2327,c_285]) ).

tcf(c_2711,plain,
    ! [X0: $i] :
      ( ( second(X0) = X0 )
      | ( unordered_pair(unordered_pair(y,first(X0)),unordered_pair(first(X0),unordered_pair(y,second(X0)))) = X0 ) ),
    inference(demodulation,[status(thm)],[c_2328,c_285,c_2362]) ).

tcf(c_3101,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( member(y,universal_class)
      | ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,null_class)),cross_product(X1,X2)) ),
    inference(superposition,[status(thm)],[c_2155,c_224]) ).

tcf(c_3102,plain,
    ! [X0: $i,X1: $i,X2: $i] : ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,null_class)),cross_product(X1,X2)),
    inference(forward_subsumption_resolution,[status(thm)],[c_3101,c_218]) ).

tcf(c_3414,plain,
    ! [X0: $i,X1: $i,X2: $i] : ~ member(unordered_pair(unordered_pair(X0,null_class),unordered_pair(X0,X0)),cross_product(X1,X2)),
    inference(superposition,[status(thm)],[c_285,c_3102]) ).

tcf(c_3461,plain,
    ! [X0: $i,X1: $i,X2: $i] : ~ member(unordered_pair(unordered_pair(X0,null_class),unordered_pair(y,X0)),cross_product(X1,X2)),
    inference(superposition,[status(thm)],[c_2327,c_3414]) ).

tcf(c_3890,plain,
    ! [X0: $i,X1: $i,X2: $i] : ~ member(unordered_pair(unordered_pair(null_class,X0),unordered_pair(y,X0)),cross_product(X1,X2)),
    inference(superposition,[status(thm)],[c_285,c_3461]) ).

tcf(c_4913,plain,
    ! [X0: $i] :
      ( member(unordered_pair(unordered_pair(y,first(X0)),unordered_pair(first(X0),unordered_pair(y,second(X0)))),cross_product(universal_class,universal_class))
      | ( second(X0) = X0 ) ),
    inference(demodulation,[status(thm)],[c_238,c_285,c_2362]) ).

tcf(c_4921,plain,
    ! [X0: $i] :
      ( member(X0,cross_product(universal_class,universal_class))
      | ( second(X0) = X0 ) ),
    inference(superposition,[status(thm)],[c_2711,c_4913]) ).

tcf(c_11589,plain,
    ! [X0: $i] : second(unordered_pair(unordered_pair(null_class,X0),unordered_pair(y,X0))) = unordered_pair(unordered_pair(null_class,X0),unordered_pair(y,X0)),
    inference(superposition,[status(thm)],[c_4921,c_3890]) ).

tcf(c_11600,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_2330,c_11589]) ).


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