↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : FLD005-3 : 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 : 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 01:15:34 PM UTC 2026

% Result   : Unsatisfiable 3.24s 1.18s
% Output   : CNFRefutation 3.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   30 (  10 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   69 (  41   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn  46   !;   0   ?;  31   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ sum(X4,X5,X2)
      | ~ sum(X3,X5,X1)
      | ~ sum(X0,X3,X4)
      | sum(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).

fof(f3,axiom,
    ! [X0] :
      ( ~ defined(X0)
      | sum(additive_identity,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).

fof(f4,axiom,
    ! [X0] :
      ( ~ defined(X0)
      | sum(additive_inverse(X0),X0,additive_identity) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( ~ sum(X1,X0,X2)
      | sum(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).

fof(f15,axiom,
    ! [X0] :
      ( ~ defined(X0)
      | defined(additive_inverse(X0)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_inverse) ).

fof(f19,axiom,
    ! [X0,X1] :
      ( ~ defined(X1)
      | ~ defined(X0)
      | sum(X0,X1,add(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).

fof(f27,axiom,
    defined(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).

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

fof(f29,negated_conjecture,
    ! [X0] : ~ sum(a,X0,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_sum_3) ).

tcf(c_78,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
      ( sum(X0,X4,X5)
      | ~ sum(X2,X3,X5)
      | ~ sum(X1,X3,X4)
      | ~ sum(X0,X1,X2) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_80,plain,
    ! [X0: $i] :
      ( sum(additive_identity,X0,X0)
      | ~ defined(X0) ),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_81,plain,
    ! [X0: $i] :
      ( sum(additive_inverse(X0),X0,additive_identity)
      | ~ defined(X0) ),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_82,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( sum(X1,X0,X2)
      | ~ sum(X0,X1,X2) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_92,plain,
    ! [X0: $i] :
      ( defined(additive_inverse(X0))
      | ~ defined(X0) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_96,plain,
    ! [X0: $i,X1: $i] :
      ( sum(X0,X1,add(X0,X1))
      | ~ defined(X1)
      | ~ defined(X0) ),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_104,plain,
    defined(a),
    inference(cnf_transformation,[],[f27]) ).

tcf(c_105,plain,
    defined(b),
    inference(cnf_transformation,[],[f28]) ).

tcf(c_106,negated_conjecture,
    ! [X0: $i] : ~ sum(a,X0,b),
    inference(cnf_transformation,[],[f29]) ).

tcf(c_348,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ~ sum(a,X0,X3)
      | ~ sum(X3,X1,b)
      | ~ sum(X0,X1,X2) ),
    inference(resolution,[status(thm)],[c_78,c_106]) ).

tcf(c_367,plain,
    ! [X0: $i,X1: $i] :
      ( ~ defined(b)
      | ~ sum(a,X0,additive_identity)
      | ~ sum(X0,b,X1) ),
    inference(resolution,[status(thm)],[c_348,c_80]) ).

tcf(c_369,plain,
    ! [X0: $i,X1: $i] :
      ( ~ sum(X0,b,X1)
      | ~ sum(a,X0,additive_identity) ),
    inference(global_subsumption_just,[status(thm)],[c_367,c_105,c_367]) ).

tcf(c_370,plain,
    ! [X0: $i,X1: $i] :
      ( ~ sum(a,X0,additive_identity)
      | ~ sum(X0,b,X1) ),
    inference(renaming,[status(thm)],[c_369]) ).

tcf(c_439,plain,
    ! [X0: $i,X1: $i] :
      ( ~ sum(X0,a,additive_identity)
      | ~ sum(X0,b,X1) ),
    inference(resolution,[status(thm)],[c_370,c_82]) ).

tcf(c_586,plain,
    ! [X0: $i,X1: $i] :
      ( ~ sum(X0,a,additive_identity)
      | ~ sum(b,X0,X1) ),
    inference(resolution,[status(thm)],[c_439,c_82]) ).

tcf(c_624,plain,
    ! [X0: $i] :
      ( ~ defined(a)
      | ~ sum(b,additive_inverse(a),X0) ),
    inference(resolution,[status(thm)],[c_586,c_81]) ).

tcf(c_626,plain,
    ! [X0: $i] : ~ sum(b,additive_inverse(a),X0),
    inference(global_subsumption_just,[status(thm)],[c_624,c_104,c_624]) ).

tcf(c_653,plain,
    ( ~ defined(b)
    | ~ defined(additive_inverse(a)) ),
    inference(resolution,[status(thm)],[c_626,c_96]) ).

tcf(c_654,plain,
    ~ defined(additive_inverse(a)),
    inference(global_subsumption_just,[status(thm)],[c_653,c_105,c_653]) ).

tcf(c_670,plain,
    ~ defined(a),
    inference(resolution,[status(thm)],[c_654,c_92]) ).

tcf(c_671,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_670,c_104]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : FLD005-3 : 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/0.36  % Computer : n001.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Fri Sep 25 10:39:56 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  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.09/0.42  
% 0.09/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42  
% 0.09/0.42  % Detected problem language: tptp
% 0.09/0.43  % Proving...
% 3.24/1.18  % SZS status Started for theBenchmark.p
% 3.24/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 3.24/1.18  
% 3.24/1.18  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.24/1.18  
% 3.24/1.18  % ------  iProver source info
% 3.24/1.18  
% 3.24/1.18  % git: date: 2026-07-19 20:42:38 +0200
% 3.24/1.18  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.24/1.18  % git: non_committed_changes: false
% 3.24/1.18  
% 3.24/1.18  % ------ Parsing...% successful
% 3.24/1.18  
% 3.24/1.18  
% 3.24/1.18  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.24/1.18  
% 3.24/1.18  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.24/1.18  
% 3.24/1.18  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.24/1.18  % ------ Proving...
% 3.24/1.18  % ------ Problem Properties 
% 3.24/1.18  
% 3.24/1.18  % 
% 3.24/1.18  % clauses                               29
% 3.24/1.18  % conjectures                           1
% 3.24/1.18  % EPR                                   21
% 3.24/1.18  % Horn                                  26
% 3.24/1.18  % unary                                 6
% 3.24/1.18  % binary                                6
% 3.24/1.18  % lits                                  80
% 3.24/1.18  % lits eq                               0
% 3.24/1.18  % fd_pure                               0
% 3.24/1.18  % fd_pseudo                             0
% 3.24/1.18  % fd_cond                               0
% 3.24/1.18  % fd_pseudo_cond                        0
% 3.24/1.18  % AC symbols                            0
% 3.24/1.18  
% 3.24/1.18  % ------ Input Options Time Limit: Unbounded
% 3.24/1.18  
% 3.24/1.18  
% 3.24/1.18  % ------ 
% 3.24/1.18  % Current options:
% 3.24/1.18  % ------ 
% 3.24/1.18  
% 3.24/1.18  
% 3.24/1.18  % 
% 3.24/1.18  
% 3.24/1.18  % ------ Proving...
% 3.24/1.18  % 
% 3.24/1.18  
% 3.24/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 3.24/1.18  
% 3.24/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.24/1.18  
% 3.24/1.18  
%------------------------------------------------------------------------------