↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : FLD060-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 : n015.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:50 PM UTC 2026

% Result   : Unsatisfiable 2.67s 1.08s
% Output   : CNFRefutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   28 (   9 unt;   0 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   78 (  40   ~;  38   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   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;   2 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn  29   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1] :
      ( ~ defined(X1)
      | ~ defined(X0)
      | equalish(add(X0,X1),add(X1,X0)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).

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(f19,axiom,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X0,X2)
      | ~ defined(X1)
      | less_or_equal(add(X0,X1),add(X2,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).

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(f28,axiom,
    defined(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).

fof(f29,axiom,
    defined(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).

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

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

tcf(c_80,plain,
    defined(a),
    inference(cnf_transformation,[],[f28]) ).

tcf(c_81,plain,
    defined(b),
    inference(cnf_transformation,[],[f29]) ).

tcf(c_82,negated_conjecture,
    less_or_equal(a,b),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_83,negated_conjecture,
    ~ less_or_equal(add(a,a),add(b,b)),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_85,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_87,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( less_or_equal(add(X0,X2),add(X1,X2))
      | ~ defined(X2)
      | ~ less_or_equal(X0,X1) ),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_89,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_94,plain,
    ! [X0: $i,X1: $i] :
      ( equalish(add(X0,X1),add(X1,X0))
      | ~ defined(X1)
      | ~ defined(X0) ),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_248,plain,
    ! [X0: $i] :
      ( less_or_equal(add(a,a),add(b,b))
      | ~ less_or_equal(X0,add(b,b))
      | ~ less_or_equal(add(a,a),X0) ),
    inference(instantiation,[status(thm)],[c_89]) ).

tcf(c_254,plain,
    ! [X0: $i] :
      ( less_or_equal(add(X0,b),add(b,b))
      | ~ defined(b)
      | ~ less_or_equal(X0,b) ),
    inference(instantiation,[status(thm)],[c_87]) ).

tcf(c_257,plain,
    ! [X0: $i,X1: $i] :
      ( less_or_equal(X1,add(b,b))
      | ~ equalish(X0,X1)
      | ~ less_or_equal(X0,add(b,b)) ),
    inference(instantiation,[status(thm)],[c_85]) ).

tcf(c_261,plain,
    ! [X0: $i] :
      ( less_or_equal(add(a,a),add(b,b))
      | ~ less_or_equal(add(a,a),add(X0,a))
      | ~ less_or_equal(add(X0,a),add(b,b)) ),
    inference(instantiation,[status(thm)],[c_248]) ).

tcf(c_262,plain,
    ! [X0: $i] :
      ( less_or_equal(add(a,a),add(X0,a))
      | ~ defined(a)
      | ~ less_or_equal(a,X0) ),
    inference(instantiation,[status(thm)],[c_87]) ).

tcf(c_271,plain,
    ( less_or_equal(add(a,b),add(b,b))
    | ~ defined(b)
    | ~ less_or_equal(a,b) ),
    inference(instantiation,[status(thm)],[c_254]) ).

tcf(c_279,plain,
    ( less_or_equal(add(a,a),add(b,a))
    | ~ defined(a)
    | ~ less_or_equal(a,b) ),
    inference(instantiation,[status(thm)],[c_262]) ).

tcf(c_316,plain,
    ! [X0: $i] :
      ( less_or_equal(X0,add(b,b))
      | ~ equalish(add(a,b),X0)
      | ~ less_or_equal(add(a,b),add(b,b)) ),
    inference(instantiation,[status(thm)],[c_257]) ).

tcf(c_455,plain,
    ( less_or_equal(add(b,a),add(b,b))
    | ~ equalish(add(a,b),add(b,a))
    | ~ less_or_equal(add(a,b),add(b,b)) ),
    inference(instantiation,[status(thm)],[c_316]) ).

tcf(c_456,plain,
    ( equalish(add(a,b),add(b,a))
    | ~ defined(b)
    | ~ defined(a) ),
    inference(instantiation,[status(thm)],[c_94]) ).

tcf(c_942,plain,
    ( less_or_equal(add(a,a),add(b,b))
    | ~ less_or_equal(add(b,a),add(b,b))
    | ~ less_or_equal(add(a,a),add(b,a)) ),
    inference(instantiation,[status(thm)],[c_261]) ).

tcf(c_943,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_942,c_456,c_455,c_279,c_271,c_83,c_82,c_80,c_81]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD060-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.11/0.37  % Computer : n015.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Fri Sep 25 11:02:28 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/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.11/0.42  
% 0.11/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42  
% 0.11/0.43  % Detected problem language: tptp
% 0.11/0.44  % Proving...
% 2.67/1.08  % SZS status Started for theBenchmark.p
% 2.67/1.08  % SZS status Unsatisfiable for theBenchmark.p
% 2.67/1.08  
% 2.67/1.08  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.67/1.08  
% 2.67/1.08  % ------  iProver source info
% 2.67/1.08  
% 2.67/1.08  % git: date: 2026-07-19 20:42:38 +0200
% 2.67/1.08  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.67/1.08  % git: non_committed_changes: false
% 2.67/1.08  
% 2.67/1.08  % ------ Parsing...% successful
% 2.67/1.08  
% 2.67/1.08  
% 2.67/1.08  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.67/1.08  
% 2.67/1.08  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 2.67/1.08  
% 2.67/1.08  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.67/1.08  % ------ Proving...
% 2.67/1.08  % ------ Problem Properties 
% 2.67/1.08  
% 2.67/1.08  % 
% 2.67/1.08  % clauses                               24
% 2.67/1.08  % conjectures                           2
% 2.67/1.08  % EPR                                   11
% 2.67/1.08  % Horn                                  23
% 2.67/1.08  % unary                                 5
% 2.67/1.08  % binary                                3
% 2.67/1.08  % lits                                  63
% 2.67/1.08  % lits eq                               0
% 2.67/1.08  % fd_pure                               0
% 2.67/1.08  % fd_pseudo                             0
% 2.67/1.08  % fd_cond                               0
% 2.67/1.08  % fd_pseudo_cond                        0
% 2.67/1.08  % AC symbols                            0
% 2.67/1.08  
% 2.67/1.08  % ------ Schedule dynamic 5 is on 
% 2.67/1.08  
% 2.67/1.08  % ------ no equalities: superposition off 
% 2.67/1.08  
% 2.67/1.08  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.67/1.08  
% 2.67/1.08  
% 2.67/1.08  % ------ 
% 2.67/1.08  % Current options:
% 2.67/1.08  % ------ 
% 2.67/1.08  
% 2.67/1.08  
% 2.67/1.08  % 
% 2.67/1.08  
% 2.67/1.08  % ------ Proving...
% 2.67/1.08  % 
% 2.67/1.08  
% 2.67/1.08  % SZS status Unsatisfiable for theBenchmark.p
% 2.67/1.08  
% 2.67/1.08  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.67/1.09  
% 2.67/1.09  
%------------------------------------------------------------------------------