TSTP Solution File: SYN208-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SYN208-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n008.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 03:29:39 EDT 2024

% Result   : Unsatisfiable 3.65s 1.19s
% Output   : CNFRefutation 3.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   41 (  15 unt;   1 nHn;  38 RR)
%            Number of literals    :   89 (   0 equ;  50 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   16 (  15 usr;   3 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   27 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    ~ s3(d,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_50,plain,
    s0(d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).

cnf(c_52,plain,
    n0(d,e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_3) ).

cnf(c_56,plain,
    n0(d,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_7) ).

cnf(c_63,plain,
    p0(b,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

cnf(c_68,plain,
    m0(X0,d,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).

cnf(c_70,plain,
    q0(b,e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_21) ).

cnf(c_74,plain,
    q0(d,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_25) ).

cnf(c_81,plain,
    k0(b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).

cnf(c_85,plain,
    q0(a,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_36) ).

cnf(c_86,plain,
    n0(b,a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).

cnf(c_88,plain,
    ( ~ n0(X0,X1)
    | k1(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).

cnf(c_121,plain,
    ( ~ q0(X0,X0)
    | ~ k1(X1)
    | ~ k1(a)
    | m1(X0,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_034) ).

cnf(c_147,plain,
    ( ~ m1(d,e,e)
    | ~ q0(b,e)
    | ~ k0(b)
    | n1(d,d,b) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_060) ).

cnf(c_212,plain,
    ( ~ p0(X0,X0)
    | s1(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).

cnf(c_213,plain,
    ( ~ q0(X0,X1)
    | ~ s1(X2)
    | s1(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).

cnf(c_266,plain,
    ( ~ n1(X0,X0,X1)
    | ~ k1(X1)
    | q2(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_179) ).

cnf(c_277,plain,
    ( ~ s0(d)
    | ~ s1(a)
    | s2(d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_190) ).

cnf(c_360,plain,
    ( ~ m0(X0,X1,X2)
    | ~ q2(X0,X3,X0)
    | ~ s2(X3)
    | s3(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_273) ).

cnf(c_419,plain,
    p0(b,b),
    inference(instantiation,[status(thm)],[c_63]) ).

cnf(c_427,plain,
    ( ~ p0(b,b)
    | s1(b) ),
    inference(instantiation,[status(thm)],[c_212]) ).

cnf(c_605,plain,
    ( ~ s1(a)
    | s2(d) ),
    inference(global_subsumption_just,[status(thm)],[c_277,c_50,c_277]) ).

cnf(c_705,plain,
    ( ~ m1(d,e,e)
    | n1(d,d,b) ),
    inference(global_subsumption_just,[status(thm)],[c_147,c_81,c_70,c_147]) ).

cnf(c_733,plain,
    ( ~ s1(X0)
    | ~ sP8_iProver_def ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP8_iProver_def])],[c_213]) ).

cnf(c_734,plain,
    ( ~ q0(X0,X1)
    | s1(X0)
    | ~ sP9_iProver_def ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP9_iProver_def])],[c_213]) ).

cnf(c_735,plain,
    ( sP8_iProver_def
    | sP9_iProver_def ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_213]) ).

cnf(c_785,plain,
    ( ~ s1(b)
    | ~ sP8_iProver_def ),
    inference(instantiation,[status(thm)],[c_733]) ).

cnf(c_827,plain,
    ( ~ q2(X0,X1,X0)
    | ~ m0(X0,d,X2)
    | ~ s2(X1)
    | s3(X1,X2) ),
    inference(instantiation,[status(thm)],[c_360]) ).

cnf(c_842,plain,
    ( ~ n0(d,e)
    | k1(e) ),
    inference(instantiation,[status(thm)],[c_88]) ).

cnf(c_843,plain,
    ( ~ n0(d,b)
    | k1(b) ),
    inference(instantiation,[status(thm)],[c_88]) ).

cnf(c_849,plain,
    ( ~ n0(b,a)
    | k1(a) ),
    inference(instantiation,[status(thm)],[c_88]) ).

cnf(c_862,plain,
    ( ~ q0(a,X0)
    | ~ sP9_iProver_def
    | s1(a) ),
    inference(instantiation,[status(thm)],[c_734]) ).

cnf(c_863,plain,
    ( ~ q0(a,b)
    | ~ sP9_iProver_def
    | s1(a) ),
    inference(instantiation,[status(thm)],[c_862]) ).

cnf(c_892,plain,
    m0(d,d,X0),
    inference(instantiation,[status(thm)],[c_68]) ).

cnf(c_894,plain,
    m0(d,d,b),
    inference(instantiation,[status(thm)],[c_892]) ).

cnf(c_1069,plain,
    ( ~ q0(d,d)
    | ~ k1(e)
    | ~ k1(a)
    | m1(d,e,e) ),
    inference(instantiation,[status(thm)],[c_121]) ).

cnf(c_1071,plain,
    ( ~ q2(X0,d,X0)
    | ~ m0(X0,d,b)
    | ~ s2(d)
    | s3(d,b) ),
    inference(instantiation,[status(thm)],[c_827]) ).

cnf(c_1126,plain,
    ( ~ m0(d,d,b)
    | ~ q2(d,d,d)
    | ~ s2(d)
    | s3(d,b) ),
    inference(instantiation,[status(thm)],[c_1071]) ).

cnf(c_1141,plain,
    ( ~ n1(d,d,X0)
    | ~ k1(X0)
    | q2(d,d,d) ),
    inference(instantiation,[status(thm)],[c_266]) ).

cnf(c_1144,plain,
    ( ~ n1(d,d,b)
    | ~ k1(b)
    | q2(d,d,d) ),
    inference(instantiation,[status(thm)],[c_1141]) ).

cnf(c_1145,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1144,c_1126,c_1069,c_894,c_863,c_849,c_843,c_842,c_785,c_735,c_705,c_605,c_427,c_49,c_52,c_56,c_419,c_74,c_85,c_86]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN208-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  2 21:05:43 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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.65/1.19  % SZS status Started for theBenchmark.p
% 3.65/1.19  % SZS status Unsatisfiable for theBenchmark.p
% 3.65/1.19  
% 3.65/1.19  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.65/1.19  
% 3.65/1.19  ------  iProver source info
% 3.65/1.19  
% 3.65/1.19  git: date: 2024-05-02 19:28:25 +0000
% 3.65/1.19  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.65/1.19  git: non_committed_changes: false
% 3.65/1.19  
% 3.65/1.19  ------ Parsing...successful
% 3.65/1.19  
% 3.65/1.19  ------  preprocesses with Option_epr_horn
% 3.65/1.19  
% 3.65/1.19  
% 3.65/1.19  ------ Preprocessing... sf_s  rm: 187 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.65/1.19  
% 3.65/1.19  ------ Preprocessing...------  preprocesses with Option_epr_horn
% 3.65/1.19   gs_s  sp: 46 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.65/1.19  ------ Proving...
% 3.65/1.19  ------ Problem Properties 
% 3.65/1.19  
% 3.65/1.19  
% 3.65/1.19  clauses                                 194
% 3.65/1.19  conjectures                             1
% 3.65/1.19  EPR                                     194
% 3.65/1.19  Horn                                    171
% 3.65/1.19  unary                                   50
% 3.65/1.19  binary                                  70
% 3.65/1.19  lits                                    440
% 3.65/1.19  lits eq                                 0
% 3.65/1.19  fd_pure                                 0
% 3.65/1.19  fd_pseudo                               0
% 3.65/1.19  fd_cond                                 0
% 3.65/1.19  fd_pseudo_cond                          0
% 3.65/1.19  AC symbols                              0
% 3.65/1.19  
% 3.65/1.19  ------ Schedule EPR non Horn non eq is on
% 3.65/1.19  
% 3.65/1.19  ------ no equalities: superposition off 
% 3.65/1.19  
% 3.65/1.19  ------ Input Options "--resolution_flag false" Time Limit: 70.
% 3.65/1.19  
% 3.65/1.19  
% 3.65/1.19  ------ 
% 3.65/1.19  Current options:
% 3.65/1.19  ------ 
% 3.65/1.19  
% 3.65/1.19  
% 3.65/1.19  
% 3.65/1.19  
% 3.65/1.19  ------ Proving...
% 3.65/1.19  
% 3.65/1.19  
% 3.65/1.19  % SZS status Unsatisfiable for theBenchmark.p
% 3.65/1.19  
% 3.65/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/1.19  
% 3.65/1.19  
%------------------------------------------------------------------------------