↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 0.89s 1.06s
% Output   : CNFRefutation 0.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   15 (  15 unt;   0 def)
%            Number of atoms       :   15 (  14 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    6 (   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;   2 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn  13   !;   0   ?;   5   :)

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

fof(f2,axiom,
    ! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

fof(f3,axiom,
    ! [X0] : inverse(X0) = double_divide(X0,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).

fof(f4,axiom,
    ! [X0] : identity = double_divide(X0,inverse(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).

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

fof(f6,plain,
    identity != multiply(inverse(a1),a1),
    inference(reorient_equations,[],[f5]) ).

fof(f7,plain,
    ! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
    inference(definition_unfolding,[],[f4,f3]) ).

fof(f8,plain,
    identity != double_divide(double_divide(a1,double_divide(a1,identity)),identity),
    inference(definition_unfolding,[],[f6,f2,f3]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(X0,double_divide(double_divide(identity,X1),double_divide(X2,double_divide(X1,X0)))),double_divide(identity,identity)) = X2,
    inference(cnf_transformation,[],[f1]) ).

tcf(c_55,plain,
    ! [X0: $i] : double_divide(X0,double_divide(X0,identity)) = identity,
    inference(cnf_transformation,[],[f7]) ).

tcf(c_56,negated_conjecture,
    double_divide(double_divide(a1,double_divide(a1,identity)),identity) != identity,
    inference(cnf_transformation,[],[f8]) ).

tcf(c_65,plain,
    double_divide(identity,identity) != identity,
    inference(demodulation,[status(thm)],[c_56,c_55]) ).

tcf(c_96,plain,
    ! [X0: $i] : double_divide(double_divide(identity,double_divide(double_divide(identity,X0),identity)),double_divide(identity,identity)) = X0,
    inference(superposition,[status(thm)],[c_55,c_54]) ).

tcf(c_106,plain,
    double_divide(identity,identity) = identity,
    inference(superposition,[status(thm)],[c_55,c_96]) ).

tcf(c_109,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_106,c_65]) ).


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