↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN079+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n026.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 03:39:07 PM UTC 2026

% Result   : Theorem 1.50s 1.28s
% Output   : CNFRefutation 1.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (  18 unt;   2 def)
%            Number of atoms       :   44 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   25 (  14   ~;   9   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  16   !;   0   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    big_f(f(a,b),f(b,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel57_1) ).

fof(f2,axiom,
    big_f(f(b,c),f(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel57_2) ).

fof(f3,axiom,
    ! [X0,X1,X2] :
      ( ( big_f(X1,X2)
        & big_f(X0,X1) )
     => big_f(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel57_3) ).

fof(f4,conjecture,
    big_f(f(a,b),f(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel57) ).

fof(f5,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,plain,
    ~ big_f(f(a,b),f(a,c)),
    inference(flattening,[],[f5]) ).

fof(f7,plain,
    ! [X0,X1,X2] :
      ( ~ big_f(X1,X2)
      | ~ big_f(X0,X1)
      | big_f(X0,X2) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f8,plain,
    ! [X0,X1,X2] :
      ( ~ big_f(X1,X2)
      | ~ big_f(X0,X1)
      | big_f(X0,X2) ),
    inference(flattening,[],[f7]) ).

fof(f9,plain,
    big_f(f(a,b),f(b,c)),
    inference(cnf_transformation,[],[f1]) ).

fof(f10,plain,
    big_f(f(b,c),f(a,c)),
    inference(cnf_transformation,[],[f2]) ).

fof(f11,plain,
    ! [X2,X0,X1] :
      ( ~ big_f(X1,X2)
      | ~ big_f(X0,X1)
      | big_f(X0,X2) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f12,plain,
    ~ big_f(f(a,b),f(a,c)),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_49,plain,
    big_f(f(a,b),f(b,c)),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_50,plain,
    big_f(f(b,c),f(a,c)),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_51,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( big_f(X0,X2)
      | ~ big_f(X1,X2)
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_52,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_65,definition,
    iPr_def_10 = f(a,b),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_66,definition,
    iPr_def_11 = f(a,c),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_67,negated_conjecture,
    ~ big_f(iPr_def_10,iPr_def_11),
    inference(demodulation,[status(thm)],[c_52,c_66,c_65]) ).

tcf(c_154,plain,
    big_f(iPr_def_10,f(b,c)),
    inference(light_normalisation,[status(thm)],[c_49,c_65]) ).

tcf(c_155,plain,
    big_f(f(b,c),iPr_def_11),
    inference(light_normalisation,[status(thm)],[c_50,c_66]) ).

tcf(c_159,plain,
    ! [X0: $i] :
      ( big_f(iPr_def_10,X0)
      | ~ big_f(f(b,c),X0) ),
    inference(superposition,[status(thm)],[c_154,c_51]) ).

tcf(c_171,plain,
    big_f(iPr_def_10,iPr_def_11),
    inference(superposition,[status(thm)],[c_155,c_159]) ).

tcf(c_172,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_171,c_67]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN079+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36  % Computer : n026.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Fri Sep 25 00:09:54 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.40  Running first-order theorem proving
% 0.08/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.08/0.42  
% 0.08/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42  
% 0.08/0.42  % Detected problem language: tptp
% 0.08/0.43  % Proving...
% 1.50/1.28  % SZS status Started for theBenchmark.p
% 1.50/1.28  % SZS status Theorem for theBenchmark.p
% 1.50/1.28  
% 1.50/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.50/1.28  
% 1.50/1.28  % ------  iProver source info
% 1.50/1.28  
% 1.50/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 1.50/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.50/1.28  % git: non_committed_changes: false
% 1.50/1.28  
% 1.50/1.28  % ------ Parsing...
% 1.50/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.50/1.28  
% 1.50/1.28  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.50/1.28  
% 1.50/1.28  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.50/1.28  
% 1.50/1.28  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.50/1.28  % ------ Proving...
% 1.50/1.28  % ------ Problem Properties 
% 1.50/1.28  
% 1.50/1.28  % 
% 1.50/1.28  % clauses                               6
% 1.50/1.28  % conjectures                           1
% 1.50/1.28  % EPR                                   2
% 1.50/1.28  % Horn                                  6
% 1.50/1.28  % unary                                 5
% 1.50/1.28  % binary                                0
% 1.50/1.28  % lits                                  8
% 1.50/1.28  % lits eq                               2
% 1.50/1.28  % fd_pure                               0
% 1.50/1.28  % fd_pseudo                             0
% 1.50/1.28  % fd_cond                               0
% 1.50/1.28  % fd_pseudo_cond                        0
% 1.50/1.28  % AC symbols                            0
% 1.50/1.28  
% 1.50/1.28  % ------ Schedule dynamic 5 is on 
% 1.50/1.28  
% 1.50/1.28  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.50/1.28  
% 1.50/1.28  
% 1.50/1.28  % ------ 
% 1.50/1.28  % Current options:
% 1.50/1.28  % ------ 
% 1.50/1.28  
% 1.50/1.28  
% 1.50/1.28  % 
% 1.50/1.28  
% 1.50/1.28  % ------ Proving...
% 1.50/1.28  % 
% 1.50/1.28  
% 1.50/1.28  % SZS status Theorem for theBenchmark.p
% 1.50/1.28  
% 1.50/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.50/1.28  
% 1.50/1.28  
%------------------------------------------------------------------------------