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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWV056+1 : TPTP v8.1.2. Bugfixed v3.3.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:13:23 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f26,axiom,
    ! [X22] : n0 = sum(n0,tptp_minus_1,X22),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_plus_base) ).

fof(f28,axiom,
    n0 = succ(tptp_minus_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_tptp_minus_1) ).

fof(f29,axiom,
    ! [X0] : succ(X0) = plus(X0,n1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_r) ).

fof(f30,axiom,
    ! [X0] : succ(X0) = plus(n1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_l) ).

fof(f39,axiom,
    ! [X0] : minus(X0,n1) = pred(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).

fof(f40,axiom,
    ! [X0] : pred(succ(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_succ) ).

fof(f53,conjecture,
    ( ( leq(pv25,minus(n5,n1))
      & leq(n0,pv25) )
   => ( leq(pv25,minus(n5,n1))
      & leq(n0,pv25)
      & n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0040) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(pv25,minus(n5,n1))
        & leq(n0,pv25) )
     => ( leq(pv25,minus(n5,n1))
        & leq(n0,pv25)
        & n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f99,plain,
    ! [X0] : n0 = sum(n0,tptp_minus_1,X0),
    inference(rectify,[],[f26]) ).

fof(f148,plain,
    ( ( ~ leq(pv25,minus(n5,n1))
      | ~ leq(n0,pv25)
      | n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) )
    & leq(pv25,minus(n5,n1))
    & leq(n0,pv25) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f149,plain,
    ( ( ~ leq(pv25,minus(n5,n1))
      | ~ leq(n0,pv25)
      | n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) )
    & leq(pv25,minus(n5,n1))
    & leq(n0,pv25) ),
    inference(flattening,[],[f148]) ).

fof(f293,plain,
    ! [X0] : n0 = sum(n0,tptp_minus_1,X0),
    inference(cnf_transformation,[],[f99]) ).

fof(f295,plain,
    n0 = succ(tptp_minus_1),
    inference(cnf_transformation,[],[f28]) ).

fof(f296,plain,
    ! [X0] : succ(X0) = plus(X0,n1),
    inference(cnf_transformation,[],[f29]) ).

fof(f297,plain,
    ! [X0] : succ(X0) = plus(n1,X0),
    inference(cnf_transformation,[],[f30]) ).

fof(f306,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[],[f39]) ).

fof(f307,plain,
    ! [X0] : pred(succ(X0)) = X0,
    inference(cnf_transformation,[],[f40]) ).

fof(f326,plain,
    leq(n0,pv25),
    inference(cnf_transformation,[],[f149]) ).

fof(f327,plain,
    leq(pv25,minus(n5,n1)),
    inference(cnf_transformation,[],[f149]) ).

fof(f328,plain,
    ( ~ leq(pv25,minus(n5,n1))
    | ~ leq(n0,pv25)
    | n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ),
    inference(cnf_transformation,[],[f149]) ).

fof(f367,plain,
    n0 = plus(tptp_minus_1,n1),
    inference(definition_unfolding,[],[f295,f296]) ).

fof(f368,plain,
    ! [X0] : plus(X0,n1) = plus(n1,X0),
    inference(definition_unfolding,[],[f297,f296]) ).

fof(f377,plain,
    ! [X0] : minus(plus(X0,n1),n1) = X0,
    inference(definition_unfolding,[],[f307,f306,f296]) ).

cnf(c_126,plain,
    sum(n0,tptp_minus_1,X0) = n0,
    inference(cnf_transformation,[],[f293]) ).

cnf(c_128,plain,
    plus(tptp_minus_1,n1) = n0,
    inference(cnf_transformation,[],[f367]) ).

cnf(c_129,plain,
    plus(X0,n1) = plus(n1,X0),
    inference(cnf_transformation,[],[f368]) ).

cnf(c_138,plain,
    minus(plus(X0,n1),n1) = X0,
    inference(cnf_transformation,[],[f377]) ).

cnf(c_157,negated_conjecture,
    ( sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0
    | ~ leq(pv25,minus(n5,n1))
    | ~ leq(n0,pv25) ),
    inference(cnf_transformation,[],[f328]) ).

cnf(c_158,negated_conjecture,
    leq(pv25,minus(n5,n1)),
    inference(cnf_transformation,[],[f327]) ).

cnf(c_159,negated_conjecture,
    leq(n0,pv25),
    inference(cnf_transformation,[],[f326]) ).

cnf(c_282,negated_conjecture,
    sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0,
    inference(global_subsumption_just,[status(thm)],[c_157,c_159,c_158,c_157]) ).

cnf(c_1591,plain,
    plus(n1,tptp_minus_1) = n0,
    inference(demodulation,[status(thm)],[c_128,c_129]) ).

cnf(c_5791,plain,
    minus(n0,n1) = sP0_iProver_def,
    definition ).

cnf(c_5792,plain,
    a_select3(q,pv77,pv25) = sP1_iProver_def,
    definition ).

cnf(c_5793,plain,
    sum(n0,sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
    definition ).

cnf(c_5795,negated_conjecture,
    sP2_iProver_def != n0,
    inference(demodulation,[status(thm)],[c_282,c_5792,c_5791,c_5793]) ).

cnf(c_8691,plain,
    minus(plus(n1,X0),n1) = X0,
    inference(superposition,[status(thm)],[c_129,c_138]) ).

cnf(c_9132,plain,
    minus(n0,n1) = tptp_minus_1,
    inference(superposition,[status(thm)],[c_1591,c_8691]) ).

cnf(c_9142,plain,
    tptp_minus_1 = sP0_iProver_def,
    inference(light_normalisation,[status(thm)],[c_9132,c_5791]) ).

cnf(c_9150,plain,
    sum(n0,sP0_iProver_def,X0) = n0,
    inference(demodulation,[status(thm)],[c_126,c_9142]) ).

cnf(c_9159,plain,
    n0 = sP2_iProver_def,
    inference(demodulation,[status(thm)],[c_5793,c_9150]) ).

cnf(c_9189,plain,
    sP2_iProver_def != sP2_iProver_def,
    inference(demodulation,[status(thm)],[c_5795,c_9159]) ).

cnf(c_9191,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_9189]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14  % Problem  : SWV056+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.05/0.15  % Command  : run_iprover %s %d THM
% 0.14/0.37  % Computer : n008.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit : 300
% 0.14/0.37  % WCLimit  : 300
% 0.14/0.37  % DateTime : Fri May  3 00:09:42 EDT 2024
% 0.14/0.37  % CPUTime  : 
% 0.22/0.51  Running first-order theorem proving
% 0.22/0.51  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.95/1.21  % SZS status Started for theBenchmark.p
% 3.95/1.21  % SZS status Theorem for theBenchmark.p
% 3.95/1.21  
% 3.95/1.21  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.95/1.21  
% 3.95/1.21  ------  iProver source info
% 3.95/1.21  
% 3.95/1.21  git: date: 2024-05-02 19:28:25 +0000
% 3.95/1.21  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.95/1.21  git: non_committed_changes: false
% 3.95/1.21  
% 3.95/1.21  ------ Parsing...
% 3.95/1.21  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.95/1.21  
% 3.95/1.21  ------ Preprocessing... sup_sim: 16  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 3.95/1.21  
% 3.95/1.21  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.95/1.21  
% 3.95/1.21  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.95/1.21  ------ Proving...
% 3.95/1.21  ------ Problem Properties 
% 3.95/1.21  
% 3.95/1.21  
% 3.95/1.21  clauses                                 147
% 3.95/1.21  conjectures                             3
% 3.95/1.21  EPR                                     39
% 3.95/1.21  Horn                                    97
% 3.95/1.21  unary                                   53
% 3.95/1.21  binary                                  34
% 3.95/1.21  lits                                    486
% 3.95/1.21  lits eq                                 118
% 3.95/1.21  fd_pure                                 0
% 3.95/1.21  fd_pseudo                               0
% 3.95/1.21  fd_cond                                 6
% 3.95/1.21  fd_pseudo_cond                          4
% 3.95/1.21  AC symbols                              0
% 3.95/1.21  
% 3.95/1.21  ------ Schedule dynamic 5 is on 
% 3.95/1.21  
% 3.95/1.21  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.95/1.21  
% 3.95/1.21  
% 3.95/1.21  ------ 
% 3.95/1.21  Current options:
% 3.95/1.21  ------ 
% 3.95/1.21  
% 3.95/1.21  
% 3.95/1.21  
% 3.95/1.21  
% 3.95/1.21  ------ Proving...
% 3.95/1.21  
% 3.95/1.21  
% 3.95/1.21  % SZS status Theorem for theBenchmark.p
% 3.95/1.21  
% 3.95/1.21  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.21  
% 3.95/1.21  
%------------------------------------------------------------------------------