↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 3.92s 1.31s
% Output   : CNFRefutation 3.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   41 (  41 unt;   0 def)
%            Number of atoms       :   41 (  40 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    9 (   9   ~;   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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   81 (   0 sgn  81   !;   0   ?;  74   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1,
    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,plain,
    ! [X0,X1] : divide(X0,inverse(X1)) = multiply(X0,X1),
    inference(reorient_equations,[],[f2]) ).

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

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

tcf(c_52,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = 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,[],[f5]) ).

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

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

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

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

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

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

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

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

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

tcf(c_221,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X1) = X0,
    inference(light_normalisation,[status(thm)],[c_217,c_182]) ).

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

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

tcf(c_260,plain,
    ! [X0: $i] : inverse(inverse(X0)) = X0,
    inference(superposition,[status(thm)],[c_221,c_182]) ).

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

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

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

tcf(c_427,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,X1),inverse(X1)) = X0,
    inference(demodulation,[status(thm)],[c_213,c_395]) ).

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

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

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

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

tcf(c_506,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),X2) = divide(divide(X0,X2),X1),
    inference(superposition,[status(thm)],[c_438,c_251]) ).

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

tcf(c_605,plain,
    divide(a3,inverse(divide(b3,inverse(c3)))) != divide(b3,divide(inverse(c3),a3)),
    inference(demodulation,[status(thm)],[c_452,c_598]) ).

tcf(c_607,plain,
    divide(a3,divide(inverse(c3),b3)) != divide(b3,divide(inverse(c3),a3)),
    inference(demodulation,[status(thm)],[c_605,c_598]) ).

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

tcf(c_644,plain,
    divide(a3,divide(inverse(c3),b3)) != divide(b3,divide(inverse(a3),c3)),
    inference(demodulation,[status(thm)],[c_607,c_633]) ).

tcf(c_648,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,divide(X1,X2)),divide(X2,X1)) = X0,
    inference(demodulation,[status(thm)],[c_99,c_390,c_430,c_506,c_598]) ).

tcf(c_760,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
    inference(demodulation,[status(thm)],[c_398,c_430,c_598]) ).

tcf(c_771,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,X2)) = divide(X2,divide(X1,X0)),
    inference(superposition,[status(thm)],[c_648,c_760]) ).

tcf(c_923,plain,
    divide(a3,divide(inverse(b3),c3)) != divide(b3,divide(inverse(a3),c3)),
    inference(demodulation,[status(thm)],[c_644,c_633]) ).

tcf(c_1152,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),X2)) = divide(X1,divide(inverse(X2),X0)),
    inference(superposition,[status(thm)],[c_633,c_771]) ).

tcf(c_1199,plain,
    divide(a3,divide(inverse(b3),c3)) != divide(a3,divide(inverse(c3),b3)),
    inference(demodulation,[status(thm)],[c_923,c_1152]) ).

tcf(c_1200,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_1199,c_633]) ).


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