↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : ARI178_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 12:57:53 PM UTC 2026

% Result   : Theorem 1.48s 6.28s
% Output   : CNFRefutation 1.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   45 (  31 unt;   0 typ;   0 def)
%            Number of atoms       :   68 (  45 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   35 (  12   ~;  13   |;   8   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :  251 (  22 atm;  99 fun;  59 num;  71 var)
%            Number of types       :    2 (   0 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (   3 usr;   7 con; 0-2 aty)
%            Number of variables   :   71 (   0 sgn  65   !;   6   ?;  71   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_1,type,
    $bool: $tType ).

tff(func_def_7,type,
    sK0: $int ).

tff(func_def_8,type,
    sK1: $int ).

tff(func_def_9,type,
    sK2: $int ).

tff(f1,conjecture,
    ! [X0: $int,X1: $int,X2: $int] :
      ( ( ( $sum($sum(X0,$product(2,X1)),X2) = 10 )
        & ( $sum($sum($product(2,X0),X1),X2) = 10 ) )
     => ( X2 != 0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $int,X1: $int,X2: $int] :
        ( ( ( $sum($sum(X0,$product(2,X1)),X2) = 10 )
          & ( $sum($sum($product(2,X0),X1),X2) = 10 ) )
       => ( X2 != 0 ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f3,plain,
    ! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
    introduced(definition,[],[tha_commutativity]) ).

tff(f4,plain,
    ! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
    introduced(definition,[],[tha_associativity]) ).

tff(f5,plain,
    ! [X0: $int] : ( $sum(X0,0) = X0 ),
    introduced(definition,[],[tha_right_identity]) ).

tff(f6,plain,
    ! [X0: $int,X1: $int] : ( $uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0)) ),
    introduced(definition,[],[tha_inverse_op_op_inverses]) ).

tff(f7,plain,
    ! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
    introduced(definition,[],[tha_inverse_op_unit]) ).

tff(f8,plain,
    ! [X0: $int] : ~ $less(X0,X0),
    introduced(definition,[],[tha_non-reflexivity]) ).

tff(f9,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( $less(X0,X2)
      | ~ $less(X1,X2)
      | ~ $less(X0,X1) ),
    introduced(definition,[],[tha_transitivity]) ).

tff(f10,plain,
    ! [X0: $int,X1: $int] :
      ( ( X0 = X1 )
      | $less(X1,X0)
      | $less(X0,X1) ),
    introduced(definition,[],[tha_order_totality]) ).

tff(f11,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( $less($sum(X0,X2),$sum(X1,X2))
      | ~ $less(X0,X1) ),
    introduced(definition,[],[tha_order_monotonicity]) ).

tff(f12,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X1,$sum(X0,1))
      | $less(X0,X1) ),
    introduced(definition,[],[tha_order_plus_one_dichotomy]) ).

tff(f13,plain,
    ! [X0: $int] : ( $uminus($uminus(X0)) = X0 ),
    introduced(definition,[],[tha_minus_minus_x]) ).

tff(f14,plain,
    ! [X0: $int,X1: $int] : ( $product(X0,X1) = $product(X1,X0) ),
    introduced(definition,[],[tha_commutativity]) ).

tff(f15,plain,
    ! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$product(X1,X2)) = $product($product(X0,X1),X2) ),
    introduced(definition,[],[tha_associativity]) ).

tff(f16,plain,
    ! [X0: $int] : ( $product(X0,1) = X0 ),
    introduced(definition,[],[tha_right_identity]) ).

tff(f17,plain,
    ! [X0: $int] : ( 0 = $product(X0,0) ),
    introduced(definition,[],[tha_times_zero]) ).

tff(f18,plain,
    ! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$sum(X1,X2)) = $sum($product(X0,X1),$product(X0,X2)) ),
    introduced(definition,[],[tha_distributivity]) ).

tff(f19,plain,
    ! [X2: $int,X3: $int,X0: $int,X1: $int] :
      ( ( X2 = X3 )
      | ( $product(X0,X3) != X1 )
      | ( $product(X0,X2) != X1 )
      | ( 0 = X0 ) ),
    introduced(definition,[],[tha_divisibility]) ).

tff(f20,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(X1,$sum(X0,1))
      | ~ $less(X0,X1) ),
    introduced(definition,[],[tha_extra_integer_ordering]) ).

tff(f21,plain,
    ? [X0: $int,X1: $int,X2: $int] :
      ( ( $sum($sum(X0,$product(2,X1)),X2) = 10 )
      & ( $sum($sum($product(2,X0),X1),X2) = 10 )
      & ( 0 = X2 ) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f22,plain,
    ? [X0: $int,X1: $int,X2: $int] :
      ( ( $sum($sum(X0,$product(2,X1)),X2) = 10 )
      & ( $sum($sum($product(2,X0),X1),X2) = 10 )
      & ( 0 = X2 ) ),
    inference(flattening,[],[f21]) ).

tff(f23,plain,
    ( ( 10 = $sum($sum(sK0,$product(2,sK1)),sK2) )
    & ( 10 = $sum($sum($product(2,sK0),sK1),sK2) )
    & ( 0 = sK2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f22]) ).

tff(f24,plain,
    10 = $sum($sum(sK0,$product(2,sK1)),sK2),
    inference(cnf_transformation,[],[f23]) ).

tff(f26,plain,
    0 = sK2,
    inference(cnf_transformation,[],[f23]) ).

tff(f28,plain,
    10 = $sum($sum(sK0,$product(2,sK1)),0),
    inference(definition_unfolding,[],[f24,f26]) ).

tcf(c_52,negated_conjecture,
    ! [X0_int: $int] : $product(X0_int,0) = 0,
    inference(cnf_transformation,[],[f17]) ).

tcf(c_53,negated_conjecture,
    ! [X0_int: $int] : $product(X0_int,1) = X0_int,
    inference(cnf_transformation,[],[f16]) ).

tcf(c_54,negated_conjecture,
    ! [X0_int: $int,X1_int: $int,X2_int: $int] : $product($product(X0_int,X1_int),X2_int) = $product(X0_int,$product(X1_int,X2_int)),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_55,negated_conjecture,
    ! [X0_int: $int,X1_int: $int] : $product(X0_int,X1_int) = $product(X1_int,X0_int),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_56,negated_conjecture,
    ! [X0_int: $int] : $uminus($uminus(X0_int)) = X0_int,
    inference(cnf_transformation,[],[f13]) ).

tcf(c_57,negated_conjecture,
    ! [X0_int: $int,X1_int: $int] :
      ( $less(X1_int,X0_int)
      | $less(X0_int,$sum(X1_int,1)) ),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_61,negated_conjecture,
    ! [X0_int: $int] : ~ $less(X0_int,X0_int),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_62,negated_conjecture,
    ! [X0_int: $int] : $sum(X0_int,$uminus(X0_int)) = 0,
    inference(cnf_transformation,[],[f7]) ).

tcf(c_64,negated_conjecture,
    ! [X0_int: $int] : $sum(X0_int,0) = X0_int,
    inference(cnf_transformation,[],[f5]) ).

tcf(c_65,negated_conjecture,
    ! [X0_int: $int,X1_int: $int,X2_int: $int] : $sum($sum(X0_int,X1_int),X2_int) = $sum(X0_int,$sum(X1_int,X2_int)),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_66,negated_conjecture,
    ! [X0_int: $int,X1_int: $int] : $sum(X0_int,X1_int) = $sum(X1_int,X0_int),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_68,negated_conjecture,
    $sum($sum(sK0,$product(2,sK1)),0) = 10,
    inference(cnf_transformation,[],[f28]) ).

tcf(c_69,plain,
    $less(0,1),
    theory(arith) ).

tcf(c_70,plain,
    $less(1,2),
    theory(arith) ).

tcf(c_71,plain,
    $less(2,10),
    theory(arith) ).

tcf(c_88,negated_conjecture,
    $sum(0,$sum(sK0,$product(sK1,2))) = 10,
    inference(theory_normalisation,[status(thm)],[c_68,c_54,c_55,c_65,c_66]) ).

tcf(c_91,plain,
    ! [X0_int: $int,X1_int: $int] :
      ( $less(X0_int,$sum(X1_int,1))
      | $less(X1_int,X0_int) ),
    inference(prop_impl_just,[status(thm)],[c_57]) ).

tcf(c_92,plain,
    ! [X0_int: $int,X1_int: $int] :
      ( $less(X1_int,X0_int)
      | $less(X0_int,$sum(X1_int,1)) ),
    inference(renaming,[status(thm)],[c_91]) ).

tcf(c_193,plain,
    $false,
    inference(smt_impl_just,[status(thm)],[c_88,c_71,c_70,c_69,c_66,c_64,c_62,c_61,c_92,c_56,c_55,c_53,c_52]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ARI178_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.37  % Computer : n016.cluster.edu
% 0.10/5.37  % Model    : x86_64 x86_64
% 0.10/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37  % Memory   : 8046.5625MB
% 0.10/5.37  % OS       : Linux 6.8.0-71-generic
% 0.10/5.37  % CPULimit : 300
% 0.10/5.37  % WCLimit  : 300
% 0.10/5.37  % DateTime : Fri Sep 25 06:08:05 UTC 2026
% 0.10/5.37  % CPUTime  : 
% 0.10/5.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.40  Running TFA theorem proving
% 0.15/5.40  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.41  
% 0.15/5.41  % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.41  
% 0.15/5.41  % Detected problem language: tptp
% 0.15/5.42  % Proving...
% 1.48/6.28  % SZS status Started for theBenchmark.p
% 1.48/6.28  ERROR - "ProverProcess:heur/schedule_none:304.99997448921204" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.48/6.28  Fatal error: exception Failure("undefined enum value")
% 1.48/6.28  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --schedule none --sub_typing false --suppress_sat_res true --tptp_safe_out true --stats_out none --out_options none --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify   -t 101.67 --show_fool true" --time_out_real 305.00 /export/starexec/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_eebpix83/e9naw2vz 2>> /export/starexec/sandbox2/tmp/iprover_out_eebpix83/e9naw2vz_error
% 1.48/6.28  % SZS status Theorem for theBenchmark.p
% 1.48/6.28  
% 1.48/6.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.48/6.28  
% 1.48/6.28  % ------  iProver source info
% 1.48/6.28  
% 1.48/6.28  % git: date: 2026-07-19 20:42:38 +0200
% 1.48/6.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.48/6.28  % git: non_committed_changes: false
% 1.48/6.28  
% 1.48/6.28  % ------ Parsing...
% 1.48/6.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.48/6.28  
% 1.48/6.28  % ------ Preprocessing...% 
% 1.48/6.28  
% 1.48/6.28  % SZS status Theorem for theBenchmark.p
% 1.48/6.28  
% 1.48/6.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.48/6.28  
% 1.48/6.28  
%------------------------------------------------------------------------------