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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SYN345-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n006.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:06:33 EDT 2023

% Result   : Unsatisfiable 1.58s 1.17s
% Output   : CNFRefutation 1.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   26 (   1 unt;   8 nHn;  18 RR)
%            Number of literals    :   61 (   0 equ;  32 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    ( ~ f(a,a,b)
    | f(a,b,X0)
    | f(a,b,b) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).

cnf(c_51,negated_conjecture,
    ( ~ f(a,b,b)
    | f(b,X0,X1)
    | f(a,a,b) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

cnf(c_52,negated_conjecture,
    ( ~ f(X0,z(X0,X1),z(X0,X1))
    | ~ f(a,b,b)
    | f(a,a,b) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).

cnf(c_53,negated_conjecture,
    ( f(X0,X1,z(X0,X1))
    | f(a,a,b)
    | f(a,b,b) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(c_54,negated_conjecture,
    ( ~ f(a,a,b)
    | ~ f(a,b,b)
    | f(X0,X1,z(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

cnf(c_55,negated_conjecture,
    ( ~ f(b,b,X0)
    | f(a,a,b)
    | f(a,b,b) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).

cnf(c_56,negated_conjecture,
    ( ~ f(b,b,X0)
    | ~ f(a,a,b)
    | ~ f(a,b,b) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

cnf(c_59,plain,
    ( ~ f(a,a,b)
    | f(a,b,b) ),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_62,plain,
    ( ~ f(a,a,b)
    | ~ f(a,b,b)
    | f(b,b,z(b,b)) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_64,negated_conjecture,
    ( ~ f(b,b,X0)
    | f(a,b,b) ),
    inference(global_subsumption_just,[status(thm)],[c_55,c_55,c_59]) ).

cnf(c_69,negated_conjecture,
    ( f(X0,X1,z(X0,X1))
    | f(a,b,b) ),
    inference(global_subsumption_just,[status(thm)],[c_53,c_59,c_53]) ).

cnf(c_71,plain,
    ( f(b,b,z(b,b))
    | f(a,b,b) ),
    inference(instantiation,[status(thm)],[c_69]) ).

cnf(c_72,plain,
    ( ~ f(a,a,b)
    | ~ f(b,b,X0) ),
    inference(global_subsumption_just,[status(thm)],[c_56,c_59,c_56]) ).

cnf(c_73,negated_conjecture,
    ( ~ f(b,b,X0)
    | ~ f(a,a,b) ),
    inference(renaming,[status(thm)],[c_72]) ).

cnf(c_75,negated_conjecture,
    ( ~ f(a,a,b)
    | f(X0,X1,z(X0,X1)) ),
    inference(global_subsumption_just,[status(thm)],[c_54,c_59,c_54]) ).

cnf(c_77,plain,
    ( ~ f(a,a,b)
    | f(b,b,z(b,b)) ),
    inference(instantiation,[status(thm)],[c_75]) ).

cnf(c_144,negated_conjecture,
    ( ~ f(X0,z(X0,X1),z(X0,X1))
    | ~ sP0_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_52]) ).

cnf(c_145,negated_conjecture,
    ( ~ f(a,b,b)
    | f(a,a,b)
    | sP0_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_52]) ).

cnf(c_146,negated_conjecture,
    ( f(b,X0,X1)
    | ~ sP1_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_51]) ).

cnf(c_147,negated_conjecture,
    ( ~ f(a,b,b)
    | f(a,a,b)
    | sP1_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_51]) ).

cnf(c_149,plain,
    ( ~ f(b,z(b,b),z(b,b))
    | ~ sP0_iProver_split ),
    inference(instantiation,[status(thm)],[c_144]) ).

cnf(c_151,plain,
    ( ~ sP1_iProver_split
    | f(b,z(b,X0),z(b,X0)) ),
    inference(instantiation,[status(thm)],[c_146]) ).

cnf(c_152,plain,
    ( ~ sP1_iProver_split
    | f(b,z(b,b),z(b,b)) ),
    inference(instantiation,[status(thm)],[c_151]) ).

cnf(c_155,plain,
    ( ~ f(b,b,z(b,b))
    | ~ f(a,a,b) ),
    inference(instantiation,[status(thm)],[c_73]) ).

cnf(c_159,plain,
    ( ~ f(b,b,z(b,b))
    | f(a,b,b) ),
    inference(instantiation,[status(thm)],[c_64]) ).

cnf(c_160,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_159,c_155,c_152,c_149,c_147,c_145,c_77,c_71,c_62]) ).


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