↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GRP555-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 : n017.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.24s 1.26s
% Output   : CNFRefutation 2.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            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 :    8 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    7 (   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   :   84 (   0 sgn  84   !;   0   ?;  79   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : divide(divide(X0,inverse(divide(X1,divide(X0,X2)))),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,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] : divide(divide(X0,inverse(divide(X1,divide(X0,X2)))),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,[],[f4]) ).

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

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

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

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

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

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

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

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

tcf(c_172,plain,
    ! [X0: $i,X1: $i] : inverse(divide(divide(X0,X1),X0)) = X1,
    inference(demodulation,[status(thm)],[c_127,c_170]) ).

tcf(c_187,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,inverse(X1)),X2) = divide(divide(X0,X2),inverse(X1)),
    inference(demodulation,[status(thm)],[c_95,c_121]) ).

tcf(c_199,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),X2) = divide(divide(X0,X2),X1),
    inference(superposition,[status(thm)],[c_172,c_187]) ).

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

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

tcf(c_223,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
    inference(demodulation,[status(thm)],[c_129,c_220]) ).

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

tcf(c_233,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(inverse(divide(X1,X2)),X2)) = X0,
    inference(demodulation,[status(thm)],[c_125,c_220]) ).

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

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

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

tcf(c_537,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
    inference(light_normalisation,[status(thm)],[c_530,c_297]) ).

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

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

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

tcf(c_566,plain,
    divide(a3,divide(inverse(c3),b3)) != divide(b3,divide(inverse(c3),a3)),
    inference(demodulation,[status(thm)],[c_224,c_560]) ).

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

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

tcf(c_1374,plain,
    ! [X0: $i,X1: $i] : divide(inverse(X0),X1) = divide(inverse(X1),X0),
    inference(light_normalisation,[status(thm)],[c_1346,c_561]) ).

tcf(c_1375,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(X0,inverse(divide(X1,X2))) = divide(X0,divide(X2,X1)),
    inference(light_normalisation,[status(thm)],[c_1369,c_220]) ).

tcf(c_1377,plain,
    divide(a3,divide(inverse(c3),b3)) != divide(b3,divide(inverse(a3),c3)),
    inference(demodulation,[status(thm)],[c_566,c_1374]) ).

tcf(c_1423,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,divide(X2,X0))) = divide(X2,X1),
    inference(demodulation,[status(thm)],[c_214,c_1375]) ).

tcf(c_1452,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,X2)) = divide(X2,divide(X1,X0)),
    inference(superposition,[status(thm)],[c_1423,c_537]) ).

tcf(c_1639,plain,
    divide(a3,divide(inverse(b3),c3)) != divide(b3,divide(inverse(a3),c3)),
    inference(demodulation,[status(thm)],[c_1377,c_1374]) ).

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

tcf(c_2443,plain,
    divide(a3,divide(inverse(b3),c3)) != divide(a3,divide(inverse(c3),b3)),
    inference(demodulation,[status(thm)],[c_1639,c_2387]) ).

tcf(c_2444,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_2443,c_1374]) ).


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