↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n001.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 03:54:20 PM UTC 2026

% Result   : Unsatisfiable 0.40s 1.34s
% Output   : CNFRefutation 0.40s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f21ERROR: Could not build tree for root c_201ERROR: MakeTreeStats fails)

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

tff(pred_def_1,type,
    p: $int > $o ).

tff(pred_def_2,type,
    q: $int > $o ).

tff(pred_def_3,type,
    r: $int > $o ).

tff(f2,axiom,
    ( $greatereq(npb,0)
   => p(npb) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

tff(f4,axiom,
    ( $less(npb,0)
   => q(npb) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

tff(f5,axiom,
    ! [X0: $int] :
      ( ( r(X0)
        & ( npa != npb ) )
     => $false ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

tff(f6,axiom,
    ! [X0: $int] :
      ( $true
     => r(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).

tff(f8,plain,
    ( ~ $less(npb,0)
   => p(npb) ),
    inference(theory_normalization,[],[f2]) ).

tff(f23,plain,
    ! [X0: $int] :
      ~ ( r(X0)
        & ( npa != npb ) ),
    inference(true_and_false_elimination,[],[f5]) ).

tff(f24,plain,
    ! [X0: $int] : r(X0),
    inference(true_and_false_elimination,[],[f6]) ).

tff(f25,plain,
    ( ~ p(npa)
    | $less(npa,0) ),
    inference(ennf_transformation,[],[f21]) ).

tff(f26,plain,
    ( $less(npb,0)
    | p(npb) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f28,plain,
    ( ~ $less(npb,0)
    | q(npb) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f29,plain,
    ! [X0: $int] :
      ( ~ r(X0)
      | ( npa = npb ) ),
    inference(ennf_transformation,[],[f23]) ).

tff(f30,plain,
    ( ~ p(npa)
    | $less(npa,0) ),
    inference(cnf_transformation,[],[f25]) ).

tff(f31,plain,
    ( $less(npb,0)
    | p(npb) ),
    inference(cnf_transformation,[],[f26]) ).

tff(f33,plain,
    ( ~ $less(npb,0)
    | q(npb) ),
    inference(cnf_transformation,[],[f28]) ).

tff(f34,plain,
    ! [X0: $int] :
      ( ~ r(X0)
      | ( npa = npb ) ),
    inference(cnf_transformation,[],[f29]) ).

tff(f35,plain,
    ! [X0: $int] : r(X0),
    inference(cnf_transformation,[],[f24]) ).

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

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

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

tcf(c_61,plain,
    ( $less(npa,0)
    | ~ p(npa) ),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_62,negated_conjecture,
    ( p(npb)
    | $less(npb,0) ),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_64,plain,
    ( q(npb)
    | ~ $less(npb,0) ),
    inference(cnf_transformation,[],[f33]) ).

tcf(c_65,plain,
    ! [X0_int: $int] :
      ( ( npa = npb )
      | ~ r(X0_int) ),
    inference(cnf_transformation,[],[f34]) ).

tcf(c_66,negated_conjecture,
    ! [X0_int: $int] : r(X0_int),
    inference(cnf_transformation,[],[f35]) ).

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

tcf(c_79,plain,
    npa = npb,
    inference(global_subsumption_just,[status(thm)],[c_65,c_66,c_65]) ).

tcf(c_89,plain,
    ( $less(npa,0)
    | ~ p(npa) ),
    inference(prop_impl_just,[status(thm)],[c_61]) ).

tcf(c_91,plain,
    ( q(npb)
    | ~ $less(npb,0) ),
    inference(prop_impl_just,[status(thm)],[c_64]) ).

tcf(c_97,plain,
    ( p(npb)
    | $less(npb,0) ),
    inference(prop_impl_just,[status(thm)],[c_62]) ).

tcf(c_201,plain,
    $false,
    inference(smt_impl_just,[status(thm)],[c_79,c_67,c_66,c_91,c_97,c_89,c_58,c_55,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYP116_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.54  % Computer : n001.cluster.edu
% 0.11/0.54  % Model    : x86_64 x86_64
% 0.11/0.54  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.54  % Memory   : 8046.5625MB
% 0.11/0.54  % OS       : Linux 6.8.0-71-generic
% 0.11/0.54  % CPULimit : 300
% 0.11/0.54  % WCLimit  : 300
% 0.11/0.54  % DateTime : Fri Sep 25 04:10:39 UTC 2026
% 0.11/0.55  % CPUTime  : 
% 0.11/0.55  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.58  Running TFA theorem proving
% 0.15/0.58  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.15/0.59  
% 0.15/0.59  % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.59  
% 0.15/0.59  % Detected problem language: tptp
% 0.15/0.60  % Proving...
% 0.40/1.34  % SZS status Started for theBenchmark.p
% 0.40/1.34  ERROR - "ProverProcess:heur/schedule_none:304.99998021125793" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 0.40/1.34  Fatal error: exception Failure("undefined enum value")
% 0.40/1.34  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_b0lwwzyt/ja4tte77 2>> /export/starexec/sandbox/tmp/iprover_out_b0lwwzyt/ja4tte77_error
% 0.40/1.34  % SZS status Unsatisfiable for theBenchmark.p
% 0.40/1.34  
% 0.40/1.34  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.40/1.34  
% 0.40/1.34  % ------  iProver source info
% 0.40/1.34  
% 0.40/1.34  % git: date: 2026-07-19 20:42:38 +0200
% 0.40/1.34  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.40/1.34  % git: non_committed_changes: false
% 0.40/1.34  
% 0.40/1.34  % ------ Parsing...
% 0.40/1.34  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.40/1.34  
% 0.40/1.34  % ------ Preprocessing...% 
% 0.40/1.34  
% 0.40/1.34  % SZS status Unsatisfiable for theBenchmark.p
% 0.40/1.34  
% 0.40/1.34  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.40/1.35  
% 0.40/1.35  
%------------------------------------------------------------------------------