↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n004.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:15:49 PM UTC 2026

% Result   : Unsatisfiable 0.19s 6.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   29 (  13 unt;   0 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   62 (  31   ~;  31   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   26 (   0 sgn  26   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f11,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).

fof(f16,axiom,
    ! [X0,X1] :
      ( ~ less_or_equal(X1,X0)
      | ~ less_or_equal(X0,X1)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).

fof(f17,axiom,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X2,X1)
      | ~ less_or_equal(X0,X2)
      | less_or_equal(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).

fof(f18,axiom,
    ! [X0,X1] :
      ( ~ defined(X1)
      | ~ defined(X0)
      | less_or_equal(X1,X0)
      | less_or_equal(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).

fof(f22,axiom,
    ! [X0,X1] :
      ( ~ equalish(X1,X0)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).

fof(f26,axiom,
    ! [X2,X0,X1] :
      ( ~ equalish(X2,X0)
      | ~ less_or_equal(X2,X1)
      | less_or_equal(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).

fof(f30,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).

fof(f31,negated_conjecture,
    less_or_equal(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).

fof(f32,negated_conjecture,
    ~ equalish(a,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_5) ).

fof(f33,negated_conjecture,
    equalish(b,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_equals_additive_identity_6) ).

tcf(c_92,plain,
    defined(additive_identity),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_97,plain,
    ! [X0: $i,X1: $i] :
      ( equalish(X0,X1)
      | ~ less_or_equal(X1,X0)
      | ~ less_or_equal(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_98,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( less_or_equal(X0,X2)
      | ~ less_or_equal(X1,X2)
      | ~ less_or_equal(X0,X1) ),
    inference(cnf_transformation,[],[f17]) ).

tcf(c_99,plain,
    ! [X0: $i,X1: $i] :
      ( less_or_equal(X1,X0)
      | less_or_equal(X0,X1)
      | ~ defined(X1)
      | ~ defined(X0) ),
    inference(cnf_transformation,[],[f18]) ).

tcf(c_103,plain,
    ! [X0: $i,X1: $i] :
      ( equalish(X1,X0)
      | ~ equalish(X0,X1) ),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_107,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( less_or_equal(X2,X1)
      | ~ equalish(X0,X2)
      | ~ less_or_equal(X0,X1) ),
    inference(cnf_transformation,[],[f26]) ).

tcf(c_111,negated_conjecture,
    less_or_equal(additive_identity,a),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_112,negated_conjecture,
    less_or_equal(a,b),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_113,negated_conjecture,
    ~ equalish(a,additive_identity),
    inference(cnf_transformation,[],[f32]) ).

tcf(c_114,negated_conjecture,
    equalish(b,additive_identity),
    inference(cnf_transformation,[],[f33]) ).

tcf(c_123,plain,
    ( less_or_equal(additive_identity,additive_identity)
    | ~ defined(additive_identity) ),
    inference(instantiation,[status(thm)],[c_99]) ).

tcf(c_291,negated_conjecture,
    equalish(b,additive_identity),
    inference(demodulation,[status(thm)],[c_114]) ).

tcf(c_299,plain,
    ( equalish(a,additive_identity)
    | ~ less_or_equal(additive_identity,a)
    | ~ less_or_equal(a,additive_identity) ),
    inference(instantiation,[status(thm)],[c_97]) ).

tcf(c_307,plain,
    ! [X0: $i] :
      ( less_or_equal(a,additive_identity)
      | ~ less_or_equal(a,X0)
      | ~ less_or_equal(X0,additive_identity) ),
    inference(instantiation,[status(thm)],[c_98]) ).

tcf(c_346,plain,
    ( less_or_equal(a,additive_identity)
    | ~ less_or_equal(b,additive_identity)
    | ~ less_or_equal(a,b) ),
    inference(instantiation,[status(thm)],[c_307]) ).

tcf(c_417,plain,
    ! [X0: $i] :
      ( less_or_equal(b,additive_identity)
      | ~ equalish(X0,b)
      | ~ less_or_equal(X0,additive_identity) ),
    inference(instantiation,[status(thm)],[c_107]) ).

tcf(c_418,plain,
    ( less_or_equal(b,additive_identity)
    | ~ equalish(additive_identity,b)
    | ~ less_or_equal(additive_identity,additive_identity) ),
    inference(instantiation,[status(thm)],[c_417]) ).

tcf(c_590,plain,
    equalish(additive_identity,b),
    inference(superposition,[status(thm)],[c_291,c_103]) ).

tcf(c_597,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_590,c_418,c_346,c_299,c_123,c_113,c_111,c_112,c_92]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD058-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/5.58  % Computer : n004.cluster.edu
% 0.09/5.58  % Model    : x86_64 x86_64
% 0.09/5.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.58  % Memory   : 8046.5625MB
% 0.09/5.58  % OS       : Linux 6.8.0-71-generic
% 0.09/5.58  % CPULimit : 300
% 0.09/5.58  % WCLimit  : 300
% 0.09/5.58  % DateTime : Fri Sep 25 10:58:12 UTC 2026
% 0.09/5.58  % CPUTime  : 
% 0.09/5.58  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/5.62  Running first-order theorem proving
% 0.13/5.62  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.13/5.63  
% 0.13/5.63  % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.63  
% 0.13/5.63  % Detected problem language: tptp
% 0.13/5.65  % Proving...
% 0.19/6.49  % SZS status Started for theBenchmark.p
% 0.19/6.49  % SZS status Unsatisfiable for theBenchmark.p
% 0.19/6.49  
% 0.19/6.49  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.19/6.49  
% 0.19/6.49  % ------  iProver source info
% 0.19/6.49  
% 0.19/6.49  % git: date: 2026-07-19 20:42:38 +0200
% 0.19/6.49  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.19/6.49  % git: non_committed_changes: false
% 0.19/6.49  
% 0.19/6.49  % ------ Parsing...% successful
% 0.19/6.49  
% 0.19/6.49  
% 0.19/6.49  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.19/6.49  
% 0.19/6.49  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 0.19/6.49  
% 0.19/6.49  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.19/6.49  % ------ Proving...
% 0.19/6.49  % ------ Problem Properties 
% 0.19/6.49  
% 0.19/6.49  % 
% 0.19/6.49  % clauses                               33
% 0.19/6.49  % conjectures                           4
% 0.19/6.49  % EPR                                   16
% 0.19/6.49  % Horn                                  30
% 0.19/6.49  % unary                                 9
% 0.19/6.49  % binary                                6
% 0.19/6.49  % lits                                  79
% 0.19/6.49  % lits eq                               0
% 0.19/6.49  % fd_pure                               0
% 0.19/6.49  % fd_pseudo                             0
% 0.19/6.49  % fd_cond                               0
% 0.19/6.49  % fd_pseudo_cond                        0
% 0.19/6.49  % AC symbols                            0
% 0.19/6.49  
% 0.19/6.49  % ------ Schedule dynamic 5 is on 
% 0.19/6.49  
% 0.19/6.49  % ------ no equalities: superposition off 
% 0.19/6.49  
% 0.19/6.49  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.19/6.49  
% 0.19/6.49  
% 0.19/6.49  % ------ 
% 0.19/6.49  % Current options:
% 0.19/6.49  % ------ 
% 0.19/6.49  
% 0.19/6.49  
% 0.19/6.49  % 
% 0.19/6.49  
% 0.19/6.49  % ------ Proving...
% 0.19/6.49  % 
% 0.19/6.49  
% 0.19/6.49  % SZS status Unsatisfiable for theBenchmark.p
% 0.19/6.49  
% 0.19/6.49  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.19/6.49  
% 0.19/6.49  
%------------------------------------------------------------------------------