↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n007.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:58:32 PM UTC 2026

% Result   : Theorem 1.73s 1.13s
% Output   : CNFRefutation 1.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   62 (  42 unt;   0 typ;   0 def)
%            Number of atoms       :   92 (  35 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   57 (  27   ~;  28   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :  352 (  56 atm; 123 fun;  92 num;  81 var)
%            Number of types       :    1 (   0 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (   2 usr;  12 con; 0-2 aty)
%            Number of variables   :   81 (   0 sgn  81   !;   0   ?;  81   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    b: $int ).

tff(func_def_1,type,
    a: $int ).

tff(f2,conjecture,
    ( $lesseq(1,a)
    | $greatereq(3,$sum(a,$product(-1,$product(2,b))))
    | ( $sum($product(20,a),$product(-1,$product(30,b))) = 7 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_001) ).

tff(f3,negated_conjecture,
    ~ ( $lesseq(1,a)
      | $greatereq(3,$sum(a,$product(-1,$product(2,b))))
      | ( $sum($product(20,a),$product(-1,$product(30,b))) = 7 ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

tff(f5,plain,
    ~ ( ~ $less(a,1)
      | ~ $less(3,$sum(a,$product(-1,$product(2,b))))
      | ( $sum($product(20,a),$product(-1,$product(30,b))) = 7 ) ),
    inference(theory_normalization,[],[f3]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f22,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(f23,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(X1,$sum(X0,1))
      | ~ $less(X0,X1) ),
    introduced(definition,[],[tha_extra_integer_ordering]) ).

tff(f24,plain,
    ( $less(a,1)
    & $less(3,$sum(a,$product(-1,$product(2,b))))
    & ( $sum($product(20,a),$product(-1,$product(30,b))) != 7 ) ),
    inference(ennf_transformation,[],[f5]) ).

tff(f26,plain,
    $less(a,1),
    inference(cnf_transformation,[],[f24]) ).

tff(f27,plain,
    $less(3,$sum(a,$product(-1,$product(2,b)))),
    inference(cnf_transformation,[],[f24]) ).

tff(f28,plain,
    $sum($product(20,a),$product(-1,$product(30,b))) != 7,
    inference(cnf_transformation,[],[f24]) ).

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

tcf(c_51,negated_conjecture,
    ! [X0_int: $int,X1_int: $int,X2_int: $int] : $sum($product(X0_int,X1_int),$product(X0_int,X2_int)) = $product(X0_int,$sum(X1_int,X2_int)),
    inference(cnf_transformation,[],[f21]) ).

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

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

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,[],[f18]) ).

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

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

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,[],[f15]) ).

tcf(c_58,plain,
    ! [X0_int: $int,X1_int: $int,X2_int: $int] :
      ( $less($sum(X0_int,X2_int),$sum(X1_int,X2_int))
      | ~ $less(X0_int,X1_int) ),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_59,negated_conjecture,
    ! [X0_int: $int,X1_int: $int] :
      ( $less(X1_int,X0_int)
      | $less(X0_int,X1_int)
      | ( X0_int = X1_int ) ),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_60,plain,
    ! [X0_int: $int,X1_int: $int,X2_int: $int] :
      ( $less(X0_int,X2_int)
      | ~ $less(X1_int,X2_int)
      | ~ $less(X0_int,X1_int) ),
    inference(cnf_transformation,[],[f12]) ).

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

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

tcf(c_63,negated_conjecture,
    ! [X0_int: $int,X1_int: $int] : $sum($uminus(X0_int),$uminus(X1_int)) = $uminus($sum(X1_int,X0_int)),
    inference(cnf_transformation,[],[f9]) ).

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

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,[],[f7]) ).

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

tcf(c_68,negated_conjecture,
    $sum($product(20,a),$product(-1,$product(30,b))) != 7,
    inference(cnf_transformation,[],[f28]) ).

tcf(c_69,negated_conjecture,
    $less(3,$sum(a,$product(-1,$product(2,b)))),
    inference(cnf_transformation,[],[f27]) ).

tcf(c_70,negated_conjecture,
    $less(a,1),
    inference(cnf_transformation,[],[f26]) ).

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

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

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

tcf(c_74,plain,
    $less(2,3),
    theory(arith) ).

tcf(c_75,plain,
    $less(3,4),
    theory(arith) ).

tcf(c_76,plain,
    $less(4,7),
    theory(arith) ).

tcf(c_77,plain,
    $less(7,8),
    theory(arith) ).

tcf(c_78,plain,
    $less(8,20),
    theory(arith) ).

tcf(c_79,plain,
    $less(20,30),
    theory(arith) ).

tcf(c_96,negated_conjecture,
    $sum($product(a,20),$product(b,$product(-1,30))) != 7,
    inference(theory_normalisation,[status(thm)],[c_68,c_54,c_55,c_65,c_66]) ).

tcf(c_97,negated_conjecture,
    $less(3,$sum(a,$product(b,$product(2,-1)))),
    inference(theory_normalisation,[status(thm)],[c_69,c_54,c_55,c_65,c_66]) ).

tcf(c_98,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_49]) ).

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

tcf(c_100,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_101,plain,
    ! [X0_int: $int,X1_int: $int] :
      ( $less(X1_int,X0_int)
      | $less(X0_int,$sum(X1_int,1)) ),
    inference(renaming,[status(thm)],[c_100]) ).

tcf(c_102,plain,
    ! [X0_int: $int,X1_int: $int,X2_int: $int] :
      ( $less($sum(X0_int,X2_int),$sum(X1_int,X2_int))
      | ~ $less(X0_int,X1_int) ),
    inference(prop_impl_just,[status(thm)],[c_58]) ).

tcf(c_245,plain,
    $false,
    inference(smt_impl_just,[status(thm)],[c_97,c_96,c_79,c_78,c_77,c_76,c_75,c_74,c_73,c_72,c_71,c_70,c_66,c_65,c_64,c_63,c_62,c_61,c_60,c_59,c_102,c_101,c_56,c_55,c_54,c_53,c_52,c_51,c_99]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ARI648_1 : TPTP v9.3.1. Released v6.3.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.33  % Computer : n007.cluster.edu
% 0.08/0.33  % Model    : x86_64 x86_64
% 0.08/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.33  % Memory   : 8046.5625MB
% 0.08/0.33  % OS       : Linux 6.8.0-71-generic
% 0.08/0.33  % CPULimit : 300
% 0.08/0.33  % WCLimit  : 300
% 0.08/0.34  % DateTime : Fri Sep 25 06:17:38 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.08/0.34  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36  Running TFA theorem proving
% 0.08/0.36  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37  
% 0.11/0.37  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.37  
% 0.11/0.38  % Detected problem language: tptp
% 0.11/0.38  % Proving...
% 1.73/1.13  % SZS status Started for theBenchmark.p
% 1.73/1.13  ERROR - "ProverProcess:heur/schedule_none:304.99996185302734" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.73/1.13  Fatal error: exception Failure("undefined enum value")
% 1.73/1.13  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/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_8kvdgkty/ok5rk7dv 2>> /export/starexec/sandbox/tmp/iprover_out_8kvdgkty/ok5rk7dv_error
% 1.73/1.13  % SZS status Theorem for theBenchmark.p
% 1.73/1.13  
% 1.73/1.13  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.73/1.13  
% 1.73/1.13  % ------  iProver source info
% 1.73/1.13  
% 1.73/1.13  % git: date: 2026-07-19 20:42:38 +0200
% 1.73/1.13  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.73/1.13  % git: non_committed_changes: false
% 1.73/1.13  
% 1.73/1.13  % ------ Parsing...
% 1.73/1.13  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.73/1.13  
% 1.73/1.13  % ------ Preprocessing...% 
% 1.73/1.13  
% 1.73/1.13  % SZS status Theorem for theBenchmark.p
% 1.73/1.13  
% 1.73/1.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.73/1.13  
% 1.73/1.13  
%------------------------------------------------------------------------------