↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : BOO006-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n002.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:00:09 PM UTC 2026

% Result   : Unsatisfiable 3.10s 1.26s
% Output   : CNFRefutation 3.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   30 (  30 unt;   0 def)
%            Number of atoms       :   30 (  29 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 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   :   39 (   0 sgn  39   !;   0   ?;  25   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : add(X0,X1) = add(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',commutativity_of_add) ).

fof(f2,axiom,
    ! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',commutativity_of_multiply) ).

fof(f4,axiom,
    ! [X2,X0,X1] : add(X0,multiply(X1,X2)) = multiply(add(X0,X1),add(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity2) ).

fof(f6,axiom,
    ! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity4) ).

fof(f7,axiom,
    ! [X0] : add(X0,inverse(X0)) = multiplicative_identity,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_inverse1) ).

fof(f13,axiom,
    ! [X0] : multiply(X0,multiplicative_identity) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_id1) ).

fof(f14,axiom,
    ! [X0] : multiply(multiplicative_identity,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_id2) ).

fof(f16,axiom,
    ! [X0] : add(additive_identity,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_id2) ).

fof(f17,negated_conjecture,
    multiply(a,additive_identity) != additive_identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_identity) ).

fof(f18,plain,
    additive_identity != multiply(a,additive_identity),
    inference(reorient_equations,[],[f17]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_65,plain,
    ! [X0: $i,X1: $i] : multiply(X0,X1) = multiply(X1,X0),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_67,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiply(add(X0,X1),add(X0,X2)) = add(X0,multiply(X1,X2)),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_69,plain,
    ! [X0: $i,X1: $i,X2: $i] : add(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,add(X1,X2)),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_70,plain,
    ! [X0: $i] : add(X0,inverse(X0)) = multiplicative_identity,
    inference(cnf_transformation,[],[f7]) ).

tcf(c_74,plain,
    ! [X0: $i] : multiply(X0,multiplicative_identity) = X0,
    inference(cnf_transformation,[],[f13]) ).

tcf(c_75,plain,
    ! [X0: $i] : multiply(multiplicative_identity,X0) = X0,
    inference(cnf_transformation,[],[f14]) ).

tcf(c_77,plain,
    ! [X0: $i] : add(additive_identity,X0) = X0,
    inference(cnf_transformation,[],[f16]) ).

tcf(c_78,negated_conjecture,
    multiply(a,additive_identity) != additive_identity,
    inference(cnf_transformation,[],[f18]) ).

tcf(c_122,plain,
    multiply(additive_identity,a) != additive_identity,
    inference(demodulation,[status(thm)],[c_78,c_65]) ).

tcf(c_258,plain,
    ! [X0: $i,X1: $i] : add(X0,multiply(inverse(X0),X1)) = multiply(multiplicative_identity,add(X0,X1)),
    inference(superposition,[status(thm)],[c_70,c_67]) ).

tcf(c_760,plain,
    ! [X0: $i,X1: $i] : add(X0,multiply(X0,X1)) = multiply(X0,add(multiplicative_identity,X1)),
    inference(superposition,[status(thm)],[c_74,c_69]) ).

tcf(c_3191,plain,
    ! [X0: $i] : multiply(additive_identity,add(multiplicative_identity,X0)) = multiply(additive_identity,X0),
    inference(superposition,[status(thm)],[c_760,c_77]) ).

tcf(c_3458,plain,
    ! [X0: $i] : multiply(additive_identity,add(X0,multiplicative_identity)) = multiply(additive_identity,X0),
    inference(superposition,[status(thm)],[c_64,c_3191]) ).

tcf(c_4411,plain,
    ! [X0: $i,X1: $i] : add(X0,multiply(inverse(X0),X1)) = add(X0,X1),
    inference(demodulation,[status(thm)],[c_258,c_75]) ).

tcf(c_4419,plain,
    ! [X0: $i] : add(X0,inverse(X0)) = add(X0,multiplicative_identity),
    inference(superposition,[status(thm)],[c_74,c_4411]) ).

tcf(c_4462,plain,
    ! [X0: $i] : add(X0,multiplicative_identity) = multiplicative_identity,
    inference(light_normalisation,[status(thm)],[c_4419,c_70]) ).

tcf(c_4481,plain,
    ! [X0: $i] : multiply(additive_identity,X0) = multiply(additive_identity,multiplicative_identity),
    inference(demodulation,[status(thm)],[c_3458,c_4462]) ).

tcf(c_4493,plain,
    multiply(additive_identity,multiplicative_identity) != additive_identity,
    inference(demodulation,[status(thm)],[c_122,c_4481]) ).

tcf(c_4498,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_4493,c_74]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : BOO006-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.35  % Computer : n002.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.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 06:28:34 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39  Running UEQ theorem proving
% 0.13/0.39  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.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...
% 3.10/1.26  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.10/1.26  % SZS status Started for theBenchmark.p
% 3.10/1.26  % SZS status Unsatisfiable for theBenchmark.p
% 3.10/1.26  
% 3.10/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.10/1.26  
% 3.10/1.26  % ------  iProver source info
% 3.10/1.26  
% 3.10/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 3.10/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.10/1.26  % git: non_committed_changes: false
% 3.10/1.26  
% 3.10/1.26  % ------ Parsing...% successful
% 3.10/1.26  
% 3.10/1.26  
% 3.10/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.10/1.26  
% 3.10/1.26  % ------ Preprocessing... sup_sim: 5  sf_s  rm: 0 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.10/1.26  
% 3.10/1.26  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.10/1.26  
% 3.10/1.26  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.10/1.26  % ------ Proving...
% 3.10/1.26  % ------ Problem Properties 
% 3.10/1.26  
% 3.10/1.26  % 
% 3.10/1.26  % clauses                               13
% 3.10/1.26  % conjectures                           0
% 3.10/1.26  % EPR                                   0
% 3.10/1.26  % Horn                                  13
% 3.10/1.26  % unary                                 13
% 3.10/1.26  % binary                                0
% 3.10/1.26  % lits                                  13
% 3.10/1.26  % lits eq                               13
% 3.10/1.26  % fd_pure                               0
% 3.10/1.26  % fd_pseudo                             0
% 3.10/1.26  % fd_cond                               0
% 3.10/1.26  % fd_pseudo_cond                        0
% 3.10/1.26  % AC symbols                            0
% 3.10/1.26  
% 3.10/1.26  % ------ Input Options Time Limit: Unbounded
% 3.10/1.26  
% 3.10/1.26  
% 3.10/1.26  % ------ 
% 3.10/1.26  % Current options:
% 3.10/1.26  % ------ 
% 3.10/1.26  
% 3.10/1.26  
% 3.10/1.26  % 
% 3.10/1.26  
% 3.10/1.26  % ------ Proving...
% 3.10/1.26  % 
% 3.10/1.26  
% 3.10/1.26  % SZS status Unsatisfiable for theBenchmark.p
% 3.10/1.26  
% 3.10/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.10/1.26  
% 3.10/1.26  
%------------------------------------------------------------------------------