↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n017.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.56s 1.28s
% Output   : CNFRefutation 1.56s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f22ERROR: Could not build tree for root c_208ERROR: MakeTreeStats fails)

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

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

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

tff(f23,plain,
    ? [X0: $int,X1: $int] :
      ( $less(7,$sum(X0,$product(2,X1)))
      & $less(X1,3)
      & $less(X0,5)
      & ( 2 != X1 ) ),
    inference(ennf_transformation,[],[f22]) ).

tff(f24,plain,
    ? [X0: $int,X1: $int] :
      ( $less(7,$sum(X0,$product(2,X1)))
      & $less(X1,3)
      & $less(X0,5)
      & ( 2 != X1 ) ),
    inference(flattening,[],[f23]) ).

tff(f25,plain,
    ( $less(7,$sum(sK0,$product(2,sK1)))
    & $less(sK1,3)
    & $less(sK0,5)
    & ( 2 != sK1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f24]) ).

tff(f27,plain,
    $less(sK1,3),
    inference(cnf_transformation,[],[f25]) ).

tff(f28,plain,
    $less(sK0,5),
    inference(cnf_transformation,[],[f25]) ).

tff(f29,plain,
    2 != sK1,
    inference(cnf_transformation,[],[f25]) ).

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

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

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

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

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

tcf(c_67,negated_conjecture,
    sK1 != 2,
    inference(cnf_transformation,[],[f29]) ).

tcf(c_68,negated_conjecture,
    $less(sK0,5),
    inference(cnf_transformation,[],[f28]) ).

tcf(c_69,negated_conjecture,
    $less(sK1,3),
    inference(cnf_transformation,[],[f27]) ).

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

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

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

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

tcf(c_75,plain,
    $less(5,7),
    theory(arith) ).

tcf(c_208,plain,
    $false,
    inference(smt_impl_just,[status(thm)],[c_75,c_74,c_73,c_72,c_71,c_69,c_68,c_67,c_64,c_61,c_56,c_53,c_52]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ARI179_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37  % Computer : n017.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Fri Sep 25 05:58:32 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.40  Running TFA theorem proving
% 0.12/0.40  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.12/0.41  
% 0.12/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41  
% 0.12/0.42  % Detected problem language: tptp
% 0.12/0.43  % Proving...
% 1.56/1.28  % SZS status Started for theBenchmark.p
% 1.56/1.28  ERROR - "ProverProcess:heur/schedule_none:304.9999740123749" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.56/1.28  Fatal error: exception Failure("undefined enum value")
% 1.56/1.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/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_bzd1_wvn/dp9fmg4u 2>> /export/starexec/sandbox/tmp/iprover_out_bzd1_wvn/dp9fmg4u_error
% 1.56/1.28  % SZS status Theorem for theBenchmark.p
% 1.56/1.28  
% 1.56/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.56/1.28  
% 1.56/1.28  % ------  iProver source info
% 1.56/1.28  
% 1.56/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 1.56/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.56/1.28  % git: non_committed_changes: false
% 1.56/1.28  
% 1.56/1.28  % ------ Parsing...
% 1.56/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.56/1.28  
% 1.56/1.28  % ------ Preprocessing...% 
% 1.56/1.28  
% 1.56/1.28  % SZS status Theorem for theBenchmark.p
% 1.56/1.28  
% 1.56/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.56/1.28  
% 1.56/1.28  
%------------------------------------------------------------------------------