↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n001.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:22 PM UTC 2026

% Result   : Unsatisfiable 1.68s 1.94s
% Output   : CNFRefutation 1.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   34 (  34 unt;   0 def)
%            Number of atoms       :   34 (  33 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :   12 (   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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :  119 (   0 sgn 119   !;   0   ?; 113   :)

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

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

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

fof(f4,plain,
    divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
    inference(definition_unfolding,[],[f3,f2,f2,f2,f2]) ).

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

tcf(c_53,negated_conjecture,
    divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
    inference(cnf_transformation,[],[f4]) ).

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

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

tcf(c_104,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] : divide(inverse(divide(divide(divide(X0,X0),inverse(divide(divide(divide(X1,X1),inverse(divide(divide(divide(X2,X2),X3),divide(X4,divide(X3,X5))))),divide(X6,X4)))),divide(X7,X6))),X5) = X7,
    inference(superposition,[status(thm)],[c_93,c_52]) ).

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

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

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

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

tcf(c_329,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,X1),divide(X2,X1)) = divide(divide(X0,X3),divide(X2,X3)),
    inference(superposition,[status(thm)],[c_307,c_136]) ).

tcf(c_594,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(inverse(divide(divide(divide(X0,X0),X1),divide(X2,X1))),X3),divide(X4,X3)) = divide(X2,X4),
    inference(superposition,[status(thm)],[c_329,c_136]) ).

tcf(c_1660,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(X0,divide(X1,inverse(divide(divide(divide(X2,X2),X1),divide(divide(X3,X3),X4))))) = divide(X0,X4),
    inference(superposition,[status(thm)],[c_234,c_594]) ).

tcf(c_1917,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] : divide(divide(inverse(divide(divide(divide(X0,X0),X1),X2)),X3),divide(X1,X3)) = divide(X4,inverse(divide(divide(divide(X5,X5),X4),divide(divide(X6,X6),X2)))),
    inference(superposition,[status(thm)],[c_1660,c_136]) ).

tcf(c_1969,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,inverse(divide(divide(divide(X1,X1),X0),divide(divide(X2,X2),X3)))) = X3,
    inference(light_normalisation,[status(thm)],[c_1917,c_136]) ).

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

tcf(c_2421,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : divide(divide(X0,inverse(divide(divide(divide(X1,X1),X2),divide(divide(X3,X3),X2)))),X4) = divide(divide(X0,X5),divide(X4,X5)),
    inference(superposition,[status(thm)],[c_2155,c_329]) ).

tcf(c_2433,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(X2,X1)) = divide(X0,X2),
    inference(light_normalisation,[status(thm)],[c_2421,c_2155]) ).

tcf(c_2446,plain,
    ! [X0: $i,X1: $i,X2: $i] : inverse(divide(divide(divide(X0,X0),X1),divide(X2,X1))) = X2,
    inference(demodulation,[status(thm)],[c_307,c_2433]) ).

tcf(c_2447,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(X0,inverse(divide(divide(X1,X1),divide(X2,X2)))) = X0,
    inference(demodulation,[status(thm)],[c_2155,c_2433]) ).

tcf(c_2448,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(inverse(divide(divide(divide(X0,X0),X1),X2)),X1) = X2,
    inference(demodulation,[status(thm)],[c_136,c_2433]) ).

tcf(c_2683,plain,
    ! [X0: $i,X1: $i] : inverse(divide(divide(X0,X0),X1)) = X1,
    inference(demodulation,[status(thm)],[c_2446,c_2433]) ).

tcf(c_2714,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
    inference(demodulation,[status(thm)],[c_2447,c_2683]) ).

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

tcf(c_5931,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] : divide(X0,inverse(divide(divide(divide(X1,X1),inverse(divide(divide(divide(X2,X2),X3),divide(X4,divide(X3,X5))))),divide(X6,X4)))) = divide(divide(X0,X5),X6),
    inference(superposition,[status(thm)],[c_93,c_2433]) ).

tcf(c_5965,plain,
    ! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
    inference(superposition,[status(thm)],[c_2433,c_2683]) ).

tcf(c_6056,plain,
    divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
    inference(demodulation,[status(thm)],[c_53,c_5965]) ).

tcf(c_6098,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,X0),X1) = inverse(X1),
    inference(superposition,[status(thm)],[c_2714,c_5965]) ).

tcf(c_6125,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,X1),inverse(X1)) = X0,
    inference(demodulation,[status(thm)],[c_104,c_5917,c_5931,c_6098]) ).

tcf(c_6139,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,inverse(X1)),X2) = divide(X0,divide(X2,X1)),
    inference(superposition,[status(thm)],[c_6125,c_2433]) ).

tcf(c_6148,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_6056,c_6139]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP480-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.59  % Computer : n001.cluster.edu
% 0.09/0.59  % Model    : x86_64 x86_64
% 0.09/0.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.59  % Memory   : 8046.5625MB
% 0.09/0.59  % OS       : Linux 6.8.0-71-generic
% 0.09/0.59  % CPULimit : 300
% 0.09/0.59  % WCLimit  : 300
% 0.09/0.59  % DateTime : Wed Sep 23 14:58:06 UTC 2026
% 0.09/0.60  % CPUTime  : 
% 0.09/0.60  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.63  Running UEQ theorem proving
% 0.09/0.63  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.64  
% 0.15/0.64  % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.64  
% 0.15/0.64  % Detected problem language: tptp
% 0.15/0.65  % Proving...
% 1.68/1.94  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.68/1.94  % SZS status Started for theBenchmark.p
% 1.68/1.94  % SZS status Unsatisfiable for theBenchmark.p
% 1.68/1.94  
% 1.68/1.94  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.68/1.94  
% 1.68/1.94  % ------  iProver source info
% 1.68/1.94  
% 1.68/1.94  % git: date: 2026-07-19 20:42:38 +0200
% 1.68/1.94  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.68/1.94  % git: non_committed_changes: false
% 1.68/1.94  
% 1.68/1.94  % ------ Parsing...% successful
% 1.68/1.94  
% 1.68/1.94  
% 1.68/1.94  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.68/1.94  
% 1.68/1.94  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.68/1.94  
% 1.68/1.94  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.68/1.94  
% 1.68/1.94  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 1.68/1.94  % ------ Proving...
% 1.68/1.94  % ------ Problem Properties 
% 1.68/1.94  
% 1.68/1.94  % 
% 1.68/1.94  % clauses                               2
% 1.68/1.94  % conjectures                           1
% 1.68/1.94  % EPR                                   0
% 1.68/1.94  % Horn                                  2
% 1.68/1.94  % unary                                 2
% 1.68/1.94  % binary                                0
% 1.68/1.94  % lits                                  2
% 1.68/1.94  % lits eq                               2
% 1.68/1.94  % fd_pure                               0
% 1.68/1.94  % fd_pseudo                             0
% 1.68/1.94  % fd_cond                               0
% 1.68/1.94  % fd_pseudo_cond                        0
% 1.68/1.94  % AC symbols                            0
% 1.68/1.94  
% 1.68/1.94  % ------ Input Options Time Limit: Unbounded
% 1.68/1.94  
% 1.68/1.94  
% 1.68/1.94  % ------ 
% 1.68/1.94  % Current options:
% 1.68/1.94  % ------ 
% 1.68/1.94  
% 1.68/1.94  
% 1.68/1.94  % 
% 1.68/1.94  
% 1.68/1.94  % ------ Proving...
% 1.68/1.94  % 
% 1.68/1.94  
% 1.68/1.94  % SZS status Unsatisfiable for theBenchmark.p
% 1.68/1.94  
% 1.68/1.94  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.68/1.94  
% 1.68/1.94  
%------------------------------------------------------------------------------