↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP709-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/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:16 PM UTC 2026

% Result   : Unsatisfiable 4.09s 1.44s
% Output   : CNFRefutation 4.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   33 (  33 unt;   0 def)
%            Number of atoms       :   33 (  32 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    :    6 (   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   :   54 (   0 sgn  54   !;   0   ?;  41   :)

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

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

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

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

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

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

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

fof(f10,negated_conjecture,
    mult(mult(op_c,op_c),mult(a,b)) != mult(mult(mult(op_c,op_c),a),b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

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

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

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

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

tcf(c_66,plain,
    ! [X0: $i] : mult(X0,op_c) = mult(op_c,X0),
    inference(cnf_transformation,[],[f8]) ).

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

tcf(c_68,negated_conjecture,
    mult(mult(mult(op_c,op_c),a),b) != mult(mult(op_c,op_c),mult(a,b)),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_98,plain,
    ! [X0: $i,X1: $i] : mult(X0,mult(X1,op_c)) = mult(op_c,mult(X0,X1)),
    inference(demodulation,[status(thm)],[c_67,c_66]) ).

tcf(c_155,plain,
    ! [X0: $i] : ld(unit,X0) = X0,
    inference(superposition,[status(thm)],[c_64,c_59]) ).

tcf(c_173,plain,
    ! [X0: $i,X1: $i] : mult(op_c,mult(X0,rd(X1,op_c))) = mult(X0,X1),
    inference(superposition,[status(thm)],[c_61,c_98]) ).

tcf(c_204,plain,
    ! [X0: $i] : rd(mult(op_c,X0),op_c) = X0,
    inference(superposition,[status(thm)],[c_66,c_62]) ).

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

tcf(c_225,plain,
    ! [X0: $i,X1: $i] : mult(mult(X0,mult(op_c,op_c)),X1) = mult(op_c,mult(X0,mult(op_c,X1))),
    inference(superposition,[status(thm)],[c_98,c_65]) ).

tcf(c_226,plain,
    ! [X0: $i,X1: $i,X2: $i] : mult(ld(X0,X1),mult(X0,mult(ld(X0,X1),X2))) = mult(mult(ld(X0,X1),X1),X2),
    inference(superposition,[status(thm)],[c_59,c_65]) ).

tcf(c_232,plain,
    ! [X0: $i,X1: $i] : mult(mult(op_c,mult(op_c,X0)),X1) = mult(op_c,mult(X0,mult(op_c,X1))),
    inference(superposition,[status(thm)],[c_66,c_65]) ).

tcf(c_300,plain,
    ! [X0: $i] : ld(op_c,X0) = rd(X0,op_c),
    inference(superposition,[status(thm)],[c_59,c_204]) ).

tcf(c_406,plain,
    ! [X0: $i,X1: $i] : mult(op_c,mult(X0,ld(op_c,X1))) = mult(X0,X1),
    inference(demodulation,[status(thm)],[c_173,c_300]) ).

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

tcf(c_1338,plain,
    ! [X0: $i,X1: $i] : mult(op_c,mult(op_c,mult(X0,mult(op_c,ld(op_c,X1))))) = mult(mult(X0,mult(op_c,op_c)),X1),
    inference(superposition,[status(thm)],[c_225,c_406]) ).

tcf(c_1341,plain,
    ! [X0: $i,X1: $i] : mult(op_c,mult(X0,mult(op_c,X1))) = mult(op_c,mult(op_c,mult(X0,X1))),
    inference(light_normalisation,[status(thm)],[c_1338,c_225,c_834]) ).

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

tcf(c_1825,plain,
    ! [X0: $i,X1: $i] : mult(mult(X0,X0),X1) = mult(X0,mult(X0,X1)),
    inference(light_normalisation,[status(thm)],[c_1788,c_155]) ).

tcf(c_1830,plain,
    mult(mult(op_c,mult(op_c,a)),b) != mult(mult(op_c,op_c),mult(a,b)),
    inference(demodulation,[status(thm)],[c_68,c_1825]) ).

tcf(c_2129,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_1830,c_232,c_1341,c_1825]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : GRP709-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.19/0.45  % Computer : n001.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Wed Sep 23 15:53:20 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.19/0.49  Running UEQ theorem proving
% 0.19/0.49  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.23/0.51  
% 0.23/0.51  % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.51  
% 0.23/0.51  % Detected problem language: tptp
% 0.23/0.53  % Proving...
% 4.09/1.44  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 4.09/1.44  % SZS status Started for theBenchmark.p
% 4.09/1.44  % SZS status Unsatisfiable for theBenchmark.p
% 4.09/1.44  
% 4.09/1.44  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.09/1.44  
% 4.09/1.44  % ------  iProver source info
% 4.09/1.44  
% 4.09/1.44  % git: date: 2026-07-19 20:42:38 +0200
% 4.09/1.44  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.09/1.44  % git: non_committed_changes: false
% 4.09/1.44  
% 4.09/1.44  % ------ Parsing...% successful
% 4.09/1.44  
% 4.09/1.44  
% 4.09/1.44  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 4.09/1.44  
% 4.09/1.44  % ------ Preprocessing... sup_sim: 1  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 4.09/1.44  
% 4.09/1.44  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.09/1.44  
% 4.09/1.44  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 4.09/1.44  % ------ Proving...
% 4.09/1.44  % ------ Problem Properties 
% 4.09/1.44  
% 4.09/1.44  % 
% 4.09/1.44  % clauses                               10
% 4.09/1.44  % conjectures                           1
% 4.09/1.44  % EPR                                   0
% 4.09/1.44  % Horn                                  10
% 4.09/1.44  % unary                                 10
% 4.09/1.44  % binary                                0
% 4.09/1.44  % lits                                  10
% 4.09/1.44  % lits eq                               10
% 4.09/1.44  % fd_pure                               0
% 4.09/1.44  % fd_pseudo                             0
% 4.09/1.44  % fd_cond                               0
% 4.09/1.44  % fd_pseudo_cond                        0
% 4.09/1.44  % AC symbols                            0
% 4.09/1.44  
% 4.09/1.44  % ------ Input Options Time Limit: Unbounded
% 4.09/1.44  
% 4.09/1.44  
% 4.09/1.44  % ------ 
% 4.09/1.44  % Current options:
% 4.09/1.44  % ------ 
% 4.09/1.44  
% 4.09/1.44  
% 4.09/1.44  % 
% 4.09/1.44  
% 4.09/1.44  % ------ Proving...
% 4.09/1.44  % 
% 4.09/1.44  
% 4.09/1.44  % SZS status Unsatisfiable for theBenchmark.p
% 4.09/1.44  
% 4.09/1.44  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.09/1.44  
% 4.09/1.44  
%------------------------------------------------------------------------------