↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP711+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 : n001.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:35:17 PM UTC 2026

% Result   : Theorem 6.93s 1.74s
% Output   : CNFRefutation 6.93s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f19ERROR: Could not build tree for root c_7101ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : mult(X0,unit) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).

fof(f2,axiom,
    ! [X0] : mult(unit,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).

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

fof(f4,axiom,
    ! [X0] : mult(X0,i(X0)) = unit,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).

fof(f5,axiom,
    ! [X0] : mult(i(X0),X0) = unit,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).

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

fof(f7,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( mult(X1,X0) = mult(X2,X0)
         => X1 = X2 )
        & ( mult(X0,X1) = mult(X0,X2)
         => X1 = X2 ) ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

fof(f8,plain,
    ? [X0,X1,X2] :
      ( ( mult(X1,X0) = mult(X2,X0)
        & X1 != X2 )
      | ( mult(X0,X1) = mult(X0,X2)
        & X1 != X2 ) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f9,plain,
    ( ( mult(sK1,sK0) = mult(sK2,sK0)
      & sK1 != sK2 )
    | ( mult(sK0,sK1) = mult(sK0,sK2)
      & sK1 != sK2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f8]) ).

fof(f10,plain,
    ! [X0] : mult(X0,unit) = X0,
    inference(cnf_transformation,[],[f1]) ).

fof(f11,plain,
    ! [X0] : mult(unit,X0) = X0,
    inference(cnf_transformation,[],[f2]) ).

fof(f12,plain,
    ! [X2,X0,X1] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(mult(X2,X1),X1),X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f13,plain,
    ! [X0] : unit = mult(X0,i(X0)),
    inference(cnf_transformation,[],[f4]) ).

fof(f14,plain,
    ! [X0] : unit = mult(i(X0),X0),
    inference(cnf_transformation,[],[f5]) ).

fof(f15,plain,
    ( mult(sK1,sK0) = mult(sK2,sK0)
    | mult(sK0,sK1) = mult(sK0,sK2) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_49,plain,
    ! [X0: $i] : mult(X0,unit) = X0,
    inference(cnf_transformation,[],[f10]) ).

tcf(c_50,plain,
    ! [X0: $i] : mult(unit,X0) = X0,
    inference(cnf_transformation,[],[f11]) ).

tcf(c_51,plain,
    ! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,X1),X1),X2) = mult(X0,mult(X1,mult(X1,X2))),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_52,plain,
    ! [X0: $i] : mult(X0,i(X0)) = unit,
    inference(cnf_transformation,[],[f13]) ).

tcf(c_53,plain,
    ! [X0: $i] : mult(i(X0),X0) = unit,
    inference(cnf_transformation,[],[f14]) ).

tcf(c_54,negated_conjecture,
    sK1 != sK2,
    inference(cnf_transformation,[],[f19]) ).

tcf(c_57,negated_conjecture,
    ( ( mult(sK0,sK1) = mult(sK0,sK2) )
    | ( mult(sK1,sK0) = mult(sK2,sK0) ) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_109,definition,
    iPr_def_10 = mult(sK1,sK0),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_110,definition,
    iPr_def_11 = mult(sK2,sK0),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_111,definition,
    iPr_def_12 = mult(sK0,sK1),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_112,definition,
    iPr_def_13 = mult(sK0,sK2),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_113,negated_conjecture,
    ( ( iPr_def_12 = iPr_def_13 )
    | ( iPr_def_10 = iPr_def_11 ) ),
    inference(demodulation,[status(thm)],[c_57,c_112,c_111,c_110,c_109]) ).

tcf(c_114,negated_conjecture,
    sK1 != sK2,
    inference(demodulation,[status(thm)],[c_54]) ).

tcf(c_166,plain,
    ! [X0: $i] : mult(sK1,mult(sK0,mult(sK0,X0))) = mult(mult(iPr_def_10,sK0),X0),
    inference(superposition,[status(thm)],[c_109,c_51]) ).

tcf(c_167,plain,
    ! [X0: $i] : mult(sK2,mult(sK0,mult(sK0,X0))) = mult(mult(iPr_def_11,sK0),X0),
    inference(superposition,[status(thm)],[c_110,c_51]) ).

tcf(c_170,plain,
    ! [X0: $i,X1: $i] : mult(X0,mult(X1,mult(X1,unit))) = mult(mult(X0,X1),X1),
    inference(superposition,[status(thm)],[c_51,c_49]) ).

tcf(c_192,plain,
    ! [X0: $i,X1: $i] : mult(i(X0),mult(X0,mult(X0,X1))) = mult(mult(unit,X0),X1),
    inference(superposition,[status(thm)],[c_53,c_51]) ).

tcf(c_193,plain,
    ! [X0: $i,X1: $i] : mult(i(X0),mult(X0,mult(X0,X1))) = mult(X0,X1),
    inference(light_normalisation,[status(thm)],[c_192,c_50]) ).

tcf(c_200,plain,
    ! [X0: $i] : mult(i(X0),mult(X0,X0)) = X0,
    inference(superposition,[status(thm)],[c_49,c_193]) ).

tcf(c_207,plain,
    mult(i(sK0),mult(sK0,iPr_def_12)) = iPr_def_12,
    inference(superposition,[status(thm)],[c_111,c_193]) ).

tcf(c_209,plain,
    ! [X0: $i,X1: $i] : mult(i(i(X0)),mult(i(X0),mult(X0,X1))) = mult(X0,X1),
    inference(superposition,[status(thm)],[c_193,c_193]) ).

tcf(c_240,plain,
    ! [X0: $i] : mult(i(i(X0)),mult(i(X0),X0)) = X0,
    inference(superposition,[status(thm)],[c_200,c_193]) ).

tcf(c_243,plain,
    ! [X0: $i] : mult(i(i(X0)),unit) = X0,
    inference(light_normalisation,[status(thm)],[c_240,c_53]) ).

tcf(c_258,plain,
    ! [X0: $i] : i(i(X0)) = X0,
    inference(demodulation,[status(thm)],[c_243,c_49]) ).

tcf(c_275,plain,
    mult(i(i(sK0)),mult(i(sK0),iPr_def_12)) = iPr_def_12,
    inference(superposition,[status(thm)],[c_207,c_193]) ).

tcf(c_428,plain,
    mult(sK0,mult(i(sK0),iPr_def_12)) = iPr_def_12,
    inference(demodulation,[status(thm)],[c_275,c_258]) ).

tcf(c_879,plain,
    ! [X0: $i,X1: $i] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
    inference(demodulation,[status(thm)],[c_170,c_49]) ).

tcf(c_880,plain,
    ! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X1)),X2) = mult(X0,mult(X1,mult(X1,X2))),
    inference(demodulation,[status(thm)],[c_51,c_879]) ).

tcf(c_1868,plain,
    ! [X0: $i,X1: $i] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(unit,X1),
    inference(superposition,[status(thm)],[c_53,c_880]) ).

tcf(c_3515,plain,
    ! [X0: $i,X1: $i] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = X1,
    inference(demodulation,[status(thm)],[c_1868,c_50]) ).

tcf(c_3543,plain,
    mult(i(mult(sK0,sK0)),mult(sK0,iPr_def_13)) = sK2,
    inference(superposition,[status(thm)],[c_112,c_3515]) ).

tcf(c_3566,plain,
    mult(i(mult(sK0,sK0)),mult(sK0,iPr_def_12)) = mult(i(sK0),iPr_def_12),
    inference(superposition,[status(thm)],[c_428,c_3515]) ).

tcf(c_3976,plain,
    ( ( iPr_def_10 = iPr_def_11 )
    | ( mult(i(mult(sK0,sK0)),mult(sK0,iPr_def_12)) = sK2 ) ),
    inference(superposition,[status(thm)],[c_113,c_3543]) ).

tcf(c_3980,plain,
    ( ( iPr_def_10 = iPr_def_11 )
    | ( mult(i(sK0),iPr_def_12) = sK2 ) ),
    inference(light_normalisation,[status(thm)],[c_3976,c_3566]) ).

tcf(c_5647,plain,
    ! [X0: $i,X1: $i] : mult(X0,mult(i(X0),mult(X0,X1))) = mult(X0,X1),
    inference(light_normalisation,[status(thm)],[c_209,c_258]) ).

tcf(c_5742,plain,
    ! [X0: $i,X1: $i] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(i(X0),mult(X0,X1)),
    inference(superposition,[status(thm)],[c_5647,c_3515]) ).

tcf(c_5766,plain,
    ! [X0: $i,X1: $i] : mult(i(X0),mult(X0,X1)) = X1,
    inference(light_normalisation,[status(thm)],[c_5742,c_3515]) ).

tcf(c_5979,plain,
    mult(i(sK0),iPr_def_12) = sK1,
    inference(superposition,[status(thm)],[c_111,c_5766]) ).

tcf(c_6102,plain,
    ( ( iPr_def_10 = iPr_def_11 )
    | ( sK1 = sK2 ) ),
    inference(demodulation,[status(thm)],[c_3980,c_5979]) ).

tcf(c_6103,plain,
    iPr_def_10 = iPr_def_11,
    inference(forward_subsumption_resolution,[status(thm)],[c_6102,c_114]) ).

tcf(c_6110,plain,
    ! [X0: $i] : mult(sK2,mult(sK0,mult(sK0,X0))) = mult(mult(iPr_def_10,sK0),X0),
    inference(demodulation,[status(thm)],[c_167,c_6103]) ).

tcf(c_6171,plain,
    ! [X0: $i] : mult(i(sK2),mult(mult(iPr_def_10,sK0),X0)) = mult(sK0,mult(sK0,X0)),
    inference(superposition,[status(thm)],[c_6110,c_5766]) ).

tcf(c_6536,plain,
    mult(sK0,mult(sK0,i(mult(iPr_def_10,sK0)))) = mult(i(sK2),unit),
    inference(superposition,[status(thm)],[c_52,c_6171]) ).

tcf(c_6596,plain,
    mult(sK0,mult(sK0,i(mult(iPr_def_10,sK0)))) = i(sK2),
    inference(demodulation,[status(thm)],[c_6536,c_49]) ).

tcf(c_6604,plain,
    mult(mult(iPr_def_10,sK0),i(mult(iPr_def_10,sK0))) = mult(sK2,i(sK2)),
    inference(superposition,[status(thm)],[c_6596,c_6110]) ).

tcf(c_6605,plain,
    mult(mult(iPr_def_10,sK0),i(mult(iPr_def_10,sK0))) = mult(sK1,i(sK2)),
    inference(superposition,[status(thm)],[c_6596,c_166]) ).

tcf(c_6804,plain,
    mult(sK1,i(sK2)) = unit,
    inference(demodulation,[status(thm)],[c_6604,c_52,c_6605]) ).

tcf(c_6805,plain,
    mult(i(sK1),unit) = i(sK2),
    inference(superposition,[status(thm)],[c_6804,c_5766]) ).

tcf(c_7086,plain,
    i(sK1) = i(sK2),
    inference(demodulation,[status(thm)],[c_6805,c_49]) ).

tcf(c_7095,plain,
    i(i(sK1)) = sK2,
    inference(superposition,[status(thm)],[c_7086,c_258]) ).

tcf(c_7100,plain,
    sK1 = sK2,
    inference(demodulation,[status(thm)],[c_7095,c_258]) ).

tcf(c_7101,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_7100,c_114]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP711+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.09/0.35  % Computer : n001.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Wed Sep 23 15:53:50 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.39  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/0.40  
% 0.13/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40  
% 0.13/0.40  % Detected problem language: tptp
% 0.13/0.41  % Proving...
% 6.93/1.74  % SZS status Started for theBenchmark.p
% 6.93/1.74  % SZS status Theorem for theBenchmark.p
% 6.93/1.74  
% 6.93/1.74  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.93/1.74  
% 6.93/1.74  % ------  iProver source info
% 6.93/1.74  
% 6.93/1.74  % git: date: 2026-07-19 20:42:38 +0200
% 6.93/1.74  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.93/1.74  % git: non_committed_changes: false
% 6.93/1.74  
% 6.93/1.74  % ------ Parsing...
% 6.93/1.74  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 6.93/1.74  
% 6.93/1.74  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 6.93/1.74  
% 6.93/1.74  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 6.93/1.74  
% 6.93/1.74  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 6.93/1.74  % ------ Proving...
% 6.93/1.74  % ------ Problem Properties 
% 6.93/1.74  
% 6.93/1.74  % 
% 6.93/1.74  % clauses                               11
% 6.93/1.74  % conjectures                           2
% 6.93/1.74  % EPR                                   2
% 6.93/1.74  % Horn                                  10
% 6.93/1.74  % unary                                 10
% 6.93/1.74  % binary                                1
% 6.93/1.74  % lits                                  12
% 6.93/1.74  % lits eq                               12
% 6.93/1.74  % fd_pure                               0
% 6.93/1.74  % fd_pseudo                             0
% 6.93/1.74  % fd_cond                               0
% 6.93/1.74  % fd_pseudo_cond                        0
% 6.93/1.74  % AC symbols                            0
% 6.93/1.74  
% 6.93/1.74  % ------ Schedule dynamic 5 is on 
% 6.93/1.74  
% 6.93/1.74  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.93/1.74  
% 6.93/1.74  
% 6.93/1.74  % ------ 
% 6.93/1.74  % Current options:
% 6.93/1.74  % ------ 
% 6.93/1.74  
% 6.93/1.74  
% 6.93/1.74  % 
% 6.93/1.74  
% 6.93/1.74  % ------ Proving...
% 6.93/1.74  % 
% 6.93/1.74  
% 6.93/1.74  % SZS status Theorem for theBenchmark.p
% 6.93/1.74  
% 6.93/1.74  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.93/1.74  
% 6.93/1.74  
%------------------------------------------------------------------------------