↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP544-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n016.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:41 PM UTC 2026

% Result   : Unsatisfiable 2.08s 1.28s
% Output   : CNFRefutation 2.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (  16 unt;   0 def)
%            Number of atoms       :   16 (  15 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 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;   3 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn  23   !;   0   ?;  17   :)

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

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

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

fof(f5,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).

fof(f6,plain,
    divide(a,divide(identity,b)) != divide(b,divide(identity,a)),
    inference(definition_unfolding,[],[f5,f2,f2]) ).

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

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

tcf(c_56,negated_conjecture,
    divide(a,divide(identity,b)) != divide(b,divide(identity,a)),
    inference(cnf_transformation,[],[f6]) ).

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

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

tcf(c_106,plain,
    ! [X0: $i] : divide(identity,divide(identity,X0)) = X0,
    inference(superposition,[status(thm)],[c_55,c_94]) ).

tcf(c_111,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
    inference(demodulation,[status(thm)],[c_94,c_106]) ).

tcf(c_121,plain,
    ! [X0: $i,X1: $i] : divide(divide(identity,X0),X1) = divide(divide(identity,X1),X0),
    inference(superposition,[status(thm)],[c_111,c_96]) ).

tcf(c_255,plain,
    ! [X0: $i,X1: $i] : divide(divide(identity,X0),divide(identity,X1)) = divide(X1,X0),
    inference(superposition,[status(thm)],[c_111,c_121]) ).

tcf(c_283,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(identity,X1)) = divide(X1,divide(identity,X0)),
    inference(superposition,[status(thm)],[c_111,c_255]) ).

tcf(c_292,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_56,c_283]) ).


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