↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP439-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 : n012.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:34:06 PM UTC 2026

% Result   : Unsatisfiable 11.64s 2.06s
% Output   : CNFRefutation 11.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (  17 unt;   0 def)
%            Number of atoms       :   17 (  16 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :   16 (   3 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-2 aty)
%            Number of variables   :   69 (   0 sgn  69   !;   0   ?;  65   :)

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

fof(f2,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).

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

tcf(c_52,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    inference(cnf_transformation,[],[f2]) ).

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

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

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

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

tcf(c_1790,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(X0,multiply(X1,multiply(multiply(inverse(X1),X2),inverse(multiply(inverse(X3),multiply(X0,X2)))))) = X3,
    inference(superposition,[status(thm)],[c_125,c_105]) ).

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

tcf(c_4310,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(inverse(X0),multiply(X0,multiply(X1,inverse(multiply(inverse(X2),X1))))) = X2,
    inference(superposition,[status(thm)],[c_1790,c_2692]) ).

tcf(c_4798,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(inverse(X0),multiply(X0,multiply(multiply(X1,multiply(X2,inverse(multiply(inverse(X3),X2)))),inverse(X3)))) = X1,
    inference(superposition,[status(thm)],[c_4310,c_4310]) ).

tcf(c_5642,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(inverse(X0),multiply(X0,multiply(multiply(X1,multiply(X2,inverse(multiply(X3,X2)))),X3))) = X1,
    inference(superposition,[status(thm)],[c_138,c_4798]) ).

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

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

tcf(c_10304,plain,
    ! [X0: $i,X1: $i] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
    inference(superposition,[status(thm)],[c_6528,c_5642]) ).

tcf(c_10319,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_52,c_10304]) ).


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