↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : BOO071-1 : TPTP v9.3.1. Released v2.6.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:20 PM UTC 2026

% Result   : Unsatisfiable 4.39s 1.28s
% Output   : CNFRefutation 4.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   21 (  21 unt;   0 def)
%            Number of atoms       :   21 (  20 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :   10 (   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    :    4 (   4 usr;   2 con; 0-3 aty)
%            Number of variables   :   86 (   0 sgn  86   !;   0   ?;  79   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1,X6,X4,X5] : multiply(multiply(X0,inverse(X0),X1),inverse(multiply(multiply(X2,X3,X4),X5,multiply(X2,X3,X6))),multiply(X3,multiply(X6,X5,X4),X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

fof(f2,negated_conjecture,
    multiply(inverse(b),b,a) != a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_tba_axioms_5) ).

fof(f3,plain,
    a != multiply(inverse(b),b,a),
    inference(reorient_equations,[],[f2]) ).

tcf(c_51,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] : multiply(multiply(X0,inverse(X0),X1),inverse(multiply(multiply(X2,X3,X4),X5,multiply(X2,X3,X6))),multiply(X3,multiply(X6,X5,X4),X2)) = X1,
    inference(cnf_transformation,[],[f1]) ).

tcf(c_52,negated_conjecture,
    multiply(inverse(b),b,a) != a,
    inference(cnf_transformation,[],[f3]) ).

tcf(c_97,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i,X8: $i] : multiply(multiply(X0,X1,X2),inverse(multiply(multiply(X3,X4,X5),X6,multiply(X3,X4,X7))),multiply(X4,multiply(X7,X6,X5),X3)) = multiply(X1,multiply(X2,inverse(multiply(X0,X1,X8)),X8),X0),
    inference(superposition,[status(thm)],[c_51,c_51]) ).

tcf(c_98,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i,X8: $i,X9: $i,X10: $i] : multiply(multiply(X0,inverse(X0),X1),inverse(multiply(X2,X3,multiply(multiply(X4,inverse(X4),X2),inverse(multiply(multiply(X5,X6,X7),X8,multiply(X5,X6,X9))),X10))),multiply(inverse(multiply(multiply(X5,X6,X7),X8,multiply(X5,X6,X9))),multiply(X10,X3,multiply(X6,multiply(X9,X8,X7),X5)),multiply(X4,inverse(X4),X2))) = X1,
    inference(superposition,[status(thm)],[c_51,c_51]) ).

tcf(c_131,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(inverse(X0),multiply(X1,inverse(multiply(X0,inverse(X0),X2)),X2),X0) = X1,
    inference(superposition,[status(thm)],[c_97,c_51]) ).

tcf(c_282,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] : multiply(multiply(X0,inverse(X0),X1),inverse(multiply(multiply(X2,X3,X4),multiply(X5,inverse(multiply(X4,inverse(X4),X6)),X6),multiply(X2,X3,inverse(X4)))),multiply(X3,X5,X2)) = X1,
    inference(superposition,[status(thm)],[c_131,c_51]) ).

tcf(c_757,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] : multiply(multiply(X0,inverse(X0),X1),inverse(X2),multiply(inverse(X3),multiply(X4,inverse(multiply(multiply(X4,X3,X5),multiply(inverse(X3),inverse(multiply(X5,inverse(X5),X6)),X6),multiply(X4,X3,inverse(X5)))),X2),X3)) = X1,
    inference(superposition,[status(thm)],[c_282,c_51]) ).

tcf(c_2628,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : multiply(multiply(X0,inverse(X0),X1),inverse(multiply(X2,inverse(X2),multiply(X3,inverse(X3),X4))),multiply(inverse(X2),X4,X2)) = X1,
    inference(superposition,[status(thm)],[c_282,c_757]) ).

tcf(c_3096,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : multiply(multiply(X0,inverse(X0),X1),inverse(multiply(X2,inverse(X2),multiply(X3,inverse(X3),X4))),multiply(inverse(X2),X4,X2)) = multiply(inverse(X5),X1,X5),
    inference(superposition,[status(thm)],[c_2628,c_2628]) ).

tcf(c_3142,plain,
    ! [X0: $i,X1: $i] : multiply(inverse(X0),X1,X0) = X1,
    inference(light_normalisation,[status(thm)],[c_3096,c_2628]) ).

tcf(c_3150,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,inverse(multiply(X1,inverse(X1),X2)),X2) = X0,
    inference(demodulation,[status(thm)],[c_131,c_3142]) ).

tcf(c_3831,plain,
    ! [X0: $i,X1: $i] : inverse(multiply(X0,inverse(X0),X1)) = inverse(X1),
    inference(superposition,[status(thm)],[c_3150,c_3142]) ).

tcf(c_3835,plain,
    ! [X0: $i,X1: $i] : multiply(X0,inverse(X1),X1) = X0,
    inference(demodulation,[status(thm)],[c_3150,c_3831]) ).

tcf(c_4106,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i,X8: $i,X9: $i] : multiply(X0,inverse(multiply(X1,X2,multiply(multiply(X3,inverse(X3),X1),inverse(multiply(multiply(X4,X5,X6),X7,multiply(X4,X5,X8))),X9))),multiply(inverse(multiply(multiply(X4,X5,X6),X7,multiply(X4,X5,X8))),multiply(X9,X2,multiply(X5,multiply(X8,X7,X6),X4)),multiply(X3,inverse(X3),X1))) = X0,
    inference(superposition,[status(thm)],[c_3835,c_98]) ).

tcf(c_4128,plain,
    ! [X0: $i,X1: $i] : multiply(X0,inverse(X0),X1) = X1,
    inference(demodulation,[status(thm)],[c_98,c_4106]) ).

tcf(c_4194,plain,
    ! [X0: $i] : inverse(inverse(X0)) = X0,
    inference(superposition,[status(thm)],[c_3142,c_4128]) ).

tcf(c_4197,plain,
    ! [X0: $i,X1: $i] : multiply(inverse(X0),X0,X1) = X1,
    inference(superposition,[status(thm)],[c_4194,c_4128]) ).

tcf(c_4200,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_52,c_4197]) ).


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