↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : FLD071-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 : n020.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.91s 1.29s
% Output   : CNFRefutation 1.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (  11 unt;   1 def)
%            Number of atoms       :   23 (   1 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   15 (   9   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 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 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f20,axiom,
    ! [X0,X1] :
      ( ~ less_or_equal(additive_identity,X1)
      | ~ less_or_equal(additive_identity,X0)
      | less_or_equal(additive_identity,multiply(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_multiplication) ).

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

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

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

tcf(c_100,plain,
    ! [X0: $i,X1: $i] :
      ( less_or_equal(additive_identity,multiply(X0,X1))
      | ~ less_or_equal(additive_identity,X1)
      | ~ less_or_equal(additive_identity,X0) ),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_110,negated_conjecture,
    less_or_equal(additive_identity,a),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_111,negated_conjecture,
    less_or_equal(additive_identity,b),
    inference(cnf_transformation,[],[f31]) ).

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

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

tcf(c_288,negated_conjecture,
    ~ less_or_equal(additive_identity,iPr_def_10),
    inference(demodulation,[status(thm)],[c_112,c_287]) ).

tcf(c_289,negated_conjecture,
    less_or_equal(additive_identity,b),
    inference(demodulation,[status(thm)],[c_111]) ).

tcf(c_290,negated_conjecture,
    less_or_equal(additive_identity,a),
    inference(demodulation,[status(thm)],[c_110]) ).

tcf(c_1202,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_287,c_100]) ).

tcf(c_1206,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1202,c_288,c_289,c_290]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD071-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 : n020.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:05:03 UTC 2026
% 0.11/0.37  % 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.43  
% 0.11/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43  
% 0.11/0.43  % Detected problem language: tptp
% 0.11/0.44  % Proving...
% 1.91/1.29  % SZS status Started for theBenchmark.p
% 1.91/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 1.91/1.29  
% 1.91/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.91/1.29  
% 1.91/1.29  % ------  iProver source info
% 1.91/1.29  
% 1.91/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 1.91/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.91/1.29  % git: non_committed_changes: false
% 1.91/1.29  
% 1.91/1.29  % ------ Parsing...% successful
% 1.91/1.29  
% 1.91/1.29  
% 1.91/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.91/1.29  
% 1.91/1.29  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.91/1.29  
% 1.91/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.91/1.29  
% 1.91/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.91/1.29  % ------ Proving...
% 1.91/1.29  % ------ Problem Properties 
% 1.91/1.29  
% 1.91/1.29  % 
% 1.91/1.29  % clauses                               33
% 1.91/1.29  % conjectures                           3
% 1.91/1.29  % EPR                                   15
% 1.91/1.29  % Horn                                  30
% 1.91/1.29  % unary                                 9
% 1.91/1.29  % binary                                6
% 1.91/1.29  % lits                                  79
% 1.91/1.29  % lits eq                               1
% 1.91/1.29  % fd_pure                               0
% 1.91/1.29  % fd_pseudo                             0
% 1.91/1.29  % fd_cond                               0
% 1.91/1.29  % fd_pseudo_cond                        0
% 1.91/1.29  % AC symbols                            0
% 1.91/1.29  
% 1.91/1.29  % ------ Schedule dynamic 5 is on 
% 1.91/1.29  
% 1.91/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.91/1.29  
% 1.91/1.29  
% 1.91/1.29  % ------ 
% 1.91/1.29  % Current options:
% 1.91/1.29  % ------ 
% 1.91/1.29  
% 1.91/1.29  
% 1.91/1.29  % 
% 1.91/1.29  
% 1.91/1.29  % ------ Proving...
% 1.91/1.29  % 
% 1.91/1.29  
% 1.91/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 1.91/1.29  
% 1.91/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.91/1.30  
% 1.91/1.30  
%------------------------------------------------------------------------------