↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 1.51s 1.29s
% Output   : CNFRefutation 1.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   37 (  37 unt;   0 def)
%            Number of atoms       :   37 (  36 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    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   69 (   0 sgn  69   !;   0   ?;  63   :)

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

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

fof(f4,axiom,
    ! [X0] : identity = divide(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).

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

fof(f6,plain,
    divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
    inference(definition_unfolding,[],[f5,f2,f2,f2,f2]) ).

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

tcf(c_55,plain,
    ! [X0: $i] : divide(X0,X0) = identity,
    inference(cnf_transformation,[],[f4]) ).

tcf(c_56,negated_conjecture,
    divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_65,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(divide(identity,X1),X2),divide(divide(identity,X0),X2))) = X1,
    inference(light_normalisation,[status(thm)],[c_54,c_55]) ).

tcf(c_95,plain,
    ! [X0: $i] : divide(X0,identity) = X0,
    inference(superposition,[status(thm)],[c_55,c_65]) ).

tcf(c_96,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(identity,divide(divide(identity,X0),divide(identity,X1)))) = X1,
    inference(superposition,[status(thm)],[c_55,c_65]) ).

tcf(c_100,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(divide(divide(identity,X1),divide(identity,X0)),identity)) = X1,
    inference(superposition,[status(thm)],[c_55,c_65]) ).

tcf(c_102,plain,
    ! [X0: $i,X1: $i] : divide(identity,divide(divide(divide(identity,X0),X1),divide(identity,X1))) = X0,
    inference(superposition,[status(thm)],[c_55,c_65]) ).

tcf(c_105,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,divide(X1,divide(divide(identity,X0),divide(divide(divide(identity,X1),X2),divide(divide(identity,divide(identity,X3)),X2))))) = X3,
    inference(superposition,[status(thm)],[c_65,c_65]) ).

tcf(c_126,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(divide(identity,X0),X1),divide(divide(identity,identity),X1)),divide(identity,divide(X0,divide(identity,X2)))) = X2,
    inference(superposition,[status(thm)],[c_65,c_96]) ).

tcf(c_199,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(divide(identity,X1),divide(identity,X0))) = X1,
    inference(demodulation,[status(thm)],[c_100,c_95]) ).

tcf(c_205,plain,
    ! [X0: $i] : divide(identity,divide(divide(identity,X0),identity)) = X0,
    inference(superposition,[status(thm)],[c_55,c_199]) ).

tcf(c_260,plain,
    ! [X0: $i] : divide(identity,divide(identity,X0)) = X0,
    inference(demodulation,[status(thm)],[c_205,c_95]) ).

tcf(c_264,plain,
    ! [X0: $i,X1: $i] : divide(X0,divide(X1,divide(identity,X0))) = divide(identity,X1),
    inference(superposition,[status(thm)],[c_260,c_199]) ).

tcf(c_287,plain,
    ! [X0: $i,X1: $i] : divide(divide(divide(identity,X0),X1),divide(identity,X1)) = divide(identity,X0),
    inference(superposition,[status(thm)],[c_102,c_260]) ).

tcf(c_311,plain,
    ! [X0: $i,X1: $i] : divide(divide(identity,X0),divide(X1,X0)) = divide(identity,X1),
    inference(superposition,[status(thm)],[c_260,c_264]) ).

tcf(c_328,plain,
    ! [X0: $i] : divide(divide(identity,identity),X0) = divide(identity,X0),
    inference(superposition,[status(thm)],[c_95,c_311]) ).

tcf(c_341,plain,
    ! [X0: $i,X1: $i] : divide(divide(identity,X0),divide(identity,divide(X0,divide(identity,X1)))) = X1,
    inference(demodulation,[status(thm)],[c_126,c_287,c_328]) ).

tcf(c_360,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,divide(identity,X1)),X1) = divide(identity,divide(identity,X0)),
    inference(superposition,[status(thm)],[c_341,c_264]) ).

tcf(c_364,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,divide(identity,X1)),X1) = X0,
    inference(light_normalisation,[status(thm)],[c_360,c_260]) ).

tcf(c_380,plain,
    ! [X0: $i,X1: $i] : divide(divide(X0,X1),divide(identity,X1)) = X0,
    inference(superposition,[status(thm)],[c_260,c_364]) ).

tcf(c_384,plain,
    ! [X0: $i,X1: $i] : divide(identity,divide(X0,divide(identity,X1))) = divide(divide(identity,X1),X0),
    inference(superposition,[status(thm)],[c_364,c_311]) ).

tcf(c_387,plain,
    divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)),
    inference(demodulation,[status(thm)],[c_56,c_384]) ).

tcf(c_409,plain,
    ! [X0: $i,X1: $i] : divide(identity,divide(X0,X1)) = divide(X1,X0),
    inference(superposition,[status(thm)],[c_380,c_264]) ).

tcf(c_426,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,divide(X1,X2)),divide(X2,X1)) = X0,
    inference(superposition,[status(thm)],[c_409,c_380]) ).

tcf(c_539,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,divide(X1,divide(divide(identity,X0),divide(divide(divide(identity,X1),X2),divide(X3,X2))))) = X3,
    inference(demodulation,[status(thm)],[c_105,c_95,c_409]) ).

tcf(c_545,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,X1),divide(divide(identity,X2),X1)),divide(X2,identity)) = X0,
    inference(superposition,[status(thm)],[c_426,c_539]) ).

tcf(c_1062,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,X1),divide(divide(identity,X2),X1)),X2) = X0,
    inference(demodulation,[status(thm)],[c_545,c_95]) ).

tcf(c_1079,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,divide(X1,X2)),divide(identity,X1)),X2) = X0,
    inference(superposition,[status(thm)],[c_311,c_1062]) ).

tcf(c_1141,plain,
    ! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,divide(identity,X1)),X2) = divide(X0,divide(identity,divide(X1,X2))),
    inference(superposition,[status(thm)],[c_364,c_1079]) ).

tcf(c_1179,plain,
    divide(a3,divide(identity,divide(b3,divide(identity,c3)))) != divide(a3,divide(divide(identity,c3),b3)),
    inference(demodulation,[status(thm)],[c_387,c_1141]) ).

tcf(c_1181,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_1179,c_409]) ).


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