↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.62s 6.21s
% Output   : CNFRefutation 2.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   29
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   46 (  46 unt;   0 def)
%            Number of atoms       :   46 (  45 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    9 (   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   :  137 (   0 sgn 137   !;   0   ?; 131   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1] : divide(inverse(divide(X0,divide(X1,divide(X2,X3)))),divide(divide(X3,X2),X0)) = 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(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox2/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(X0,divide(X1,divide(X2,X3)))),divide(divide(X3,X2),X0)) = X1,
    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_97,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(inverse(divide(X0,X1)),divide(divide(X2,divide(X3,X4)),X0)) = inverse(divide(X2,divide(X1,divide(X4,X3)))),
    inference(superposition,[status(thm)],[c_52,c_52]) ).

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

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

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

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

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

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

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

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

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

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

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

tcf(c_3633,plain,
    ! [X0: $i,X1: $i] : inverse(divide(inverse(divide(X0,X1)),inverse(X0))) = inverse(X1),
    inference(light_normalisation,[status(thm)],[c_3582,c_52]) ).

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

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

tcf(c_3861,plain,
    ! [X0: $i,X1: $i] : divide(inverse(divide(X0,X1)),inverse(X0)) = X1,
    inference(light_normalisation,[status(thm)],[c_3855,c_674]) ).

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

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

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

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

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

tcf(c_4066,plain,
    ! [X0: $i,X1: $i] : inverse(divide(X0,divide(X1,inverse(X0)))) = X1,
    inference(demodulation,[status(thm)],[c_115,c_4009]) ).

tcf(c_4070,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(inverse(X1),inverse(X0))) = X1,
    inference(demodulation,[status(thm)],[c_1525,c_4020]) ).

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

tcf(c_5190,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(inverse(divide(X0,X1)),divide(X2,X0)) = divide(X1,X2),
    inference(superposition,[status(thm)],[c_3861,c_4368]) ).

tcf(c_5215,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(inverse(X0),inverse(inverse(divide(X1,X2)))) = divide(divide(inverse(X0),inverse(X2)),X1),
    inference(superposition,[status(thm)],[c_4368,c_3861]) ).

tcf(c_5592,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(inverse(X0),inverse(divide(X0,divide(X1,X2)))),X3) = divide(divide(X2,X1),X3),
    inference(demodulation,[status(thm)],[c_4013,c_5215]) ).

tcf(c_5792,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,divide(inverse(X1),inverse(divide(X1,X2)))),X2) = X0,
    inference(demodulation,[status(thm)],[c_4043,c_5190]) ).

tcf(c_5968,plain,
    ! [X0: $i,X1: $i] : divide(divide(inverse(X0),inverse(X0)),X1) = inverse(X1),
    inference(demodulation,[status(thm)],[c_4044,c_5215]) ).

tcf(c_5971,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,X0),X1) = inverse(X1),
    inference(superposition,[status(thm)],[c_4066,c_5968]) ).

tcf(c_6022,plain,
    ! [X0: $i,X1: $i] : divide(inverse(X0),inverse(divide(X0,X1))) = inverse(X1),
    inference(superposition,[status(thm)],[c_5971,c_5792]) ).

tcf(c_6026,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(inverse(divide(X0,X1)),X2) = divide(divide(X1,X0),X2),
    inference(demodulation,[status(thm)],[c_5592,c_6022]) ).

tcf(c_6028,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,X1),inverse(X1)) = X0,
    inference(demodulation,[status(thm)],[c_3861,c_6026]) ).

tcf(c_6141,plain,
    ! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
    inference(superposition,[status(thm)],[c_6028,c_4066]) ).

tcf(c_6142,plain,
    ! [X0: $i] : inverse(inverse(X0)) = X0,
    inference(superposition,[status(thm)],[c_6028,c_5971]) ).

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

tcf(c_6186,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(X1,inverse(X0))) = inverse(X1),
    inference(superposition,[status(thm)],[c_6142,c_4070]) ).

tcf(c_6437,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,divide(X1,divide(X2,X3))),inverse(X1)) = divide(X0,divide(X3,X2)),
    inference(demodulation,[status(thm)],[c_3836,c_6142,c_6141]) ).

tcf(c_6445,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,inverse(X1)),inverse(X2)) = divide(X0,divide(inverse(X2),X1)),
    inference(superposition,[status(thm)],[c_6186,c_6437]) ).

tcf(c_6476,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_6144,c_6445]) ).


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