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

View Problem - Process Solution

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

% Computer : n018.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:21 EDT 2024

% Result   : Theorem 0.44s 1.13s
% Output   : CNFRefutation 0.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   6 unt;   0 def)
%            Number of atoms       :   26 (   8 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   21 (   5   ~;   0   |;  14   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  12 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

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

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

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

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

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

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

fof(f337,plain,
    ~ true,
    inference(cnf_transformation,[],[f155]) ).

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

cnf(c_158,negated_conjecture,
    ~ true,
    inference(cnf_transformation,[],[f337]) ).

cnf(c_202,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_158,c_156]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem  : SWV047+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.10/0.11  % Command  : run_iprover %s %d THM
% 0.10/0.32  % Computer : n018.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Fri May  3 00:38:46 EDT 2024
% 0.10/0.32  % CPUTime  : 
% 0.17/0.43  Running first-order theorem proving
% 0.17/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
% 0.44/1.13  % SZS status Started for theBenchmark.p
% 0.44/1.13  % SZS status Theorem for theBenchmark.p
% 0.44/1.13  
% 0.44/1.13  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.44/1.13  
% 0.44/1.13  ------  iProver source info
% 0.44/1.13  
% 0.44/1.13  git: date: 2024-05-02 19:28:25 +0000
% 0.44/1.13  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.44/1.13  git: non_committed_changes: false
% 0.44/1.13  
% 0.44/1.13  ------ Parsing...
% 0.44/1.13  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.44/1.13  
% 0.44/1.13  ------ Preprocessing...
% 0.44/1.13  
% 0.44/1.13  % SZS status Theorem for theBenchmark.p
% 0.44/1.13  
% 0.44/1.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.13  
% 0.44/1.13  
%------------------------------------------------------------------------------