↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n008.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 01:37:21 PM UTC 2026

% Result   : Unsatisfiable 1.80s 1.29s
% Output   : CNFRefutation 1.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   34 (  25 unt;   1 def)
%            Number of atoms       :   59 (  16 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   25 (  14   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn  30   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( divide(X0,X1) = zero
      | ~ less_equal(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( less_equal(X0,X1)
      | divide(X0,X1) != zero ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).

fof(f3,axiom,
    ! [X0,X1] : less_equal(divide(X0,X1),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).

fof(f4,axiom,
    ! [X2,X0,X1] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).

fof(f5,axiom,
    ! [X0] : less_equal(zero,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( X0 = X1
      | ~ less_equal(X1,X0)
      | ~ less_equal(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).

fof(f8,axiom,
    less_equal(divide(a,b),d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_divide_b_LE_d) ).

fof(f9,negated_conjecture,
    ~ less_equal(divide(a,d),b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_divide_d_LE_b) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i] :
      ( ( divide(X0,X1) = zero )
      | ~ less_equal(X0,X1) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_59,plain,
    ! [X0: $i,X1: $i] :
      ( less_equal(X0,X1)
      | ( divide(X0,X1) != zero ) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i] : less_equal(divide(X0,X1),X0),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i,X2: $i] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_62,plain,
    ! [X0: $i] : less_equal(zero,X0),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_63,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ less_equal(X1,X0)
      | ~ less_equal(X0,X1) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_65,plain,
    less_equal(divide(a,b),d),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_66,negated_conjecture,
    ~ less_equal(divide(a,d),b),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_134,definition,
    iPr_def_10 = divide(a,d),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_135,negated_conjecture,
    ~ less_equal(iPr_def_10,b),
    inference(demodulation,[status(thm)],[c_66,c_134]) ).

tcf(c_304,plain,
    divide(divide(a,b),d) = zero,
    inference(superposition,[status(thm)],[c_65,c_58]) ).

tcf(c_305,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = zero,
    inference(superposition,[status(thm)],[c_60,c_58]) ).

tcf(c_306,plain,
    ! [X0: $i] : divide(zero,X0) = zero,
    inference(superposition,[status(thm)],[c_62,c_58]) ).

tcf(c_329,plain,
    ! [X0: $i] :
      ( ( X0 = zero )
      | ~ less_equal(X0,zero) ),
    inference(superposition,[status(thm)],[c_62,c_63]) ).

tcf(c_347,plain,
    less_equal(divide(divide(a,d),divide(b,d)),zero),
    inference(superposition,[status(thm)],[c_304,c_61]) ).

tcf(c_352,plain,
    less_equal(divide(iPr_def_10,divide(b,d)),zero),
    inference(light_normalisation,[status(thm)],[c_347,c_134]) ).

tcf(c_364,plain,
    ( less_equal(iPr_def_10,b)
    | ( divide(iPr_def_10,b) != zero ) ),
    inference(instantiation,[status(thm)],[c_59]) ).

tcf(c_409,plain,
    ( ( divide(iPr_def_10,divide(b,d)) = zero )
    | ~ less_equal(zero,divide(iPr_def_10,divide(b,d))) ),
    inference(superposition,[status(thm)],[c_352,c_63]) ).

tcf(c_411,plain,
    divide(iPr_def_10,divide(b,d)) = zero,
    inference(forward_subsumption_resolution,[status(thm)],[c_409,c_62]) ).

tcf(c_466,plain,
    ! [X0: $i] : less_equal(divide(divide(iPr_def_10,X0),divide(divide(b,d),X0)),divide(zero,X0)),
    inference(superposition,[status(thm)],[c_411,c_61]) ).

tcf(c_468,plain,
    ! [X0: $i] : less_equal(divide(divide(iPr_def_10,X0),divide(divide(b,d),X0)),zero),
    inference(light_normalisation,[status(thm)],[c_466,c_306]) ).

tcf(c_1040,plain,
    less_equal(divide(divide(iPr_def_10,b),zero),zero),
    inference(superposition,[status(thm)],[c_305,c_468]) ).

tcf(c_1056,plain,
    divide(divide(iPr_def_10,b),zero) = zero,
    inference(superposition,[status(thm)],[c_1040,c_329]) ).

tcf(c_1061,plain,
    less_equal(divide(iPr_def_10,b),zero),
    inference(superposition,[status(thm)],[c_1056,c_59]) ).

tcf(c_1075,plain,
    divide(iPr_def_10,b) = zero,
    inference(superposition,[status(thm)],[c_1061,c_329]) ).

tcf(c_1078,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1075,c_364,c_135]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN006-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36  % Computer : n008.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.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Wed Sep 23 16:13:24 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.42  
% 0.10/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42  
% 0.10/0.42  % Detected problem language: tptp
% 0.10/0.43  % Proving...
% 1.80/1.29  % SZS status Started for theBenchmark.p
% 1.80/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 1.80/1.29  
% 1.80/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.80/1.29  
% 1.80/1.29  % ------  iProver source info
% 1.80/1.29  
% 1.80/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 1.80/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.80/1.29  % git: non_committed_changes: false
% 1.80/1.29  
% 1.80/1.29  % ------ Parsing...% successful
% 1.80/1.29  
% 1.80/1.29  
% 1.80/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.80/1.29  
% 1.80/1.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 1.80/1.29  
% 1.80/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.80/1.29  
% 1.80/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.80/1.29  % ------ Proving...
% 1.80/1.29  % ------ Problem Properties 
% 1.80/1.29  
% 1.80/1.29  % 
% 1.80/1.29  % clauses                               10
% 1.80/1.29  % conjectures                           1
% 1.80/1.29  % EPR                                   4
% 1.80/1.29  % Horn                                  10
% 1.80/1.29  % unary                                 7
% 1.80/1.29  % binary                                2
% 1.80/1.29  % lits                                  14
% 1.80/1.29  % lits eq                               4
% 1.80/1.29  % fd_pure                               0
% 1.80/1.29  % fd_pseudo                             0
% 1.80/1.29  % fd_cond                               0
% 1.80/1.29  % fd_pseudo_cond                        1
% 1.80/1.29  % AC symbols                            0
% 1.80/1.29  
% 1.80/1.29  % ------ Schedule dynamic 5 is on 
% 1.80/1.29  
% 1.80/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.80/1.29  
% 1.80/1.29  
% 1.80/1.29  % ------ 
% 1.80/1.29  % Current options:
% 1.80/1.29  % ------ 
% 1.80/1.29  
% 1.80/1.29  
% 1.80/1.29  % 
% 1.80/1.29  
% 1.80/1.29  % ------ Proving...
% 1.80/1.29  % 
% 1.80/1.29  
% 1.80/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 1.80/1.29  
% 1.80/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.80/1.29  
% 1.80/1.29  
%------------------------------------------------------------------------------