↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP704-11 : TPTP v9.3.1. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n005.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:15 PM UTC 2026

% Result   : Unsatisfiable 2.44s 1.26s
% Output   : CNFRefutation 2.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   23 (  23 unt;   0 def)
%            Number of atoms       :   23 (  22 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 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  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn  26   !;   0   ?;  16   :)

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

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

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

fof(f9,axiom,
    ! [X0,X1] : mult(X0,mult(X1,op_c)) = mult(mult(X0,X1),op_c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).

fof(f11,axiom,
    ! [X0] : op_d = ld(X0,mult(op_c,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).

fof(f13,axiom,
    ! [X0,X1] : op_f = mult(X0,mult(X1,ld(mult(X0,X1),op_c))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f13) ).

fof(f14,negated_conjecture,
    mult(x4,mult(x5,op_f)) != mult(mult(x4,x5),op_f),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

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

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

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

tcf(c_71,plain,
    ! [X0: $i,X1: $i] : mult(mult(X0,X1),op_c) = mult(X0,mult(X1,op_c)),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_73,plain,
    ! [X0: $i] : ld(X0,mult(op_c,X0)) = op_d,
    inference(cnf_transformation,[],[f11]) ).

tcf(c_75,plain,
    ! [X0: $i,X1: $i] : mult(X0,mult(X1,ld(mult(X0,X1),op_c))) = op_f,
    inference(cnf_transformation,[],[f13]) ).

tcf(c_76,negated_conjecture,
    mult(mult(x4,x5),op_f) != mult(x4,mult(x5,op_f)),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_210,plain,
    ! [X0: $i] : mult(X0,op_d) = mult(op_c,X0),
    inference(superposition,[status(thm)],[c_73,c_63]) ).

tcf(c_211,plain,
    op_c = op_d,
    inference(superposition,[status(thm)],[c_73,c_64]) ).

tcf(c_261,plain,
    ! [X0: $i] : mult(X0,op_c) = mult(op_c,X0),
    inference(light_normalisation,[status(thm)],[c_210,c_211]) ).

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

tcf(c_444,plain,
    ! [X0: $i] : mult(X0,ld(mult(unit,X0),op_c)) = op_f,
    inference(superposition,[status(thm)],[c_75,c_68]) ).

tcf(c_451,plain,
    ! [X0: $i] : mult(X0,ld(X0,op_c)) = op_f,
    inference(light_normalisation,[status(thm)],[c_444,c_68]) ).

tcf(c_624,plain,
    op_c = op_f,
    inference(demodulation,[status(thm)],[c_451,c_63]) ).

tcf(c_625,plain,
    mult(mult(x4,x5),op_c) != mult(x4,mult(x5,op_c)),
    inference(demodulation,[status(thm)],[c_76,c_624]) ).

tcf(c_626,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_625,c_261,c_262]) ).


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