↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n018.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:00:17 PM UTC 2026

% Result   : Unsatisfiable 4.55s 1.27s
% Output   : CNFRefutation 4.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   33 (  33 unt;   0 def)
%            Number of atoms       :   33 (  32 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   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  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   71 (   0 sgn  71   !;   0   ?;  51   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : add(X0,multiply(X1,multiply(X0,X2))) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1) ).

fof(f3,axiom,
    ! [X0,X1] : multiply(add(X0,X1),add(X0,inverse(X1))) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b1) ).

fof(f4,axiom,
    ! [X2,X0,X1] : multiply(X0,add(X1,add(X0,X2))) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2) ).

fof(f6,axiom,
    ! [X0,X1] : add(multiply(X0,X1),multiply(X0,inverse(X1))) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b2) ).

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

fof(f8,axiom,
    ! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_multiply) ).

fof(f9,axiom,
    ! [X2,X0,X1] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_add) ).

fof(f10,axiom,
    ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_multiply) ).

fof(f11,negated_conjecture,
    add(b,inverse(b)) != add(a,inverse(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equal_inverse) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i,X2: $i] : add(X0,multiply(X1,multiply(X0,X2))) = X0,
    inference(cnf_transformation,[],[f1]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i] : multiply(add(X0,X1),add(X0,inverse(X1))) = X0,
    inference(cnf_transformation,[],[f3]) ).

tcf(c_63,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,add(X1,add(X0,X2))) = X0,
    inference(cnf_transformation,[],[f4]) ).

tcf(c_65,plain,
    ! [X0: $i,X1: $i] : add(multiply(X0,X1),multiply(X0,inverse(X1))) = X0,
    inference(cnf_transformation,[],[f6]) ).

tcf(c_66,plain,
    ! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_67,plain,
    ! [X0: $i,X1: $i] : multiply(X0,X1) = multiply(X1,X0),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_68,plain,
    ! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_69,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_70,negated_conjecture,
    add(b,inverse(b)) != add(a,inverse(a)),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_181,plain,
    ! [X0: $i,X1: $i] : add(X0,multiply(X1,X0)) = X0,
    inference(superposition,[status(thm)],[c_63,c_60]) ).

tcf(c_254,plain,
    ! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),multiply(X2,X0)) = add(X0,X1),
    inference(superposition,[status(thm)],[c_62,c_60]) ).

tcf(c_258,plain,
    ! [X0: $i,X1: $i,X2: $i] : add(X0,add(X1,multiply(X2,X0))) = add(X0,X1),
    inference(theory_normalisation,[status(thm)],[c_254,c_69,c_67,c_68,c_66]) ).

tcf(c_277,plain,
    ! [X0: $i,X1: $i] : add(multiply(X0,X1),multiply(X1,inverse(X0))) = X1,
    inference(superposition,[status(thm)],[c_67,c_65]) ).

tcf(c_309,plain,
    ! [X0: $i,X1: $i,X2: $i] : add(X0,add(multiply(X1,X0),X2)) = add(X0,X2),
    inference(superposition,[status(thm)],[c_181,c_68]) ).

tcf(c_661,plain,
    ! [X0: $i,X1: $i] : add(multiply(X0,X1),multiply(inverse(X0),X1)) = X1,
    inference(superposition,[status(thm)],[c_67,c_277]) ).

tcf(c_1441,plain,
    ! [X0: $i,X1: $i] : add(X0,multiply(X1,inverse(X0))) = add(X0,X1),
    inference(superposition,[status(thm)],[c_65,c_309]) ).

tcf(c_1544,plain,
    ! [X0: $i,X1: $i] : add(inverse(X0),add(X0,X1)) = add(inverse(X0),X0),
    inference(superposition,[status(thm)],[c_1441,c_258]) ).

tcf(c_1547,plain,
    ! [X0: $i,X1: $i] : add(X0,add(X1,inverse(X0))) = add(X0,inverse(X0)),
    inference(theory_normalisation,[status(thm)],[c_1544,c_69,c_67,c_68,c_66]) ).

tcf(c_4117,plain,
    ! [X0: $i,X1: $i] : multiply(X0,add(X1,inverse(X1))) = X0,
    inference(superposition,[status(thm)],[c_1547,c_63]) ).

tcf(c_4210,plain,
    ! [X0: $i,X1: $i] : add(multiply(X0,add(X1,inverse(X1))),inverse(X0)) = add(X1,inverse(X1)),
    inference(superposition,[status(thm)],[c_4117,c_661]) ).

tcf(c_4222,plain,
    ! [X0: $i,X1: $i] : add(inverse(X0),multiply(X0,add(X1,inverse(X1)))) = add(X1,inverse(X1)),
    inference(theory_normalisation,[status(thm)],[c_4210,c_69,c_67,c_68,c_66]) ).

tcf(c_4223,plain,
    ! [X0: $i,X1: $i] : add(inverse(X0),X0) = add(X1,inverse(X1)),
    inference(light_normalisation,[status(thm)],[c_4222,c_4117]) ).

tcf(c_4224,plain,
    ! [X0: $i,X1: $i] : add(X0,inverse(X0)) = add(X1,inverse(X1)),
    inference(theory_normalisation,[status(thm)],[c_4223,c_69,c_67,c_68,c_66]) ).

tcf(c_4229,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_70,c_4224]) ).


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