TSTP Solution File: SET020-3 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SET020-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n025.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 : Thu Aug 31 15:05:36 EDT 2023

% Result   : Unsatisfiable 213.46s 28.88s
% Output   : CNFRefutation 213.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   32 (   7 unt;   2 nHn;  30 RR)
%            Number of literals    :   88 (  37 equ;  53 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   39 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    ( ordered_pair(X0,X1) != ordered_pair(X2,X3)
    | ~ little_set(X0)
    | ~ little_set(X2)
    | X0 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',first_components_are_equal) ).

cnf(c_53,plain,
    little_set(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_little_set) ).

cnf(c_54,plain,
    little_set(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_little_set) ).

cnf(c_55,negated_conjecture,
    first(ordered_pair(a,b)) != a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_first_is_first) ).

cnf(c_58,plain,
    ( X0 = X1
    | member(f1(X0,X1),X0)
    | member(f1(X0,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality2) ).

cnf(c_59,plain,
    ( ~ member(f1(X0,X1),X0)
    | ~ member(f1(X0,X1),X1)
    | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality3) ).

cnf(c_70,plain,
    ( ~ member(X0,first(X1))
    | little_set(f4(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',first1) ).

cnf(c_72,plain,
    ( ~ member(X0,first(X1))
    | ordered_pair(f4(X0,X1),f5(X0,X1)) = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',first3) ).

cnf(c_73,plain,
    ( ~ member(X0,first(X1))
    | member(X0,f4(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',first4) ).

cnf(c_74,plain,
    ( ordered_pair(X0,X1) != X2
    | ~ member(X3,X0)
    | ~ little_set(X0)
    | ~ little_set(X1)
    | member(X3,first(X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',first5) ).

cnf(c_205,plain,
    ( ~ member(X0,X1)
    | ~ little_set(X1)
    | ~ little_set(X2)
    | member(X0,first(ordered_pair(X1,X2))) ),
    inference(unflattening,[status(thm)],[c_74]) ).

cnf(c_7798,plain,
    X0 = X0,
    theory(equality) ).

cnf(c_7800,plain,
    ( X0 != X1
    | X2 != X1
    | X2 = X0 ),
    theory(equality) ).

cnf(c_7806,plain,
    ( X0 != X1
    | X2 != X3
    | ~ member(X1,X3)
    | member(X0,X2) ),
    theory(equality) ).

cnf(c_9713,plain,
    ( first(ordered_pair(a,b)) = a
    | member(f1(first(ordered_pair(a,b)),a),first(ordered_pair(a,b)))
    | member(f1(first(ordered_pair(a,b)),a),a) ),
    inference(instantiation,[status(thm)],[c_58]) ).

cnf(c_10556,plain,
    ( ~ member(f1(first(ordered_pair(a,b)),a),first(ordered_pair(a,b)))
    | ordered_pair(f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b)),f5(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b))) = ordered_pair(a,b) ),
    inference(instantiation,[status(thm)],[c_72]) ).

cnf(c_10557,plain,
    ( ~ member(f1(first(ordered_pair(a,b)),a),first(ordered_pair(a,b)))
    | member(f1(first(ordered_pair(a,b)),a),f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b))) ),
    inference(instantiation,[status(thm)],[c_73]) ).

cnf(c_10559,plain,
    ( ~ member(f1(first(ordered_pair(a,b)),a),first(ordered_pair(a,b)))
    | little_set(f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b))) ),
    inference(instantiation,[status(thm)],[c_70]) ).

cnf(c_10603,plain,
    ( X0 != X1
    | a != X1
    | a = X0 ),
    inference(instantiation,[status(thm)],[c_7800]) ).

cnf(c_11197,plain,
    ( ~ member(f1(first(ordered_pair(a,b)),a),a)
    | ~ little_set(X0)
    | ~ little_set(a)
    | member(f1(first(ordered_pair(a,b)),a),first(ordered_pair(a,X0))) ),
    inference(instantiation,[status(thm)],[c_205]) ).

cnf(c_11201,plain,
    ( ~ member(f1(first(ordered_pair(a,b)),a),first(ordered_pair(a,b)))
    | ~ member(f1(first(ordered_pair(a,b)),a),a)
    | first(ordered_pair(a,b)) = a ),
    inference(instantiation,[status(thm)],[c_59]) ).

cnf(c_16667,plain,
    ( X0 != f1(first(ordered_pair(a,b)),a)
    | X1 != f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b))
    | ~ member(f1(first(ordered_pair(a,b)),a),f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b)))
    | member(X0,X1) ),
    inference(instantiation,[status(thm)],[c_7806]) ).

cnf(c_17847,plain,
    ( ~ member(f1(first(ordered_pair(a,b)),a),a)
    | ~ little_set(a)
    | ~ little_set(b)
    | member(f1(first(ordered_pair(a,b)),a),first(ordered_pair(a,b))) ),
    inference(instantiation,[status(thm)],[c_11197]) ).

cnf(c_18491,plain,
    ( X0 != a
    | a != a
    | a = X0 ),
    inference(instantiation,[status(thm)],[c_10603]) ).

cnf(c_18492,plain,
    a = a,
    inference(instantiation,[status(thm)],[c_7798]) ).

cnf(c_18509,plain,
    ( ordered_pair(X0,X1) != ordered_pair(a,X2)
    | ~ little_set(X0)
    | ~ little_set(a)
    | X0 = a ),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_25557,plain,
    f1(first(ordered_pair(a,b)),a) = f1(first(ordered_pair(a,b)),a),
    inference(instantiation,[status(thm)],[c_7798]) ).

cnf(c_68745,plain,
    ( X0 != f1(first(ordered_pair(a,b)),a)
    | a != f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b))
    | ~ member(f1(first(ordered_pair(a,b)),a),f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b)))
    | member(X0,a) ),
    inference(instantiation,[status(thm)],[c_16667]) ).

cnf(c_68747,plain,
    ( f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b)) != a
    | a != a
    | a = f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b)) ),
    inference(instantiation,[status(thm)],[c_18491]) ).

cnf(c_102660,plain,
    ( f1(first(ordered_pair(a,b)),a) != f1(first(ordered_pair(a,b)),a)
    | a != f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b))
    | ~ member(f1(first(ordered_pair(a,b)),a),f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b)))
    | member(f1(first(ordered_pair(a,b)),a),a) ),
    inference(instantiation,[status(thm)],[c_68745]) ).

cnf(c_127214,plain,
    ( ordered_pair(f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b)),f5(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b))) != ordered_pair(a,b)
    | ~ little_set(f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b)))
    | ~ little_set(a)
    | f4(f1(first(ordered_pair(a,b)),a),ordered_pair(a,b)) = a ),
    inference(instantiation,[status(thm)],[c_18509]) ).

cnf(c_127215,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_127214,c_102660,c_68747,c_25557,c_18492,c_17847,c_11201,c_10556,c_10557,c_10559,c_9713,c_55,c_53,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET020-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n025.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Sat Aug 26 16:21:08 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 213.46/28.88  % SZS status Started for theBenchmark.p
% 213.46/28.88  % SZS status Unsatisfiable for theBenchmark.p
% 213.46/28.88  
% 213.46/28.88  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 213.46/28.88  
% 213.46/28.88  ------  iProver source info
% 213.46/28.88  
% 213.46/28.88  git: date: 2023-05-31 18:12:56 +0000
% 213.46/28.88  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 213.46/28.88  git: non_committed_changes: false
% 213.46/28.88  git: last_make_outside_of_git: false
% 213.46/28.88  
% 213.46/28.88  ------ Parsing...successful
% 213.46/28.88  
% 213.46/28.88  
% 213.46/28.88  
% 213.46/28.88  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 213.46/28.88  
% 213.46/28.88  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 213.46/28.88  
% 213.46/28.88  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 213.46/28.88  ------ Proving...
% 213.46/28.88  ------ Problem Properties 
% 213.46/28.88  
% 213.46/28.88  
% 213.46/28.88  clauses                                 142
% 213.46/28.88  conjectures                             1
% 213.46/28.88  EPR                                     23
% 213.46/28.88  Horn                                    123
% 213.46/28.88  unary                                   14
% 213.46/28.88  binary                                  89
% 213.46/28.88  lits                                    348
% 213.46/28.88  lits eq                                 40
% 213.46/28.88  fd_pure                                 0
% 213.46/28.88  fd_pseudo                               0
% 213.46/28.88  fd_cond                                 4
% 213.46/28.88  fd_pseudo_cond                          10
% 213.46/28.88  AC symbols                              0
% 213.46/28.88  
% 213.46/28.88  ------ Input Options Time Limit: Unbounded
% 213.46/28.88  
% 213.46/28.88  
% 213.46/28.88  ------ 
% 213.46/28.88  Current options:
% 213.46/28.88  ------ 
% 213.46/28.88  
% 213.46/28.88  
% 213.46/28.88  
% 213.46/28.88  
% 213.46/28.88  ------ Proving...
% 213.46/28.88  
% 213.46/28.88  
% 213.46/28.88  % SZS status Unsatisfiable for theBenchmark.p
% 213.46/28.88  
% 213.46/28.88  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 213.46/28.88  
% 213.46/28.88  
%------------------------------------------------------------------------------