↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP515-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 3.69s 1.32s
% Output   : CNFRefutation 3.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   26 (  26 unt;   0 def)
%            Number of atoms       :   26 (  25 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    8 (   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   :   61 (   0 sgn  61   !;   0   ?;  58   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : multiply(X0,multiply(multiply(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(X0,multiply(multiply(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_93,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : multiply(X0,multiply(X1,inverse(multiply(X0,multiply(multiply(X1,X2),inverse(multiply(X3,X2))))))) = X3,
    inference(superposition,[status(thm)],[c_51,c_51]) ).

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

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

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

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

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

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

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

tcf(c_327,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(multiply(X0,X2),X1),
    inference(superposition,[status(thm)],[c_272,c_165]) ).

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

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

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

tcf(c_518,plain,
    ! [X0: $i,X1: $i] : multiply(multiply(X0,X1),inverse(X1)) = X0,
    inference(demodulation,[status(thm)],[c_472,c_327]) ).

tcf(c_532,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X1,multiply(X0,X2)),
    inference(superposition,[status(thm)],[c_518,c_382]) ).

tcf(c_533,plain,
    ! [X0: $i,X1: $i] : multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[status(thm)],[c_518,c_116]) ).

tcf(c_539,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(X1,multiply(X2,inverse(X1)))) = multiply(X2,X0),
    inference(demodulation,[status(thm)],[c_165,c_532]) ).

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

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

tcf(c_660,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(inverse(multiply(X0,X1)),multiply(X0,multiply(X2,X1))) = X2,
    inference(demodulation,[status(thm)],[c_163,c_532,c_539]) ).

tcf(c_693,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X2,X1)),
    inference(superposition,[status(thm)],[c_660,c_590]) ).

tcf(c_1809,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X0,X2)),
    inference(superposition,[status(thm)],[c_693,c_533]) ).

tcf(c_1818,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_540,c_1809]) ).


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