↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n003.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 02:27:12 PM UTC 2026

% Result   : Theorem 1.66s 1.31s
% Output   : CNFRefutation 1.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   35 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :   74 (  53 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   58 (  19   ~;  25   |;  10   &)
%                                         (   3 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :  183 (  20 atm;  97 fun;   6 num;  60 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    :    8 (   3 usr;   5 con; 0-2 aty)
%            Number of variables   :   60 (   0 sgn  51   !;   9   ?;  60   :)

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

tff(func_def_5,type,
    sK0: $rat ).

tff(func_def_6,type,
    sK1: $rat ).

tff(func_def_7,type,
    sK2: $rat ).

tff(f1,conjecture,
    ! [X0: $rat,X1: $rat,X2: $rat] :
      ( ( $sum(X0,X1) = X2 )
    <=> ( ( $difference(X2,X0) = X1 )
        & ( $difference(X2,X1) = X0 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rat_combined_problem_2) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $rat,X1: $rat,X2: $rat] :
        ( ( $sum(X0,X1) = X2 )
      <=> ( ( $difference(X2,X0) = X1 )
          & ( $difference(X2,X1) = X0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f3,plain,
    ~ ! [X0: $rat,X1: $rat,X2: $rat] :
        ( ( $sum(X0,X1) = X2 )
      <=> ( ( $sum(X2,$uminus(X0)) = X1 )
          & ( $sum(X2,$uminus(X1)) = X0 ) ) ),
    inference(theory_normalization,[],[f2]) ).

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

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

tff(f6,plain,
    ! [X0: $rat] : ( $sum(X0,0/1) = X0 ),
    introduced(definition,[],[tha_right_identity]) ).

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

tff(f8,plain,
    ! [X0: $rat] : ( 0/1 = $sum(X0,$uminus(X0)) ),
    introduced(definition,[],[tha_inverse_op_unit]) ).

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

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

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

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

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

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

tff(f15,plain,
    ? [X0: $rat,X1: $rat,X2: $rat] :
      ( ( $sum(X0,X1) = X2 )
    <~> ( ( $sum(X2,$uminus(X0)) = X1 )
        & ( $sum(X2,$uminus(X1)) = X0 ) ) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f16,plain,
    ? [X0: $rat,X1: $rat,X2: $rat] :
      ( ( ( $sum(X0,X1) = X2 )
        | ( ( $sum(X2,$uminus(X0)) = X1 )
          & ( $sum(X2,$uminus(X1)) = X0 ) ) )
      & ( ( $sum(X0,X1) != X2 )
        | ( $sum(X2,$uminus(X0)) != X1 )
        | ( $sum(X2,$uminus(X1)) != X0 ) ) ),
    inference(nnf_transformation,[],[f15]) ).

tff(f17,plain,
    ? [X0: $rat,X1: $rat,X2: $rat] :
      ( ( ( $sum(X0,X1) = X2 )
        | ( ( $sum(X2,$uminus(X0)) = X1 )
          & ( $sum(X2,$uminus(X1)) = X0 ) ) )
      & ( ( $sum(X0,X1) != X2 )
        | ( $sum(X2,$uminus(X0)) != X1 )
        | ( $sum(X2,$uminus(X1)) != X0 ) ) ),
    inference(flattening,[],[f16]) ).

tff(f18,plain,
    ( ( ( sK2 = $sum(sK0,sK1) )
      | ( ( sK1 = $sum(sK2,$uminus(sK0)) )
        & ( sK0 = $sum(sK2,$uminus(sK1)) ) ) )
    & ( ( sK2 != $sum(sK0,sK1) )
      | ( sK1 != $sum(sK2,$uminus(sK0)) )
      | ( sK0 != $sum(sK2,$uminus(sK1)) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f17]) ).

tff(f19,plain,
    ( ( sK2 = $sum(sK0,sK1) )
    | ( sK1 = $sum(sK2,$uminus(sK0)) ) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f20,plain,
    ( ( sK2 = $sum(sK0,sK1) )
    | ( sK0 = $sum(sK2,$uminus(sK1)) ) ),
    inference(cnf_transformation,[],[f18]) ).

tcf(c_49,negated_conjecture,
    ! [X0_rat: $rat] : $uminus($uminus(X0_rat)) = X0_rat,
    inference(cnf_transformation,[],[f14]) ).

tcf(c_50,negated_conjecture,
    ! [X0_rat: $rat,X1_rat: $rat] :
      ( $less(X1_rat,X0_rat)
      | $less(X0_rat,$sum(X1_rat,1/1)) ),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_51,plain,
    ! [X0_rat: $rat,X1_rat: $rat,X2_rat: $rat] :
      ( $less($sum(X0_rat,X2_rat),$sum(X1_rat,X2_rat))
      | ~ $less(X0_rat,X1_rat) ),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_52,negated_conjecture,
    ! [X0_rat: $rat,X1_rat: $rat] :
      ( $less(X1_rat,X0_rat)
      | $less(X0_rat,X1_rat)
      | ( X0_rat = X1_rat ) ),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_53,plain,
    ! [X0_rat: $rat,X1_rat: $rat,X2_rat: $rat] :
      ( $less(X0_rat,X2_rat)
      | ~ $less(X1_rat,X2_rat)
      | ~ $less(X0_rat,X1_rat) ),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_54,negated_conjecture,
    ! [X0_rat: $rat] : ~ $less(X0_rat,X0_rat),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_55,negated_conjecture,
    ! [X0_rat: $rat] : $sum(X0_rat,$uminus(X0_rat)) = 0/1,
    inference(cnf_transformation,[],[f8]) ).

tcf(c_56,negated_conjecture,
    ! [X0_rat: $rat,X1_rat: $rat] : $sum($uminus(X0_rat),$uminus(X1_rat)) = $uminus($sum(X1_rat,X0_rat)),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_57,negated_conjecture,
    ! [X0_rat: $rat] : $sum(X0_rat,0/1) = X0_rat,
    inference(cnf_transformation,[],[f6]) ).

tcf(c_58,negated_conjecture,
    ! [X0_rat: $rat,X1_rat: $rat,X2_rat: $rat] : $sum($sum(X0_rat,X1_rat),X2_rat) = $sum(X0_rat,$sum(X1_rat,X2_rat)),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_59,negated_conjecture,
    ! [X0_rat: $rat,X1_rat: $rat] : $sum(X0_rat,X1_rat) = $sum(X1_rat,X0_rat),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_61,negated_conjecture,
    ( ( $sum(sK0,sK1) = sK2 )
    | ( $sum(sK2,$uminus(sK1)) = sK0 ) ),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_62,negated_conjecture,
    ( ( $sum(sK0,sK1) = sK2 )
    | ( $sum(sK2,$uminus(sK0)) = sK1 ) ),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_132,plain,
    $sum(sK0,sK1) = sK2,
    inference(global_subsumption_just,[status(thm)],[c_61]) ).

tcf(c_137,plain,
    $false,
    inference(smt_impl_just,[status(thm)],[c_132,c_62,c_59,c_58,c_57,c_56,c_55,c_54,c_53,c_52,c_51,c_50,c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM907_1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38  % Computer : n003.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Thu Sep 24 05:40:35 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42  Running TFA theorem proving
% 0.11/0.42  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.43  
% 0.11/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43  
% 0.11/0.44  % Detected problem language: tptp
% 0.11/0.45  % Proving...
% 1.66/1.31  % SZS status Started for theBenchmark.p
% 1.66/1.31  ERROR - "ProverProcess:heur/schedule_none:304.99997568130493" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.66/1.31  Fatal error: exception Failure("undefined enum value")
% 1.66/1.31  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_8c8kni2h/sst816rz 2>> /export/starexec/sandbox/tmp/iprover_out_8c8kni2h/sst816rz_error
% 1.66/1.31  % SZS status Theorem for theBenchmark.p
% 1.66/1.31  
% 1.66/1.31  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.66/1.31  
% 1.66/1.31  % ------  iProver source info
% 1.66/1.31  
% 1.66/1.31  % git: date: 2026-07-19 20:42:38 +0200
% 1.66/1.31  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.66/1.31  % git: non_committed_changes: false
% 1.66/1.31  
% 1.66/1.31  % ------ Parsing...
% 1.66/1.31  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.66/1.31  
% 1.66/1.31  % ------ Preprocessing...% 
% 1.66/1.31  
% 1.66/1.31  % SZS status Theorem for theBenchmark.p
% 1.66/1.31  
% 1.66/1.31  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.66/1.31  
% 1.66/1.31  
%------------------------------------------------------------------------------