↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP511-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 : n015.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:37 PM UTC 2026

% Result   : Unsatisfiable 2.77s 1.27s
% Output   : CNFRefutation 2.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   28 (  28 unt;   0 def)
%            Number of atoms       :   28 (  27 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    7 (   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;   3 con; 0-2 aty)
%            Number of variables   :   59 (   0 sgn  59   !;   0   ?;  56   :)

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

fof(f2,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).

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

tcf(c_52,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    inference(cnf_transformation,[],[f2]) ).

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

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

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

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

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

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

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

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

tcf(c_780,plain,
    ! [X0: $i,X1: $i] : multiply(multiply(X0,X1),inverse(X1)) = X0,
    inference(light_normalisation,[status(thm)],[c_772,c_500]) ).

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

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

tcf(c_834,plain,
    ! [X0: $i] : inverse(inverse(X0)) = X0,
    inference(superposition,[status(thm)],[c_780,c_500]) ).

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

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

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

tcf(c_1053,plain,
    ! [X0: $i,X1: $i] : multiply(X0,X1) = multiply(X1,X0),
    inference(light_normalisation,[status(thm)],[c_1047,c_834]) ).

tcf(c_1054,plain,
    multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3)),
    inference(demodulation,[status(thm)],[c_52,c_1053]) ).

tcf(c_1106,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(multiply(X0,X2),X1),
    inference(demodulation,[status(thm)],[c_811,c_813]) ).

tcf(c_1128,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(multiply(X1,X2),X0),
    inference(superposition,[status(thm)],[c_1053,c_1106]) ).

tcf(c_1149,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X1,multiply(X0,X2)),
    inference(superposition,[status(thm)],[c_1106,c_1053]) ).

tcf(c_1621,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X2,X1)),
    inference(light_normalisation,[status(thm)],[c_1128,c_1149]) ).

tcf(c_1654,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X0,X2)),
    inference(superposition,[status(thm)],[c_1621,c_1053]) ).

tcf(c_1670,plain,
    multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(c3,b3)),
    inference(demodulation,[status(thm)],[c_1054,c_1654]) ).

tcf(c_1672,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_1670,c_1053]) ).


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