↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : ARI180_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 : n009.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 0.39s 1.16s
% Output   : CNFRefutation 0.39s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f16ERROR: Could not build tree for root c_151ERROR: MakeTreeStats fails)

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

tff(type_def_1,type,
    $bool: $tType ).

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

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

tff(f17,plain,
    ? [X0: $int,X1: $int] :
      ( ( 0 = $sum(X1,$uminus(f(X0))) )
      & ( $sum(X0,X1) = f(X0) )
      & ( f(0) != X1 ) ),
    inference(flattening,[],[f16]) ).

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

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

tff(f21,plain,
    f(0) != sK1,
    inference(cnf_transformation,[],[f18]) ).

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

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

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

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

tcf(c_61,negated_conjecture,
    f(0) != sK1,
    inference(cnf_transformation,[],[f21]) ).

tcf(c_62,negated_conjecture,
    $sum(sK0,sK1) = f(sK0),
    inference(cnf_transformation,[],[f20]) ).

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

tcf(c_151,plain,
    $false,
    inference(smt_impl_just,[status(thm)],[c_64,c_62,c_61,c_58,c_56,c_55,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ARI180_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.09/0.36  % Computer : n009.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Fri Sep 25 06:03:30 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40  Running TFA theorem proving
% 0.09/0.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.09/0.41  
% 0.09/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41  
% 0.09/0.41  % Detected problem language: tptp
% 0.09/0.42  % Proving...
% 0.39/1.16  % SZS status Started for theBenchmark.p
% 0.39/1.16  ERROR - "ProverProcess:heur/schedule_none:304.9999785423279" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 0.39/1.16  Fatal error: exception Failure("undefined enum value")
% 0.39/1.16  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_bmcrg6ex/ekd6_1a0 2>> /export/starexec/sandbox2/tmp/iprover_out_bmcrg6ex/ekd6_1a0_error
% 0.39/1.16  % SZS status Theorem for theBenchmark.p
% 0.39/1.16  
% 0.39/1.16  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.39/1.16  
% 0.39/1.16  % ------  iProver source info
% 0.39/1.16  
% 0.39/1.16  % git: date: 2026-07-19 20:42:38 +0200
% 0.39/1.16  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.39/1.16  % git: non_committed_changes: false
% 0.39/1.16  
% 0.39/1.16  % ------ Parsing...
% 0.39/1.16  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.39/1.16  
% 0.39/1.16  % ------ Preprocessing...% 
% 0.39/1.16  
% 0.39/1.16  % SZS status Theorem for theBenchmark.p
% 0.39/1.16  
% 0.39/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.39/1.16  
% 0.39/1.16  
%------------------------------------------------------------------------------