TSTP Solution File: GEO498+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : GEO498+1 : TPTP v8.1.2. Released v7.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 May  3 02:17:41 EDT 2024

% Result   : Theorem 3.92s 1.17s
% Output   : CNFRefutation 3.92s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
fof(f99,axiom,
    ! [X11,X12] : s(X11,s(X11,X12)) = X12,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_7) ).

fof(f100,conjecture,
    ! [X11,X12,X26,X15] :
      ( X12 = X15
      | s(X11,X15) != X26
      | s(X11,X12) != X26 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_8) ).

fof(f101,negated_conjecture,
    ~ ! [X11,X12,X26,X15] :
        ( X12 = X15
        | s(X11,X15) != X26
        | s(X11,X12) != X26 ),
    inference(negated_conjecture,[],[f100]) ).

fof(f202,plain,
    ! [X0,X1] : s(X0,s(X0,X1)) = X1,
    inference(rectify,[],[f99]) ).

fof(f203,plain,
    ~ ! [X0,X1,X2,X3] :
        ( X1 = X3
        | s(X0,X3) != X2
        | s(X0,X1) != X2 ),
    inference(rectify,[],[f101]) ).

fof(f214,plain,
    ? [X0,X1,X2,X3] :
      ( X1 != X3
      & s(X0,X3) = X2
      & s(X0,X1) = X2 ),
    inference(ennf_transformation,[],[f203]) ).

fof(f215,plain,
    ( ? [X0,X1,X2,X3] :
        ( X1 != X3
        & s(X0,X3) = X2
        & s(X0,X1) = X2 )
   => ( sK1 != sK3
      & sK2 = s(sK0,sK3)
      & sK2 = s(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f216,plain,
    ( sK1 != sK3
    & sK2 = s(sK0,sK3)
    & sK2 = s(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f214,f215]) ).

fof(f329,plain,
    ! [X0,X1] : s(X0,s(X0,X1)) = X1,
    inference(cnf_transformation,[],[f202]) ).

fof(f330,plain,
    sK2 = s(sK0,sK1),
    inference(cnf_transformation,[],[f216]) ).

fof(f331,plain,
    sK2 = s(sK0,sK3),
    inference(cnf_transformation,[],[f216]) ).

fof(f332,plain,
    sK1 != sK3,
    inference(cnf_transformation,[],[f216]) ).

cnf(c_161,plain,
    s(X0,s(X0,X1)) = X1,
    inference(cnf_transformation,[],[f329]) ).

cnf(c_162,negated_conjecture,
    sK1 != sK3,
    inference(cnf_transformation,[],[f332]) ).

cnf(c_163,negated_conjecture,
    s(sK0,sK3) = sK2,
    inference(cnf_transformation,[],[f331]) ).

cnf(c_164,negated_conjecture,
    s(sK0,sK1) = sK2,
    inference(cnf_transformation,[],[f330]) ).

cnf(c_3829,plain,
    s(sK0,sK1) = sP0_iProver_def,
    definition ).

cnf(c_3830,plain,
    s(sK0,sK3) = sP1_iProver_def,
    definition ).

cnf(c_3831,negated_conjecture,
    sP0_iProver_def = sK2,
    inference(demodulation,[status(thm)],[c_164,c_3829]) ).

cnf(c_3832,negated_conjecture,
    sP1_iProver_def = sK2,
    inference(demodulation,[status(thm)],[c_163,c_3830]) ).

cnf(c_3833,negated_conjecture,
    sK1 != sK3,
    inference(demodulation,[status(thm)],[c_162]) ).

cnf(c_5395,plain,
    sP0_iProver_def = sP1_iProver_def,
    inference(light_normalisation,[status(thm)],[c_3832,c_3831]) ).

cnf(c_5397,plain,
    s(sK0,sK3) = sP0_iProver_def,
    inference(light_normalisation,[status(thm)],[c_3830,c_5395]) ).

cnf(c_5399,plain,
    s(sK0,sP0_iProver_def) = sK3,
    inference(superposition,[status(thm)],[c_5397,c_161]) ).

cnf(c_5400,plain,
    s(sK0,sP0_iProver_def) = sK1,
    inference(superposition,[status(thm)],[c_3829,c_161]) ).

cnf(c_5413,plain,
    sK1 = sK3,
    inference(demodulation,[status(thm)],[c_5399,c_5400]) ).

cnf(c_5414,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_5413,c_3833]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : GEO498+1 : TPTP v8.1.2. Released v7.0.0.
% 0.11/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n005.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Fri May  3 01:23:56 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/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.92/1.17  % SZS status Started for theBenchmark.p
% 3.92/1.17  % SZS status Theorem for theBenchmark.p
% 3.92/1.17  
% 3.92/1.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.92/1.17  
% 3.92/1.17  ------  iProver source info
% 3.92/1.17  
% 3.92/1.17  git: date: 2024-05-02 19:28:25 +0000
% 3.92/1.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.92/1.17  git: non_committed_changes: false
% 3.92/1.17  
% 3.92/1.17  ------ Parsing...
% 3.92/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.92/1.17  
% 3.92/1.17  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 3.92/1.17  
% 3.92/1.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.92/1.17  
% 3.92/1.17  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.92/1.17  ------ Proving...
% 3.92/1.17  ------ Problem Properties 
% 3.92/1.17  
% 3.92/1.17  
% 3.92/1.17  clauses                                 126
% 3.92/1.17  conjectures                             3
% 3.92/1.17  EPR                                     100
% 3.92/1.17  Horn                                    99
% 3.92/1.17  unary                                   28
% 3.92/1.17  binary                                  39
% 3.92/1.17  lits                                    353
% 3.92/1.17  lits eq                                 61
% 3.92/1.17  fd_pure                                 0
% 3.92/1.17  fd_pseudo                               0
% 3.92/1.17  fd_cond                                 0
% 3.92/1.17  fd_pseudo_cond                          31
% 3.92/1.17  AC symbols                              0
% 3.92/1.17  
% 3.92/1.17  ------ Schedule dynamic 5 is on 
% 3.92/1.17  
% 3.92/1.17  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.92/1.17  
% 3.92/1.17  
% 3.92/1.17  ------ 
% 3.92/1.17  Current options:
% 3.92/1.17  ------ 
% 3.92/1.17  
% 3.92/1.17  
% 3.92/1.17  
% 3.92/1.17  
% 3.92/1.17  ------ Proving...
% 3.92/1.17  
% 3.92/1.17  
% 3.92/1.17  % SZS status Theorem for theBenchmark.p
% 3.92/1.17  
% 3.92/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.92/1.17  
% 3.92/1.17  
%------------------------------------------------------------------------------