TSTP Solution File: SET113-7 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SET113-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 02:59:57 EDT 2024

% Result   : Unsatisfiable 3.83s 1.11s
% Output   : CNFRefutation 3.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    8 (   5 unt;   3 nHn;   6 RR)
%            Number of literals    :   11 (   5 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :    2 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_111,plain,
    ( first(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_2) ).

cnf(c_112,plain,
    ( 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) ).

cnf(c_117,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_sets1_1) ).

cnf(c_118,negated_conjecture,
    first(x) != x,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_in_pair_of_non_sets) ).

cnf(c_7178,plain,
    second(x) = x,
    inference(superposition,[status(thm)],[c_112,c_117]) ).

cnf(c_7180,plain,
    ~ member(ordered_pair(first(x),x),cross_product(universal_class,universal_class)),
    inference(demodulation,[status(thm)],[c_117,c_7178]) ).

cnf(c_7701,plain,
    ( first(x) = x
    | member(ordered_pair(first(x),x),cross_product(universal_class,universal_class)) ),
    inference(superposition,[status(thm)],[c_7178,c_111]) ).

cnf(c_7705,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_7701,c_7180,c_118]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : SET113-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.06/0.11  % Command  : run_iprover %s %d THM
% 0.11/0.31  % Computer : n005.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 300
% 0.11/0.31  % DateTime : Thu May  2 20:36:26 EDT 2024
% 0.11/0.31  % CPUTime  : 
% 0.17/0.41  Running first-order theorem proving
% 0.17/0.41  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.83/1.11  % SZS status Started for theBenchmark.p
% 3.83/1.11  % SZS status Unsatisfiable for theBenchmark.p
% 3.83/1.11  
% 3.83/1.11  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.83/1.11  
% 3.83/1.11  ------  iProver source info
% 3.83/1.11  
% 3.83/1.11  git: date: 2024-05-02 19:28:25 +0000
% 3.83/1.11  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.83/1.11  git: non_committed_changes: false
% 3.83/1.11  
% 3.83/1.11  ------ Parsing...successful
% 3.83/1.11  
% 3.83/1.11  
% 3.83/1.11  
% 3.83/1.11  ------ Preprocessing... sup_sim: 2  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e 
% 3.83/1.11  
% 3.83/1.11  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.83/1.11  
% 3.83/1.11  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.83/1.11  ------ Proving...
% 3.83/1.11  ------ Problem Properties 
% 3.83/1.11  
% 3.83/1.11  
% 3.83/1.11  clauses                                 151
% 3.83/1.11  conjectures                             2
% 3.83/1.11  EPR                                     17
% 3.83/1.11  Horn                                    120
% 3.83/1.11  unary                                   47
% 3.83/1.11  binary                                  64
% 3.83/1.11  lits                                    302
% 3.83/1.11  lits eq                                 99
% 3.83/1.11  fd_pure                                 0
% 3.83/1.11  fd_pseudo                               0
% 3.83/1.11  fd_cond                                 5
% 3.83/1.11  fd_pseudo_cond                          16
% 3.83/1.11  AC symbols                              0
% 3.83/1.11  
% 3.83/1.11  ------ Input Options Time Limit: Unbounded
% 3.83/1.11  
% 3.83/1.11  
% 3.83/1.11  ------ 
% 3.83/1.11  Current options:
% 3.83/1.11  ------ 
% 3.83/1.11  
% 3.83/1.11  
% 3.83/1.11  
% 3.83/1.11  
% 3.83/1.11  ------ Proving...
% 3.83/1.11  
% 3.83/1.11  
% 3.83/1.11  % SZS status Unsatisfiable for theBenchmark.p
% 3.83/1.11  
% 3.83/1.11  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.83/1.11  
% 3.83/1.11  
%------------------------------------------------------------------------------