↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM906_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 : 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 02:27:12 PM UTC 2026

% Result   : Theorem 0.37s 1.15s
% Output   : CNFRefutation 0.37s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f15ERROR: Could not build tree for root c_123ERROR: MakeTreeStats fails)

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

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

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

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

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

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

tff(f19,plain,
    ( ~ $less(sK1,sK0)
    | ( sK0 = sK1 )
    | $less(sK0,sK1) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f21,plain,
    ( $less(sK1,sK0)
    | ~ $less(sK0,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_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_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_57,negated_conjecture,
    ! [X0_rat: $rat] : $sum(X0_rat,0/1) = X0_rat,
    inference(cnf_transformation,[],[f6]) ).

tcf(c_60,negated_conjecture,
    ( $less(sK1,sK0)
    | ~ $less(sK0,sK1) ),
    inference(cnf_transformation,[],[f21]) ).

tcf(c_62,negated_conjecture,
    ( $less(sK0,sK1)
    | ( sK0 = sK1 )
    | ~ $less(sK1,sK0) ),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_108,plain,
    ( $less(sK0,sK1)
    | ( sK0 = sK1 ) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_62,c_52]) ).

tcf(c_123,plain,
    $false,
    inference(smt_impl_just,[status(thm)],[c_108,c_60,c_57,c_55,c_54,c_49]) ).


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