TSTP Solution File: SYN013-1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SYN013-1 : TPTP v8.1.2. Released v1.0.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 Sep  1 03:04:42 EDT 2023

% Result   : Unsatisfiable 1.78s 1.17s
% Output   : CNFRefutation 1.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   32
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   55 (  10 unt;  41 nHn;  53 RR)
%            Number of literals    :  182 ( 117 equ;  39 neg)
%            Maximal clause size   :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    m != n,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_1) ).

cnf(c_50,negated_conjecture,
    n != k,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_2) ).

cnf(c_51,negated_conjecture,
    m != k,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_3) ).

cnf(c_52,negated_conjecture,
    ( f(X0) != m
    | ~ element(X0,m)
    | X0 = m ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_4) ).

cnf(c_53,negated_conjecture,
    ( f(X0) != X0
    | ~ element(X0,m)
    | X0 = m ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_5) ).

cnf(c_54,negated_conjecture,
    ( ~ element(X0,m)
    | X0 = m
    | element(X0,f(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_6) ).

cnf(c_55,negated_conjecture,
    ( ~ element(X0,m)
    | X0 = m
    | element(f(X0),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_7) ).

cnf(c_56,negated_conjecture,
    ( ~ element(X0,X1)
    | ~ element(X1,X0)
    | X0 = X1
    | X0 = m
    | X1 = m
    | element(X0,m) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_8) ).

cnf(c_58,negated_conjecture,
    ( g(X0) != X0
    | X0 = n
    | element(X0,n) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_10) ).

cnf(c_59,negated_conjecture,
    ( X0 = n
    | element(X0,g(X0))
    | element(X0,n) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_11) ).

cnf(c_60,negated_conjecture,
    ( X0 = n
    | element(g(X0),X0)
    | element(X0,n) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_12) ).

cnf(c_61,negated_conjecture,
    ( ~ element(X0,X1)
    | ~ element(X1,X0)
    | ~ element(X0,n)
    | X0 = X1
    | X0 = n
    | X1 = n ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_13) ).

cnf(c_62,negated_conjecture,
    ( X0 != m
    | X0 = k
    | element(X0,k) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_14) ).

cnf(c_63,negated_conjecture,
    ( X0 != n
    | X0 = k
    | element(X0,k) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_15) ).

cnf(c_64,negated_conjecture,
    ( ~ element(X0,k)
    | X0 = m
    | X0 = n
    | X0 = k ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).

cnf(c_65,negated_conjecture,
    ( n = k
    | element(n,k) ),
    inference(unflattening,[status(thm)],[c_63]) ).

cnf(c_66,negated_conjecture,
    ( m = k
    | element(m,k) ),
    inference(unflattening,[status(thm)],[c_62]) ).

cnf(c_76,negated_conjecture,
    element(n,k),
    inference(global_subsumption_just,[status(thm)],[c_65,c_50,c_65]) ).

cnf(c_78,negated_conjecture,
    element(m,k),
    inference(global_subsumption_just,[status(thm)],[c_66,c_51,c_66]) ).

cnf(c_524,plain,
    ( ~ element(k,m)
    | f(k) = m
    | f(k) = n
    | f(k) = k
    | m = k ),
    inference(superposition,[status(thm)],[c_55,c_64]) ).

cnf(c_525,plain,
    ( g(k) = m
    | g(k) = n
    | g(k) = k
    | n = k
    | element(k,n) ),
    inference(superposition,[status(thm)],[c_60,c_64]) ).

cnf(c_528,plain,
    ( g(k) = m
    | g(k) = n
    | g(k) = k
    | element(k,n) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_525,c_50]) ).

cnf(c_533,plain,
    ( ~ element(k,m)
    | f(k) = m
    | f(k) = n
    | f(k) = k ),
    inference(forward_subsumption_resolution,[status(thm)],[c_524,c_51]) ).

cnf(c_572,plain,
    ( ~ element(n,k)
    | g(k) = m
    | g(k) = n
    | g(k) = k
    | m = n
    | m = k
    | n = k
    | element(k,m) ),
    inference(superposition,[status(thm)],[c_528,c_56]) ).

cnf(c_596,plain,
    ( g(k) = m
    | g(k) = n
    | g(k) = k
    | element(k,m) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_572,c_50,c_51,c_49,c_76]) ).

cnf(c_665,plain,
    ( ~ element(m,k)
    | ~ element(k,n)
    | g(k) = m
    | g(k) = n
    | g(k) = k
    | m = n
    | m = k
    | n = k ),
    inference(superposition,[status(thm)],[c_596,c_61]) ).

cnf(c_674,plain,
    ( ~ element(k,n)
    | g(k) = m
    | g(k) = n
    | g(k) = k ),
    inference(forward_subsumption_resolution,[status(thm)],[c_665,c_50,c_51,c_49,c_78]) ).

cnf(c_679,plain,
    ( g(k) = m
    | g(k) = n
    | g(k) = k ),
    inference(global_subsumption_just,[status(thm)],[c_674,c_528,c_674]) ).

cnf(c_687,plain,
    ( g(k) = m
    | g(k) = n
    | n = k
    | element(k,n) ),
    inference(superposition,[status(thm)],[c_679,c_58]) ).

cnf(c_691,plain,
    ( g(k) = m
    | g(k) = n
    | element(k,n) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_687,c_50]) ).

cnf(c_703,plain,
    ( ~ element(n,k)
    | g(k) = m
    | g(k) = n
    | m = n
    | m = k
    | n = k
    | element(k,m) ),
    inference(superposition,[status(thm)],[c_691,c_56]) ).

cnf(c_708,plain,
    ( g(k) = m
    | g(k) = n
    | element(k,m) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_703,c_50,c_51,c_49,c_76]) ).

cnf(c_718,plain,
    ( ~ element(m,k)
    | ~ element(k,n)
    | g(k) = m
    | g(k) = n
    | m = n
    | m = k
    | n = k ),
    inference(superposition,[status(thm)],[c_708,c_61]) ).

cnf(c_726,plain,
    ( ~ element(k,n)
    | g(k) = m
    | g(k) = n ),
    inference(forward_subsumption_resolution,[status(thm)],[c_718,c_50,c_51,c_49,c_78]) ).

cnf(c_730,plain,
    ( g(k) = m
    | g(k) = n ),
    inference(global_subsumption_just,[status(thm)],[c_726,c_691,c_726]) ).

cnf(c_739,plain,
    ( g(k) = m
    | n = k
    | element(k,n) ),
    inference(superposition,[status(thm)],[c_730,c_59]) ).

cnf(c_740,plain,
    ( g(k) = m
    | element(k,n) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_739,c_50]) ).

cnf(c_749,plain,
    ( ~ element(n,k)
    | g(k) = m
    | m = n
    | m = k
    | n = k
    | element(k,m) ),
    inference(superposition,[status(thm)],[c_740,c_56]) ).

cnf(c_753,plain,
    ( g(k) = m
    | element(k,m) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_749,c_50,c_51,c_49,c_76]) ).

cnf(c_760,plain,
    ( ~ element(m,k)
    | ~ element(k,n)
    | g(k) = m
    | m = n
    | m = k
    | n = k ),
    inference(superposition,[status(thm)],[c_753,c_61]) ).

cnf(c_767,plain,
    ( ~ element(k,n)
    | g(k) = m ),
    inference(forward_subsumption_resolution,[status(thm)],[c_760,c_50,c_51,c_49,c_78]) ).

cnf(c_770,plain,
    g(k) = m,
    inference(global_subsumption_just,[status(thm)],[c_767,c_740,c_767]) ).

cnf(c_775,plain,
    ( n = k
    | element(k,m)
    | element(k,n) ),
    inference(superposition,[status(thm)],[c_770,c_59]) ).

cnf(c_776,plain,
    ( element(k,m)
    | element(k,n) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_775,c_50]) ).

cnf(c_784,plain,
    ( ~ element(n,k)
    | m = n
    | m = k
    | n = k
    | element(k,m) ),
    inference(superposition,[status(thm)],[c_776,c_56]) ).

cnf(c_788,plain,
    element(k,m),
    inference(forward_subsumption_resolution,[status(thm)],[c_784,c_50,c_51,c_49,c_76]) ).

cnf(c_790,plain,
    ( f(k) = m
    | f(k) = n
    | f(k) = k ),
    inference(backward_subsumption_resolution,[status(thm)],[c_533,c_788]) ).

cnf(c_794,plain,
    ( ~ element(m,k)
    | ~ element(k,n)
    | m = n
    | m = k
    | n = k ),
    inference(superposition,[status(thm)],[c_788,c_61]) ).

cnf(c_796,plain,
    ~ element(k,n),
    inference(forward_subsumption_resolution,[status(thm)],[c_794,c_50,c_51,c_49,c_78]) ).

cnf(c_960,plain,
    ( ~ element(k,m)
    | f(k) = m
    | f(k) = n
    | m = k ),
    inference(superposition,[status(thm)],[c_790,c_53]) ).

cnf(c_964,plain,
    ( f(k) = m
    | f(k) = n ),
    inference(forward_subsumption_resolution,[status(thm)],[c_960,c_51,c_788]) ).

cnf(c_976,plain,
    ( ~ element(k,m)
    | f(k) = m
    | m = k
    | element(k,n) ),
    inference(superposition,[status(thm)],[c_964,c_54]) ).

cnf(c_977,plain,
    f(k) = m,
    inference(forward_subsumption_resolution,[status(thm)],[c_976,c_796,c_51,c_788]) ).

cnf(c_982,plain,
    ( ~ element(k,m)
    | m = k ),
    inference(superposition,[status(thm)],[c_977,c_52]) ).

cnf(c_984,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_982,c_51,c_788]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN013-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Sat Aug 26 18:07:08 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.78/1.17  % SZS status Started for theBenchmark.p
% 1.78/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 1.78/1.17  
% 1.78/1.17  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.78/1.17  
% 1.78/1.17  ------  iProver source info
% 1.78/1.17  
% 1.78/1.17  git: date: 2023-05-31 18:12:56 +0000
% 1.78/1.17  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.78/1.17  git: non_committed_changes: false
% 1.78/1.17  git: last_make_outside_of_git: false
% 1.78/1.17  
% 1.78/1.17  ------ Parsing...successful
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 1.78/1.17  
% 1.78/1.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.78/1.17  
% 1.78/1.17  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.78/1.17  ------ Proving...
% 1.78/1.17  ------ Problem Properties 
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  clauses                                 16
% 1.78/1.17  conjectures                             16
% 1.78/1.17  EPR                                     8
% 1.78/1.17  Horn                                    7
% 1.78/1.17  unary                                   5
% 1.78/1.17  binary                                  0
% 1.78/1.17  lits                                    45
% 1.78/1.17  lits eq                                 24
% 1.78/1.17  fd_pure                                 0
% 1.78/1.17  fd_pseudo                               0
% 1.78/1.17  fd_cond                                 9
% 1.78/1.17  fd_pseudo_cond                          2
% 1.78/1.17  AC symbols                              0
% 1.78/1.17  
% 1.78/1.17  ------ Schedule dynamic 5 is on 
% 1.78/1.17  
% 1.78/1.17  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  ------ 
% 1.78/1.17  Current options:
% 1.78/1.17  ------ 
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  ------ Proving...
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 1.78/1.17  
% 1.78/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.78/1.17  
% 1.78/1.17  
%------------------------------------------------------------------------------