↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP415-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 : n011.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:33:51 PM UTC 2026

% Result   : Unsatisfiable 3.84s 16.16s
% Output   : CNFRefutation 3.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (  16 unt;   0 def)
%            Number of atoms       :   16 (  15 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 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   :   42 (   0 sgn  42   !;   0   ?;  39   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : inverse(multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X1,X0)),multiply(X1,inverse(X2)))),inverse(multiply(inverse(X0),X0)))))) = X2,
    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] : inverse(multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X1,X0)),multiply(X1,inverse(X2)))),inverse(multiply(inverse(X0),X0)))))) = X2,
    inference(cnf_transformation,[],[f1]) ).

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

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

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

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

tcf(c_454,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,inverse(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),inverse(multiply(inverse(X1),X1)))))))) = X2,
    inference(superposition,[status(thm)],[c_289,c_133]) ).

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

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

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

tcf(c_2078,plain,
    ! [X0: $i,X1: $i] : inverse(multiply(inverse(multiply(inverse(X0),X0)),inverse(multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(inverse(multiply(inverse(X0),X0))),inverse(multiply(inverse(X0),X0)))))))) = multiply(inverse(X0),X0),
    inference(superposition,[status(thm)],[c_470,c_727]) ).

tcf(c_3805,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(inverse(X1),X1))))))))) = X2,
    inference(superposition,[status(thm)],[c_610,c_454]) ).

tcf(c_4248,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,inverse(multiply(inverse(X1),X1)))),multiply(X0,inverse(multiply(inverse(X1),X1)))) = multiply(inverse(X2),X2),
    inference(superposition,[status(thm)],[c_2078,c_3805]) ).

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

tcf(c_5260,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_52,c_5143]) ).


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