↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.49s 11.30s
% Output   : CNFRefutation 2.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (  14 unt;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   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;   2 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn  21   !;   0   ?;  16   :)

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

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

fof(f3,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).

fof(f4,plain,
    a2 != multiply(multiply(inverse(b2),b2),a2),
    inference(reorient_equations,[],[f3]) ).

fof(f5,plain,
    a2 != divide(divide(inverse(b2),inverse(b2)),inverse(a2)),
    inference(definition_unfolding,[],[f4,f2,f2]) ).

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

tcf(c_53,negated_conjecture,
    divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
    inference(cnf_transformation,[],[f5]) ).

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

tcf(c_98,plain,
    ! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X1))) = X0,
    inference(superposition,[status(thm)],[c_52,c_94]) ).

tcf(c_118,plain,
    ! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X0))) = X1,
    inference(superposition,[status(thm)],[c_98,c_94]) ).

tcf(c_135,plain,
    ! [X0: $i,X1: $i] : divide(inverse(divide(X0,X0)),inverse(X1)) = X1,
    inference(superposition,[status(thm)],[c_98,c_118]) ).

tcf(c_209,plain,
    ! [X0: $i,X1: $i] : inverse(divide(X0,X0)) = divide(X1,X1),
    inference(superposition,[status(thm)],[c_135,c_98]) ).

tcf(c_276,plain,
    ! [X0: $i] : divide(inverse(divide(X0,X0)),inverse(a2)) != a2,
    inference(superposition,[status(thm)],[c_209,c_53]) ).

tcf(c_289,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_276,c_135]) ).


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