↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n019.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 02:36:34 PM UTC 2026

% Result   : Theorem 14.53s 12.83s
% Output   : CNFRefutation 14.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   52 (  43 unt;   4 def)
%            Number of atoms       :   95 (  64 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  18   ~;   7   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   5 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   62 (   0 sgn  59   !;   3   ?;  27   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).

fof(f2,axiom,
    ! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).

fof(f7,axiom,
    ! [X0,X1,X2] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).

fof(f8,axiom,
    ! [X0] : converse(converse(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).

fof(f9,axiom,
    ! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_additivity) ).

fof(f10,axiom,
    ! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).

fof(f14,conjecture,
    ! [X0,X1,X2] :
      ( join(X0,X1) = X1
     => ( join(composition(X2,X0),composition(X2,X1)) = composition(X2,X1)
        & join(composition(X0,X2),composition(X1,X2)) = composition(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f15,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( join(X0,X1) = X1
       => ( join(composition(X2,X0),composition(X2,X1)) = composition(X2,X1)
          & join(composition(X0,X2),composition(X1,X2)) = composition(X1,X2) ) ),
    inference(negated_conjecture,[status(cth)],[f14]) ).

fof(f16,plain,
    ? [X0,X1,X2] :
      ( join(X0,X1) = X1
      & ( composition(X2,X1) != join(composition(X2,X0),composition(X2,X1))
        | composition(X1,X2) != join(composition(X0,X2),composition(X1,X2)) ) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f17,plain,
    ( sK1 = join(sK0,sK1)
    & ( composition(sK2,sK1) != join(composition(sK2,sK0),composition(sK2,sK1))
      | composition(sK1,sK2) != join(composition(sK0,sK2),composition(sK1,sK2)) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f16]) ).

fof(f18,plain,
    sK1 = join(sK0,sK1),
    inference(cnf_transformation,[],[f17]) ).

fof(f19,plain,
    ( composition(sK2,sK1) != join(composition(sK2,sK0),composition(sK2,sK1))
    | composition(sK1,sK2) != join(composition(sK0,sK2),composition(sK1,sK2)) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f20,plain,
    ! [X2,X0,X1] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
    inference(cnf_transformation,[],[f7]) ).

fof(f21,plain,
    ! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    inference(cnf_transformation,[],[f2]) ).

fof(f22,plain,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f24,plain,
    ! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
    inference(cnf_transformation,[],[f10]) ).

fof(f27,plain,
    ! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
    inference(cnf_transformation,[],[f9]) ).

fof(f28,plain,
    ! [X0] : converse(converse(X0)) = X0,
    inference(cnf_transformation,[],[f8]) ).

tcf(c_49,negated_conjecture,
    ( ( join(composition(sK0,sK2),composition(sK1,sK2)) != composition(sK1,sK2) )
    | ( join(composition(sK2,sK0),composition(sK2,sK1)) != composition(sK2,sK1) ) ),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_50,negated_conjecture,
    join(sK0,sK1) = sK1,
    inference(cnf_transformation,[],[f18]) ).

tcf(c_51,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(composition(X0,X1),composition(X2,X1)) = composition(join(X0,X2),X1),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_52,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
    inference(cnf_transformation,[],[f21]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_55,plain,
    ! [X0: $i,X1: $i] : composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
    inference(cnf_transformation,[],[f24]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i] : join(converse(X0),converse(X1)) = converse(join(X0,X1)),
    inference(cnf_transformation,[],[f27]) ).

tcf(c_59,plain,
    ! [X0: $i] : converse(converse(X0)) = X0,
    inference(cnf_transformation,[],[f28]) ).

tcf(c_69,negated_conjecture,
    ( ( join(composition(sK2,sK1),composition(sK2,sK0)) != composition(sK2,sK1) )
    | ( join(composition(sK1,sK2),composition(sK0,sK2)) != composition(sK1,sK2) ) ),
    inference(theory_normalisation,[status(thm)],[c_49,c_52,c_53]) ).

tcf(c_70,negated_conjecture,
    join(sK1,sK0) = sK1,
    inference(theory_normalisation,[status(thm)],[c_50,c_52,c_53]) ).

tcf(c_99,plain,
    ( ( composition(join(sK1,sK0),sK2) != composition(sK1,sK2) )
    | ( join(composition(sK2,sK1),composition(sK2,sK0)) != composition(sK2,sK1) ) ),
    inference(ac_demodulation,[status(thm)],[c_69,c_51,c_52,c_53]) ).

tcf(c_100,plain,
    ( ( composition(sK1,sK2) != composition(sK1,sK2) )
    | ( join(composition(sK2,sK1),composition(sK2,sK0)) != composition(sK2,sK1) ) ),
    inference(light_normalisation,[status(thm)],[c_99,c_70]) ).

tcf(c_101,plain,
    join(composition(sK2,sK1),composition(sK2,sK0)) != composition(sK2,sK1),
    inference(equality_resolution_simp,[status(thm)],[c_100]) ).

tcf(c_108,definition,
    iPr_def_10 = composition(sK2,sK1),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_109,definition,
    iPr_def_11 = composition(sK2,sK0),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_110,definition,
    iPr_def_12 = join(iPr_def_10,iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_111,definition,
    iPr_def_13 = join(sK1,sK0),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_112,plain,
    iPr_def_12 != iPr_def_10,
    inference(demodulation,[status(thm)],[c_101,c_109,c_108,c_110]) ).

tcf(c_113,negated_conjecture,
    iPr_def_13 = sK1,
    inference(demodulation,[status(thm)],[c_70,c_111]) ).

tcf(c_183,plain,
    composition(sK2,iPr_def_13) = iPr_def_10,
    inference(light_normalisation,[status(thm)],[c_108,c_113]) ).

tcf(c_184,plain,
    join(iPr_def_13,sK0) = iPr_def_13,
    inference(light_normalisation,[status(thm)],[c_111,c_113]) ).

tcf(c_193,plain,
    ! [X0: $i,X1: $i] : converse(join(converse(X0),X1)) = join(X0,converse(X1)),
    inference(superposition,[status(thm)],[c_59,c_58]) ).

tcf(c_290,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(converse(composition(X0,X1)),composition(X2,converse(X0))) = composition(join(converse(X1),X2),converse(X0)),
    inference(superposition,[status(thm)],[c_55,c_51]) ).

tcf(c_360,plain,
    ! [X0: $i,X1: $i,X2: $i] : composition(join(X0,converse(X1)),converse(X2)) = converse(composition(X2,join(converse(X0),X1))),
    inference(superposition,[status(thm)],[c_193,c_55]) ).

tcf(c_8192,plain,
    ! [X0: $i,X1: $i,X2: $i] : composition(join(converse(X0),converse(X1)),converse(X2)) = converse(composition(X2,join(X0,X1))),
    inference(superposition,[status(thm)],[c_59,c_360]) ).

tcf(c_12357,plain,
    ! [X0: $i] : composition(join(converse(iPr_def_13),X0),converse(sK2)) = join(converse(iPr_def_10),composition(X0,converse(sK2))),
    inference(superposition,[status(thm)],[c_183,c_290]) ).

tcf(c_12569,plain,
    ! [X0: $i] : composition(join(converse(iPr_def_13),converse(X0)),converse(sK2)) = join(converse(iPr_def_10),converse(composition(sK2,X0))),
    inference(superposition,[status(thm)],[c_55,c_12357]) ).

tcf(c_12590,plain,
    ! [X0: $i] : converse(composition(sK2,join(iPr_def_13,X0))) = converse(join(iPr_def_10,composition(sK2,X0))),
    inference(demodulation,[status(thm)],[c_12569,c_58,c_8192]) ).

tcf(c_12595,plain,
    converse(composition(sK2,join(iPr_def_13,sK0))) = converse(join(iPr_def_10,iPr_def_11)),
    inference(superposition,[status(thm)],[c_109,c_12590]) ).

tcf(c_12648,plain,
    converse(iPr_def_10) = converse(iPr_def_12),
    inference(light_normalisation,[status(thm)],[c_12595,c_110,c_183,c_184]) ).

tcf(c_12710,plain,
    converse(converse(iPr_def_10)) = iPr_def_12,
    inference(superposition,[status(thm)],[c_12648,c_59]) ).

tcf(c_12815,plain,
    iPr_def_10 = iPr_def_12,
    inference(demodulation,[status(thm)],[c_12710,c_59]) ).

tcf(c_12836,plain,
    iPr_def_10 != iPr_def_10,
    inference(demodulation,[status(thm)],[c_112,c_12815]) ).

tcf(c_12837,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_12836]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : REL009+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/10.37  % Computer : n019.cluster.edu
% 0.10/10.37  % Model    : x86_64 x86_64
% 0.10/10.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.37  % Memory   : 8046.5625MB
% 0.10/10.37  % OS       : Linux 6.8.0-71-generic
% 0.10/10.37  % CPULimit : 300
% 0.10/10.37  % WCLimit  : 300
% 0.10/10.37  % DateTime : Thu Sep 24 07:08:32 UTC 2026
% 0.10/10.37  % CPUTime  : 
% 0.10/10.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/10.41  Running first-order theorem proving
% 0.13/10.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.13/10.43  
% 0.13/10.43  % ======== iProver multi-core TPTP/SMT =========
% 0.13/10.43  
% 0.13/10.43  % Detected problem language: tptp
% 0.13/10.44  % Proving...
% 14.53/12.83  % SZS status Started for theBenchmark.p
% 14.53/12.83  % SZS status Theorem for theBenchmark.p
% 14.53/12.83  
% 14.53/12.83  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 14.53/12.83  
% 14.53/12.83  % ------  iProver source info
% 14.53/12.83  
% 14.53/12.83  % git: date: 2026-07-19 20:42:38 +0200
% 14.53/12.83  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 14.53/12.83  % git: non_committed_changes: false
% 14.53/12.83  
% 14.53/12.83  % ------ Parsing...
% 14.53/12.83  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 14.53/12.83  
% 14.53/12.83  % ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 14.53/12.83  
% 14.53/12.83  % ------ Preprocessing...% ------  preprocesses with Option_UEQ
% 14.53/12.83   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 14.53/12.83  
% 14.53/12.83  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 14.53/12.83  % ------ Proving...
% 14.53/12.83  % ------ Problem Properties 
% 14.53/12.83  
% 14.53/12.83  % 
% 14.53/12.83  % clauses                               15
% 14.53/12.83  % conjectures                           1
% 14.53/12.83  % EPR                                   2
% 14.53/12.83  % Horn                                  15
% 14.53/12.83  % unary                                 15
% 14.53/12.83  % binary                                0
% 14.53/12.83  % lits                                  15
% 14.53/12.83  % lits eq                               15
% 14.53/12.83  % fd_pure                               0
% 14.53/12.83  % fd_pseudo                             0
% 14.53/12.83  % fd_cond                               0
% 14.53/12.83  % fd_pseudo_cond                        0
% 14.53/12.83  % AC symbols                            1
% 14.53/12.83  
% 14.53/12.83  % ------ Schedule UEQ
% 14.53/12.83  
% 14.53/12.83  % ------ Option_UEQ Time Limit: 10.
% 14.53/12.83  
% 14.53/12.83  
% 14.53/12.83  % ------ 
% 14.53/12.83  % Current options:
% 14.53/12.83  % ------ 
% 14.53/12.83  
% 14.53/12.83  
% 14.53/12.83  % 
% 14.53/12.83  
% 14.53/12.83  % ------ Proving...
% 14.53/12.83  % 
% 14.53/12.83  
% 14.53/12.83  % SZS status Theorem for theBenchmark.p
% 14.53/12.83  
% 14.53/12.83  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.53/12.83  
% 14.53/12.83  
%------------------------------------------------------------------------------