↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 3.32s 1.29s
% Output   : CNFRefutation 3.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   34 (  15 unt;   0 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   68 (  42   ~;  26   |;   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    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   35 (   0 sgn  35   !;   0   ?;  24   :)

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

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

fof(f31,negated_conjecture,
    sum(a,c,u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_5) ).

fof(f32,negated_conjecture,
    sum(b,c,u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_6) ).

fof(f33,negated_conjecture,
    ~ sum(additive_identity,a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_sum_7) ).

tcf(c_82,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_84,plain,
    ! [X0: $i] :
      ( sum(additive_identity,X0,X0)
      | ~ defined(X0) ),
    inference(cnf_transformation,[],[f3]) ).

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

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

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

tcf(c_110,plain,
    defined(c),
    inference(cnf_transformation,[],[f29]) ).

tcf(c_112,negated_conjecture,
    sum(a,c,u),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_113,negated_conjecture,
    sum(b,c,u),
    inference(cnf_transformation,[],[f32]) ).

tcf(c_114,negated_conjecture,
    ~ sum(additive_identity,a,b),
    inference(cnf_transformation,[],[f33]) ).

tcf(c_309,plain,
    ~ sum(a,additive_identity,b),
    inference(resolution,[status(thm)],[c_86,c_114]) ).

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

tcf(c_469,plain,
    sum(c,b,u),
    inference(superposition,[status(thm)],[c_113,c_86]) ).

tcf(c_866,plain,
    ! [X0: $i] :
      ( ~ sum(u,X0,b)
      | ~ sum(c,X0,additive_identity) ),
    inference(resolution,[status(thm)],[c_369,c_112]) ).

tcf(c_949,plain,
    ! [X0: $i] :
      ( ~ sum(c,X0,additive_identity)
      | ~ sum(X0,u,b) ),
    inference(resolution,[status(thm)],[c_866,c_86]) ).

tcf(c_1050,plain,
    ! [X0: $i] :
      ( ~ sum(X0,u,b)
      | ~ sum(X0,c,additive_identity) ),
    inference(resolution,[status(thm)],[c_949,c_86]) ).

tcf(c_1199,plain,
    ! [X0: $i] :
      ( ~ sum(u,X0,b)
      | ~ sum(X0,c,additive_identity) ),
    inference(resolution,[status(thm)],[c_1050,c_86]) ).

tcf(c_1331,plain,
    ( ~ defined(c)
    | ~ sum(u,additive_inverse(c),b) ),
    inference(resolution,[status(thm)],[c_1199,c_85]) ).

tcf(c_1332,plain,
    ~ sum(u,additive_inverse(c),b),
    inference(global_subsumption_just,[status(thm)],[c_1331,c_110,c_1331]) ).

tcf(c_1350,plain,
    ~ sum(additive_inverse(c),u,b),
    inference(resolution,[status(thm)],[c_1332,c_86]) ).

tcf(c_1352,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ sum(X1,X2,b)
      | ~ sum(X0,X2,u)
      | ~ sum(additive_inverse(c),X0,X1) ),
    inference(resolution,[status(thm)],[c_1350,c_82]) ).

tcf(c_9356,plain,
    ! [X0: $i] :
      ( ~ defined(b)
      | ~ sum(X0,b,u)
      | ~ sum(additive_inverse(c),X0,additive_identity) ),
    inference(resolution,[status(thm)],[c_1352,c_84]) ).

tcf(c_9358,plain,
    ! [X0: $i] :
      ( ~ sum(additive_inverse(c),X0,additive_identity)
      | ~ sum(X0,b,u) ),
    inference(global_subsumption_just,[status(thm)],[c_9356,c_109,c_9356]) ).

tcf(c_9359,plain,
    ! [X0: $i] :
      ( ~ sum(X0,b,u)
      | ~ sum(additive_inverse(c),X0,additive_identity) ),
    inference(renaming,[status(thm)],[c_9358]) ).

tcf(c_9460,plain,
    ( ~ defined(c)
    | ~ sum(c,b,u) ),
    inference(resolution,[status(thm)],[c_9359,c_85]) ).

tcf(c_9461,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_9460,c_469,c_110]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD022-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:45:41 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/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.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.32/1.29  % SZS status Started for theBenchmark.p
% 3.32/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 3.32/1.29  
% 3.32/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.32/1.29  
% 3.32/1.29  % ------  iProver source info
% 3.32/1.29  
% 3.32/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 3.32/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.32/1.29  % git: non_committed_changes: false
% 3.32/1.29  
% 3.32/1.29  % ------ Parsing...% successful
% 3.32/1.29  
% 3.32/1.29  
% 3.32/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.32/1.29  
% 3.32/1.29  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.32/1.29  
% 3.32/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.32/1.29  % ------ Proving...
% 3.32/1.29  % ------ Problem Properties 
% 3.32/1.29  
% 3.32/1.29  % 
% 3.32/1.29  % clauses                               33
% 3.32/1.29  % conjectures                           3
% 3.32/1.29  % EPR                                   25
% 3.32/1.29  % Horn                                  30
% 3.32/1.29  % unary                                 10
% 3.32/1.29  % binary                                6
% 3.32/1.29  % lits                                  84
% 3.32/1.29  % lits eq                               0
% 3.32/1.29  % fd_pure                               0
% 3.32/1.29  % fd_pseudo                             0
% 3.32/1.29  % fd_cond                               0
% 3.32/1.29  % fd_pseudo_cond                        0
% 3.32/1.29  % AC symbols                            0
% 3.32/1.29  
% 3.32/1.29  % ------ Input Options Time Limit: Unbounded
% 3.32/1.29  
% 3.32/1.29  
% 3.32/1.29  % ------ 
% 3.32/1.29  % Current options:
% 3.32/1.29  % ------ 
% 3.32/1.29  
% 3.32/1.29  
% 3.32/1.29  % 
% 3.32/1.29  
% 3.32/1.29  % ------ Proving...
% 3.32/1.29  % 
% 3.32/1.29  
% 3.32/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 3.32/1.29  
% 3.32/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.32/1.29  
% 3.32/1.29  
%------------------------------------------------------------------------------