↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP698-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 : n004.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:14 PM UTC 2026

% Result   : Unsatisfiable 8.64s 2.10s
% Output   : CNFRefutation 8.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   45 (  45 unt;   0 def)
%            Number of atoms       :   45 (  44 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   77 (   0 sgn  77   !;   0   ?;  64   :)

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

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

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

fof(f4,axiom,
    ! [X0,X1] : rd(mult(X0,X1),X1) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).

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

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

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

fof(f9,negated_conjecture,
    mult(a,mult(b,c)) != mult(rd(mult(a,b),a),mult(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
    inference(cnf_transformation,[],[f1]) ).

tcf(c_59,plain,
    ! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
    inference(cnf_transformation,[],[f2]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f3]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f4]) ).

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

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

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

tcf(c_66,negated_conjecture,
    mult(rd(mult(a,b),a),mult(a,c)) != mult(a,mult(b,c)),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_160,plain,
    ! [X0: $i,X1: $i] : ld(rd(X0,X1),X0) = X1,
    inference(superposition,[status(thm)],[c_60,c_59]) ).

tcf(c_168,plain,
    ! [X0: $i] : rd(X0,X0) = unit,
    inference(superposition,[status(thm)],[c_63,c_61]) ).

tcf(c_183,plain,
    ! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(mult(mult(ld(X0,X1),X0),X0),X2)) = mult(mult(X1,X0),mult(X0,X2)),
    inference(superposition,[status(thm)],[c_58,c_64]) ).

tcf(c_190,plain,
    ! [X0: $i,X1: $i] : mult(X0,mult(mult(mult(X1,X0),X0),unit)) = mult(mult(mult(X0,X1),X0),X0),
    inference(superposition,[status(thm)],[c_62,c_64]) ).

tcf(c_262,plain,
    ! [X0: $i,X1: $i] : mult(mult(mult(X0,X1),X0),X0) = mult(X0,mult(mult(X1,X0),X0)),
    inference(demodulation,[status(thm)],[c_190,c_62]) ).

tcf(c_267,plain,
    ! [X0: $i,X1: $i] : mult(X0,mult(mult(ld(X0,X1),X0),X0)) = mult(mult(X1,X0),X0),
    inference(superposition,[status(thm)],[c_58,c_262]) ).

tcf(c_320,plain,
    ! [X0: $i,X1: $i] : rd(mult(mult(X0,X1),X1),mult(mult(ld(X1,X0),X1),X1)) = X1,
    inference(superposition,[status(thm)],[c_267,c_61]) ).

tcf(c_340,plain,
    ! [X0: $i] : rd(mult(X0,X0),mult(mult(ld(X0,unit),X0),X0)) = X0,
    inference(superposition,[status(thm)],[c_63,c_320]) ).

tcf(c_405,plain,
    ! [X0: $i] : mult(mult(ld(X0,unit),X0),X0) = ld(X0,mult(X0,X0)),
    inference(superposition,[status(thm)],[c_340,c_160]) ).

tcf(c_451,plain,
    ! [X0: $i] : mult(mult(ld(X0,unit),X0),X0) = X0,
    inference(demodulation,[status(thm)],[c_405,c_59]) ).

tcf(c_460,plain,
    ! [X0: $i] : mult(ld(X0,unit),X0) = rd(X0,X0),
    inference(superposition,[status(thm)],[c_451,c_61]) ).

tcf(c_471,plain,
    ! [X0: $i] : mult(ld(X0,unit),X0) = unit,
    inference(light_normalisation,[status(thm)],[c_460,c_168]) ).

tcf(c_688,plain,
    ! [X0: $i] : mult(X0,rd(unit,X0)) = unit,
    inference(superposition,[status(thm)],[c_160,c_471]) ).

tcf(c_749,plain,
    ! [X0: $i] : rd(unit,rd(unit,X0)) = X0,
    inference(superposition,[status(thm)],[c_688,c_61]) ).

tcf(c_754,plain,
    ! [X0: $i,X1: $i] : mult(mult(X0,X1),mult(X1,rd(unit,mult(mult(ld(X1,X0),X1),X1)))) = mult(X1,unit),
    inference(superposition,[status(thm)],[c_688,c_183]) ).

tcf(c_863,plain,
    ! [X0: $i,X1: $i] : mult(mult(X0,X1),mult(X1,rd(unit,mult(mult(ld(X1,X0),X1),X1)))) = X1,
    inference(demodulation,[status(thm)],[c_754,c_62]) ).

tcf(c_891,plain,
    ! [X0: $i,X1: $i] : mult(X0,rd(unit,mult(mult(ld(X0,X1),X0),X0))) = ld(mult(X1,X0),X0),
    inference(superposition,[status(thm)],[c_863,c_59]) ).

tcf(c_973,plain,
    ! [X0: $i,X1: $i] : rd(unit,mult(mult(ld(X0,X1),X0),X0)) = ld(X0,ld(mult(X1,X0),X0)),
    inference(superposition,[status(thm)],[c_891,c_59]) ).

tcf(c_1276,plain,
    ! [X0: $i,X1: $i] : rd(unit,ld(X0,ld(mult(X1,X0),X0))) = mult(mult(ld(X0,X1),X0),X0),
    inference(superposition,[status(thm)],[c_973,c_749]) ).

tcf(c_1527,plain,
    ! [X0: $i,X1: $i] : mult(mult(ld(X0,rd(X1,X0)),X0),X0) = rd(unit,ld(X0,ld(X1,X0))),
    inference(superposition,[status(thm)],[c_60,c_1276]) ).

tcf(c_1649,plain,
    ! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(rd(unit,ld(X0,ld(X1,X0))),X2)) = mult(mult(rd(X1,X0),X0),mult(X0,X2)),
    inference(superposition,[status(thm)],[c_1527,c_183]) ).

tcf(c_1652,plain,
    ! [X0: $i,X1: $i] : rd(mult(mult(rd(X0,X1),X1),X1),rd(unit,ld(X1,ld(X0,X1)))) = X1,
    inference(superposition,[status(thm)],[c_1527,c_320]) ).

tcf(c_1656,plain,
    ! [X0: $i,X1: $i] : rd(mult(X0,X1),rd(unit,ld(X1,ld(X0,X1)))) = X1,
    inference(light_normalisation,[status(thm)],[c_1652,c_60]) ).

tcf(c_1879,plain,
    ! [X0: $i,X1: $i] : rd(unit,ld(X0,ld(X1,X0))) = ld(X0,mult(X1,X0)),
    inference(superposition,[status(thm)],[c_1656,c_160]) ).

tcf(c_18016,plain,
    ! [X0: $i,X1: $i,X2: $i] : mult(mult(rd(X0,X1),X1),mult(X1,X2)) = mult(X1,mult(ld(X1,mult(X0,X1)),X2)),
    inference(light_normalisation,[status(thm)],[c_1649,c_1879]) ).

tcf(c_18017,plain,
    ! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(ld(X0,mult(X1,X0)),X2)) = mult(X1,mult(X0,X2)),
    inference(light_normalisation,[status(thm)],[c_18016,c_60]) ).

tcf(c_18037,plain,
    ! [X0: $i,X1: $i,X2: $i] : mult(rd(X0,X1),mult(X1,X2)) = mult(X1,mult(ld(X1,X0),X2)),
    inference(superposition,[status(thm)],[c_60,c_18017]) ).

tcf(c_18193,plain,
    mult(a,mult(ld(a,mult(a,b)),c)) != mult(a,mult(b,c)),
    inference(demodulation,[status(thm)],[c_66,c_18037]) ).

tcf(c_18194,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_18193,c_59]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP698-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/0.36  % Computer : n004.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Wed Sep 23 15:44:37 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40  Running UEQ theorem proving
% 0.10/0.40  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.41  
% 0.10/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41  
% 0.10/0.41  % Detected problem language: tptp
% 0.10/0.42  % Proving...
% 8.64/2.10  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 8.64/2.10  % SZS status Started for theBenchmark.p
% 8.64/2.10  % SZS status Unsatisfiable for theBenchmark.p
% 8.64/2.10  
% 8.64/2.10  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.64/2.10  
% 8.64/2.10  % ------  iProver source info
% 8.64/2.10  
% 8.64/2.10  % git: date: 2026-07-19 20:42:38 +0200
% 8.64/2.10  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.64/2.10  % git: non_committed_changes: false
% 8.64/2.10  
% 8.64/2.10  % ------ Parsing...% successful
% 8.64/2.10  
% 8.64/2.10  
% 8.64/2.10  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 8.64/2.10  
% 8.64/2.10  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 8.64/2.10  
% 8.64/2.10  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 8.64/2.10  
% 8.64/2.10  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 8.64/2.10  % ------ Proving...
% 8.64/2.10  % ------ Problem Properties 
% 8.64/2.10  
% 8.64/2.10  % 
% 8.64/2.10  % clauses                               9
% 8.64/2.10  % conjectures                           1
% 8.64/2.10  % EPR                                   0
% 8.64/2.10  % Horn                                  9
% 8.64/2.10  % unary                                 9
% 8.64/2.10  % binary                                0
% 8.64/2.10  % lits                                  9
% 8.64/2.10  % lits eq                               9
% 8.64/2.10  % fd_pure                               0
% 8.64/2.10  % fd_pseudo                             0
% 8.64/2.10  % fd_cond                               0
% 8.64/2.10  % fd_pseudo_cond                        0
% 8.64/2.10  % AC symbols                            0
% 8.64/2.10  
% 8.64/2.10  % ------ Input Options Time Limit: Unbounded
% 8.64/2.10  
% 8.64/2.10  
% 8.64/2.10  % ------ 
% 8.64/2.10  % Current options:
% 8.64/2.10  % ------ 
% 8.64/2.10  
% 8.64/2.10  
% 8.64/2.10  % 
% 8.64/2.10  
% 8.64/2.10  % ------ Proving...
% 8.64/2.10  % 
% 8.64/2.10  
% 8.64/2.10  % SZS status Unsatisfiable for theBenchmark.p
% 8.64/2.10  
% 8.64/2.10  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.64/2.10  
% 8.64/2.10  
%------------------------------------------------------------------------------