↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 1.72s 1.07s
% Output   : CNFRefutation 1.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   22 (  16 unt;   1 def)
%            Number of atoms       :   41 (   1 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   31 (  17   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 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  :    6 (   4 usr;   2 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn  10   !;   0   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f20,axiom,
    ! [X0,X1] :
      ( ~ defined(X1)
      | ~ defined(X0)
      | product(X0,X1,multiply(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_multiplication) ).

fof(f25,axiom,
    ! [X2,X0,X1] :
      ( ~ product(X1,X2,X0)
      | ~ less_or_equal(additive_identity,X2)
      | ~ less_or_equal(additive_identity,X1)
      | less_or_equal(additive_identity,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_multiplication) ).

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,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).

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

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

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

tcf(c_104,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( less_or_equal(additive_identity,X2)
      | ~ less_or_equal(additive_identity,X1)
      | ~ less_or_equal(additive_identity,X0)
      | ~ product(X0,X1,X2) ),
    inference(cnf_transformation,[],[f25]) ).

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

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

tcf(c_108,negated_conjecture,
    less_or_equal(additive_identity,a),
    inference(cnf_transformation,[],[f29]) ).

tcf(c_109,negated_conjecture,
    less_or_equal(additive_identity,b),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_110,negated_conjecture,
    ~ less_or_equal(additive_identity,multiply(a,b)),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_285,definition,
    iPr_def_10 = multiply(a,b),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_286,negated_conjecture,
    ~ less_or_equal(additive_identity,iPr_def_10),
    inference(demodulation,[status(thm)],[c_110,c_285]) ).

tcf(c_287,negated_conjecture,
    less_or_equal(additive_identity,b),
    inference(demodulation,[status(thm)],[c_109]) ).

tcf(c_288,negated_conjecture,
    less_or_equal(additive_identity,a),
    inference(demodulation,[status(thm)],[c_108]) ).

tcf(c_853,plain,
    ( product(a,b,iPr_def_10)
    | ~ defined(b)
    | ~ defined(a) ),
    inference(superposition,[status(thm)],[c_285,c_99]) ).

tcf(c_855,plain,
    product(a,b,iPr_def_10),
    inference(forward_subsumption_resolution,[status(thm)],[c_853,c_107,c_106]) ).

tcf(c_1030,plain,
    ( less_or_equal(additive_identity,iPr_def_10)
    | ~ less_or_equal(additive_identity,b)
    | ~ less_or_equal(additive_identity,a) ),
    inference(superposition,[status(thm)],[c_855,c_104]) ).

tcf(c_1032,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1030,c_286,c_287,c_288]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : FLD071-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.02  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.05/0.31  % Computer : n012.cluster.edu
% 0.05/0.31  % Model    : x86_64 x86_64
% 0.05/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31  % Memory   : 8046.5625MB
% 0.05/0.31  % OS       : Linux 6.8.0-71-generic
% 0.05/0.31  % CPULimit : 300
% 0.05/0.31  % WCLimit  : 300
% 0.05/0.31  % DateTime : Fri Sep 25 11:04:50 UTC 2026
% 0.05/0.31  % CPUTime  : 
% 0.05/0.31  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  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.07/0.34  
% 0.07/0.34  % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.34  
% 0.07/0.34  % Detected problem language: tptp
% 0.07/0.35  % Proving...
% 1.72/1.07  % SZS status Started for theBenchmark.p
% 1.72/1.07  % SZS status Unsatisfiable for theBenchmark.p
% 1.72/1.07  
% 1.72/1.07  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.72/1.07  
% 1.72/1.07  % ------  iProver source info
% 1.72/1.07  
% 1.72/1.07  % git: date: 2026-07-19 20:42:38 +0200
% 1.72/1.07  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.72/1.07  % git: non_committed_changes: false
% 1.72/1.07  
% 1.72/1.07  % ------ Parsing...% successful
% 1.72/1.07  
% 1.72/1.07  
% 1.72/1.07  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.72/1.07  
% 1.72/1.07  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.72/1.07  
% 1.72/1.07  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.72/1.07  
% 1.72/1.07  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.72/1.07  % ------ Proving...
% 1.72/1.07  % ------ Problem Properties 
% 1.72/1.07  
% 1.72/1.07  % 
% 1.72/1.07  % clauses                               32
% 1.72/1.07  % conjectures                           3
% 1.72/1.07  % EPR                                   23
% 1.72/1.07  % Horn                                  29
% 1.72/1.07  % unary                                 9
% 1.72/1.07  % binary                                6
% 1.72/1.07  % lits                                  83
% 1.72/1.07  % lits eq                               1
% 1.72/1.07  % fd_pure                               0
% 1.72/1.07  % fd_pseudo                             0
% 1.72/1.07  % fd_cond                               0
% 1.72/1.07  % fd_pseudo_cond                        0
% 1.72/1.07  % AC symbols                            0
% 1.72/1.07  
% 1.72/1.07  % ------ Schedule dynamic 5 is on 
% 1.72/1.07  
% 1.72/1.07  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.72/1.07  
% 1.72/1.07  
% 1.72/1.07  % ------ 
% 1.72/1.07  % Current options:
% 1.72/1.07  % ------ 
% 1.72/1.07  
% 1.72/1.07  
% 1.72/1.07  % 
% 1.72/1.07  
% 1.72/1.07  % ------ Proving...
% 1.72/1.07  % 
% 1.72/1.07  
% 1.72/1.07  % SZS status Unsatisfiable for theBenchmark.p
% 1.72/1.07  
% 1.72/1.07  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.72/1.07  
% 1.72/1.07  
%------------------------------------------------------------------------------