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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWV048+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n022.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:22 EDT 2024

% Result   : Theorem 7.49s 1.63s
% Output   : CNFRefutation 7.49s
% 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/sandbox/benchmark/theBenchmark.p',sum_plus_base) ).

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

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

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

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

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

fof(f51,axiom,
    true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ttrue) ).

fof(f53,conjecture,
    ( ( leq(pv35,minus(n5,n1))
      & leq(n0,pv35)
      & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
   => ( ( n0 = pv78
       => true )
      & ( n0 != pv78
       => ( leq(pv35,minus(n5,n1))
          & leq(n0,pv35)
          & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          & n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0016) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(pv35,minus(n5,n1))
        & leq(n0,pv35)
        & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
     => ( ( n0 = pv78
         => true )
        & ( n0 != pv78
         => ( leq(pv35,minus(n5,n1))
            & leq(n0,pv35)
            & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
            & n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
    inference(negated_conjecture,[],[f53]) ).

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

fof(f154,plain,
    ( ( ( ~ true
        & n0 = pv78 )
      | ( ( ~ leq(pv35,minus(n5,n1))
          | ~ leq(n0,pv35)
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) )
        & n0 != pv78 ) )
    & leq(pv35,minus(n5,n1))
    & leq(n0,pv35)
    & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f155,plain,
    ( ( ( ~ true
        & n0 = pv78 )
      | ( ( ~ leq(pv35,minus(n5,n1))
          | ~ leq(n0,pv35)
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) )
        & n0 != pv78 ) )
    & leq(pv35,minus(n5,n1))
    & leq(n0,pv35)
    & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
    inference(flattening,[],[f154]) ).

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

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

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

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

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

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

fof(f331,plain,
    true,
    inference(cnf_transformation,[],[f51]) ).

fof(f333,plain,
    pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
    inference(cnf_transformation,[],[f155]) ).

fof(f334,plain,
    leq(n0,pv35),
    inference(cnf_transformation,[],[f155]) ).

fof(f335,plain,
    leq(pv35,minus(n5,n1)),
    inference(cnf_transformation,[],[f155]) ).

fof(f337,plain,
    ( n0 = pv78
    | ~ leq(pv35,minus(n5,n1))
    | ~ leq(n0,pv35)
    | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
    inference(cnf_transformation,[],[f155]) ).

fof(f339,plain,
    ( ~ true
    | ~ leq(pv35,minus(n5,n1))
    | ~ leq(n0,pv35)
    | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
    inference(cnf_transformation,[],[f155]) ).

fof(f385,plain,
    n0 = plus(tptp_minus_1,n1),
    inference(definition_unfolding,[],[f301,f302]) ).

fof(f386,plain,
    ! [X0] : plus(X0,n1) = plus(n1,X0),
    inference(definition_unfolding,[],[f303,f302]) ).

fof(f395,plain,
    ! [X0] : minus(plus(X0,n1),n1) = X0,
    inference(definition_unfolding,[],[f313,f312,f302]) ).

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

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

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

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

cnf(c_156,plain,
    true,
    inference(cnf_transformation,[],[f331]) ).

cnf(c_158,negated_conjecture,
    ( sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0
    | sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78
    | ~ leq(pv35,minus(n5,n1))
    | ~ leq(n0,pv35)
    | ~ true ),
    inference(cnf_transformation,[],[f339]) ).

cnf(c_160,negated_conjecture,
    ( sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0
    | sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78
    | ~ leq(pv35,minus(n5,n1))
    | ~ leq(n0,pv35)
    | n0 = pv78 ),
    inference(cnf_transformation,[],[f337]) ).

cnf(c_161,negated_conjecture,
    leq(pv35,minus(n5,n1)),
    inference(cnf_transformation,[],[f335]) ).

cnf(c_162,negated_conjecture,
    leq(n0,pv35),
    inference(cnf_transformation,[],[f334]) ).

cnf(c_163,negated_conjecture,
    sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) = pv78,
    inference(cnf_transformation,[],[f333]) ).

cnf(c_297,negated_conjecture,
    sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0,
    inference(global_subsumption_just,[status(thm)],[c_160,c_156,c_162,c_161,c_163,c_158]) ).

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

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

cnf(c_11245,plain,
    a_select3(q,pv81,pv35) = sP1_iProver_def,
    definition ).

cnf(c_11246,plain,
    a_select2(x,pv81) = sP2_iProver_def,
    definition ).

cnf(c_11247,plain,
    times(sP1_iProver_def,sP2_iProver_def) = sP3_iProver_def,
    definition ).

cnf(c_11248,plain,
    sum(n0,sP0_iProver_def,sP3_iProver_def) = sP4_iProver_def,
    definition ).

cnf(c_11253,negated_conjecture,
    sP4_iProver_def != n0,
    inference(demodulation,[status(thm)],[c_297,c_11246,c_11245,c_11247,c_11244,c_11248]) ).

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

cnf(c_16394,plain,
    minus(n0,n1) = tptp_minus_1,
    inference(superposition,[status(thm)],[c_1636,c_14282]) ).

cnf(c_16407,plain,
    tptp_minus_1 = sP0_iProver_def,
    inference(light_normalisation,[status(thm)],[c_16394,c_11244]) ).

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

cnf(c_16426,plain,
    n0 = sP4_iProver_def,
    inference(demodulation,[status(thm)],[c_11248,c_16418]) ).

cnf(c_16476,plain,
    sP4_iProver_def != sP4_iProver_def,
    inference(demodulation,[status(thm)],[c_11253,c_16426]) ).

cnf(c_16478,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_16476]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWV048+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.09/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.32  % Computer : n022.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Fri May  3 00:25:57 EDT 2024
% 0.12/0.32  % CPUTime  : 
% 0.18/0.43  Running first-order theorem proving
% 0.18/0.43  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.49/1.63  % SZS status Started for theBenchmark.p
% 7.49/1.63  % SZS status Theorem for theBenchmark.p
% 7.49/1.63  
% 7.49/1.63  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.49/1.63  
% 7.49/1.63  ------  iProver source info
% 7.49/1.63  
% 7.49/1.63  git: date: 2024-05-02 19:28:25 +0000
% 7.49/1.63  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.49/1.63  git: non_committed_changes: false
% 7.49/1.63  
% 7.49/1.63  ------ Parsing...
% 7.49/1.63  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 7.49/1.63  
% 7.49/1.63  ------ Preprocessing... sup_sim: 16  sf_s  rm: 2 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 7.49/1.63  
% 7.49/1.63  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.49/1.63  
% 7.49/1.63  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 7.49/1.63  ------ Proving...
% 7.49/1.63  ------ Problem Properties 
% 7.49/1.63  
% 7.49/1.63  
% 7.49/1.63  clauses                                 161
% 7.49/1.63  conjectures                             5
% 7.49/1.63  EPR                                     48
% 7.49/1.63  Horn                                    111
% 7.49/1.63  unary                                   67
% 7.49/1.63  binary                                  34
% 7.49/1.63  lits                                    500
% 7.49/1.63  lits eq                                 125
% 7.49/1.63  fd_pure                                 0
% 7.49/1.63  fd_pseudo                               0
% 7.49/1.63  fd_cond                                 6
% 7.49/1.63  fd_pseudo_cond                          4
% 7.49/1.63  AC symbols                              0
% 7.49/1.63  
% 7.49/1.63  ------ Schedule dynamic 5 is on 
% 7.49/1.63  
% 7.49/1.63  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.49/1.63  
% 7.49/1.63  
% 7.49/1.63  ------ 
% 7.49/1.63  Current options:
% 7.49/1.63  ------ 
% 7.49/1.63  
% 7.49/1.63  
% 7.49/1.63  
% 7.49/1.63  
% 7.49/1.63  ------ Proving...
% 7.49/1.63  
% 7.49/1.63  
% 7.49/1.63  % SZS status Theorem for theBenchmark.p
% 7.49/1.63  
% 7.49/1.63  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.49/1.63  
% 7.49/1.64  
%------------------------------------------------------------------------------