↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n007.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:43 PM UTC 2026

% Result   : Unsatisfiable 1.78s 1.17s
% Output   : CNFRefutation 1.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   17 (   7 unt;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   36 (  19   ~;  17   |;   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  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn  15   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X0] :
      ( ~ defined(X0)
      | equalish(multiply(multiplicative_identity,X0),X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( ~ equalish(X2,X1)
      | ~ equalish(X0,X2)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).

fof(f25,axiom,
    ! [X2,X0,X1] :
      ( ~ equalish(X0,X2)
      | ~ defined(X1)
      | equalish(multiply(X0,X1),multiply(X2,X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).

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

fof(f30,negated_conjecture,
    equalish(m,multiplicative_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_equals_multiplicative_identity_3) ).

fof(f31,negated_conjecture,
    ~ equalish(multiply(m,a),a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_not_equal_to_a_4) ).

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

tcf(c_82,negated_conjecture,
    equalish(m,multiplicative_identity),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_83,negated_conjecture,
    ~ equalish(multiply(m,a),a),
    inference(cnf_transformation,[],[f31]) ).

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

tcf(c_89,plain,
    ! [X0: $i] :
      ( equalish(multiply(multiplicative_identity,X0),X0)
      | ~ defined(X0) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_90,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( equalish(multiply(X0,X2),multiply(X1,X2))
      | ~ defined(X2)
      | ~ equalish(X0,X1) ),
    inference(cnf_transformation,[],[f25]) ).

tcf(c_259,plain,
    ! [X0: $i] :
      ( equalish(multiply(m,a),a)
      | ~ equalish(X0,a)
      | ~ equalish(multiply(m,a),X0) ),
    inference(instantiation,[status(thm)],[c_85]) ).

tcf(c_275,plain,
    ( equalish(multiply(m,a),a)
    | ~ equalish(multiply(multiplicative_identity,a),a)
    | ~ equalish(multiply(m,a),multiply(multiplicative_identity,a)) ),
    inference(instantiation,[status(thm)],[c_259]) ).

tcf(c_276,plain,
    ( equalish(multiply(multiplicative_identity,a),a)
    | ~ defined(a) ),
    inference(instantiation,[status(thm)],[c_89]) ).

tcf(c_314,plain,
    ( equalish(multiply(m,a),multiply(multiplicative_identity,a))
    | ~ defined(a)
    | ~ equalish(m,multiplicative_identity) ),
    inference(instantiation,[status(thm)],[c_90]) ).

tcf(c_315,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_314,c_276,c_275,c_83,c_82,c_80]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD034-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n007.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:44:08 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.41  
% 0.09/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41  
% 0.09/0.41  % Detected problem language: tptp
% 0.09/0.42  % Proving...
% 1.78/1.17  % SZS status Started for theBenchmark.p
% 1.78/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 1.78/1.17  
% 1.78/1.17  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.78/1.17  
% 1.78/1.17  % ------  iProver source info
% 1.78/1.17  
% 1.78/1.17  % git: date: 2026-07-19 20:42:38 +0200
% 1.78/1.17  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.78/1.17  % git: non_committed_changes: false
% 1.78/1.17  
% 1.78/1.17  % ------ Parsing...% successful
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.78/1.17  
% 1.78/1.17  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.78/1.17  
% 1.78/1.17  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.78/1.17  % ------ Proving...
% 1.78/1.17  % ------ Problem Properties 
% 1.78/1.17  
% 1.78/1.17  % 
% 1.78/1.17  % clauses                               27
% 1.78/1.17  % conjectures                           2
% 1.78/1.17  % EPR                                   13
% 1.78/1.17  % Horn                                  26
% 1.78/1.17  % unary                                 7
% 1.78/1.17  % binary                                4
% 1.78/1.17  % lits                                  67
% 1.78/1.17  % lits eq                               0
% 1.78/1.17  % fd_pure                               0
% 1.78/1.17  % fd_pseudo                             0
% 1.78/1.17  % fd_cond                               0
% 1.78/1.17  % fd_pseudo_cond                        0
% 1.78/1.17  % AC symbols                            0
% 1.78/1.17  
% 1.78/1.17  % ------ Schedule dynamic 5 is on 
% 1.78/1.17  
% 1.78/1.17  % ------ no equalities: superposition off 
% 1.78/1.17  
% 1.78/1.17  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  % ------ 
% 1.78/1.17  % Current options:
% 1.78/1.17  % ------ 
% 1.78/1.17  
% 1.78/1.17  
% 1.78/1.17  % 
% 1.78/1.17  
% 1.78/1.17  % ------ Proving...
% 1.78/1.17  % 
% 1.78/1.17  
% 1.78/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 1.78/1.17  
% 1.78/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.78/1.17  
% 1.78/1.17  
%------------------------------------------------------------------------------