↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : HEN005-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

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

% Result   : Unsatisfiable 1.04s 1.28s
% Output   : CNFRefutation 1.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  19 unt;   0 def)
%            Number of atoms       :   97 (  19 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   62 (  32   ~;  30   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   55 (   0 sgn  55   !;   0   ?;  40   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( quotient(X0,X1,zero)
      | ~ less_equal(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( less_equal(X0,X1)
      | ~ quotient(X0,X1,zero) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).

fof(f4,axiom,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( less_equal(X6,X7)
      | ~ quotient(X2,X3,X7)
      | ~ quotient(X5,X4,X6)
      | ~ quotient(X0,X3,X5)
      | ~ quotient(X1,X3,X4)
      | ~ quotient(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_property) ).

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

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

fof(f10,axiom,
    less_equal(x,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy) ).

fof(f11,axiom,
    less_equal(y,z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yLEz) ).

fof(f12,negated_conjecture,
    ~ less_equal(x,z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_transitivity_of_less_equal) ).

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

tcf(c_62,plain,
    ! [X0: $i,X1: $i] :
      ( less_equal(X0,X1)
      | ~ quotient(X0,X1,zero) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
      ( less_equal(X7,X6)
      | ~ quotient(X4,X5,X7)
      | ~ quotient(X2,X3,X6)
      | ~ quotient(X1,X3,X5)
      | ~ quotient(X0,X3,X4)
      | ~ quotient(X0,X1,X2) ),
    inference(cnf_transformation,[],[f4]) ).

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

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

tcf(c_70,plain,
    less_equal(x,y),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_71,plain,
    less_equal(y,z),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_72,negated_conjecture,
    ~ less_equal(x,z),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_79,plain,
    ! [X0: $i,X1: $i] :
      ( ( divide(X0,X1) = zero )
      | ~ less_equal(X0,X1) ),
    inference(well_definedness,[status(thm)],[c_61]) ).

tcf(c_80,plain,
    ! [X0: $i,X1: $i] :
      ( less_equal(X0,X1)
      | ( divide(X0,X1) != zero ) ),
    inference(well_definedness,[status(thm)],[c_62]) ).

tcf(c_83,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
      ( less_equal(X7,X6)
      | ( divide(X4,X5) != X7 )
      | ( divide(X2,X3) != X6 )
      | ( divide(X1,X3) != X5 )
      | ( divide(X0,X3) != X4 )
      | ( divide(X0,X1) != X2 ) ),
    inference(well_definedness,[status(thm)],[c_64]) ).

tcf(c_184,plain,
    ! [X0: $i,X1: $i,X2: $i] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
    inference(unflattening,[status(thm)],[c_83]) ).

tcf(c_192,plain,
    ! [X0: $i,X1: $i] :
      ( ( divide(X0,X1) != zero )
      | less_equal(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_80]) ).

tcf(c_193,plain,
    ! [X0: $i,X1: $i] :
      ( less_equal(X0,X1)
      | ( divide(X0,X1) != zero ) ),
    inference(renaming,[status(thm)],[c_192]) ).

tcf(c_194,plain,
    ! [X0: $i,X1: $i] :
      ( ( divide(X0,X1) = zero )
      | ~ less_equal(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_79]) ).

tcf(c_427,plain,
    divide(x,y) = zero,
    inference(superposition,[status(thm)],[c_70,c_194]) ).

tcf(c_428,plain,
    divide(y,z) = zero,
    inference(superposition,[status(thm)],[c_71,c_194]) ).

tcf(c_429,plain,
    ! [X0: $i] : divide(zero,X0) = zero,
    inference(superposition,[status(thm)],[c_65,c_194]) ).

tcf(c_445,plain,
    ! [X0: $i] :
      ( ( X0 = zero )
      | ~ less_equal(X0,zero) ),
    inference(superposition,[status(thm)],[c_65,c_66]) ).

tcf(c_467,plain,
    ! [X0: $i] : less_equal(divide(divide(x,X0),divide(y,X0)),divide(zero,X0)),
    inference(superposition,[status(thm)],[c_427,c_184]) ).

tcf(c_468,plain,
    ! [X0: $i] : less_equal(divide(divide(x,X0),divide(y,X0)),zero),
    inference(light_normalisation,[status(thm)],[c_467,c_429]) ).

tcf(c_472,plain,
    ( less_equal(x,z)
    | ( divide(x,z) != zero ) ),
    inference(instantiation,[status(thm)],[c_193]) ).

tcf(c_557,plain,
    less_equal(divide(divide(x,z),zero),zero),
    inference(superposition,[status(thm)],[c_428,c_468]) ).

tcf(c_577,plain,
    divide(divide(x,z),zero) = zero,
    inference(superposition,[status(thm)],[c_557,c_445]) ).

tcf(c_582,plain,
    less_equal(divide(x,z),zero),
    inference(superposition,[status(thm)],[c_577,c_193]) ).

tcf(c_604,plain,
    divide(x,z) = zero,
    inference(superposition,[status(thm)],[c_582,c_445]) ).

tcf(c_607,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_604,c_472,c_72]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN005-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.37  % Computer : n003.cluster.edu
% 0.08/0.37  % Model    : x86_64 x86_64
% 0.08/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37  % Memory   : 8046.5625MB
% 0.08/0.37  % OS       : Linux 6.8.0-71-generic
% 0.08/0.37  % CPULimit : 300
% 0.08/0.37  % WCLimit  : 300
% 0.08/0.37  % DateTime : Wed Sep 23 16:13:50 UTC 2026
% 0.08/0.38  % CPUTime  : 
% 0.08/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.41  Running first-order theorem proving
% 0.08/0.41  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.42  
% 0.08/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42  
% 0.08/0.42  % Detected problem language: tptp
% 0.08/0.43  % Proving...
% 1.04/1.28  % SZS status Started for theBenchmark.p
% 1.04/1.28  % SZS status Unsatisfiable for theBenchmark.p
% 1.04/1.28  
% 1.04/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.04/1.28  
% 1.04/1.28  % ------  iProver source info
% 1.04/1.28  
% 1.04/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 1.04/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.04/1.28  % git: non_committed_changes: false
% 1.04/1.28  
% 1.04/1.28  % ------ Parsing...% successful
% 1.04/1.28  
% 1.04/1.28  
% 1.04/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.04/1.28  
% 1.04/1.28  % ------ Preprocessing... sup_sim: 4  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 1.04/1.28  
% 1.04/1.28  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.04/1.28  
% 1.04/1.28  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.04/1.28  % ------ Proving...
% 1.04/1.28  % ------ Problem Properties 
% 1.04/1.28  
% 1.04/1.28  % 
% 1.04/1.28  % clauses                               10
% 1.04/1.28  % conjectures                           1
% 1.04/1.28  % EPR                                   6
% 1.04/1.28  % Horn                                  10
% 1.04/1.28  % unary                                 7
% 1.04/1.28  % binary                                2
% 1.04/1.28  % lits                                  14
% 1.04/1.28  % lits eq                               3
% 1.04/1.28  % fd_pure                               0
% 1.04/1.28  % fd_pseudo                             0
% 1.04/1.28  % fd_cond                               0
% 1.04/1.28  % fd_pseudo_cond                        1
% 1.04/1.28  % AC symbols                            0
% 1.04/1.28  
% 1.04/1.28  % ------ Schedule dynamic 5 is on 
% 1.04/1.28  
% 1.04/1.28  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.04/1.28  
% 1.04/1.28  
% 1.04/1.28  % ------ 
% 1.04/1.28  % Current options:
% 1.04/1.28  % ------ 
% 1.04/1.28  
% 1.04/1.28  
% 1.04/1.28  % 
% 1.04/1.28  
% 1.04/1.28  % ------ Proving...
% 1.04/1.28  % 
% 1.04/1.28  
% 1.04/1.28  % SZS status Unsatisfiable for theBenchmark.p
% 1.04/1.28  
% 1.04/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.04/1.28  
% 1.04/1.28  
%------------------------------------------------------------------------------