↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n004.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 02:38:13 PM UTC 2026

% Result   : Unsatisfiable 2.09s 1.16s
% Output   : CNFRefutation 2.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   25 (  25 unt;   0 def)
%            Number of atoms       :   25 (  24 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    5 (   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    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   36 (   0 sgn  36   !;   0   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0] : multiply(X0,additive_identity) = additive_identity,
    file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_multiplicative_zero) ).

fof(f6,plain,
    ! [X0] : additive_identity = multiply(X0,additive_identity),
    inference(reorient_equations,[],[f5]) ).

fof(f7,axiom,
    ! [X0] : add(additive_inverse(X0),X0) = additive_identity,
    file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',left_additive_inverse) ).

fof(f8,plain,
    ! [X0] : additive_identity = add(additive_inverse(X0),X0),
    inference(reorient_equations,[],[f7]) ).

fof(f12,axiom,
    ! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',distribute1) ).

fof(f14,axiom,
    ! [X0,X1] : add(X0,X1) = add(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).

fof(f15,axiom,
    ! [X2,X0,X1] : add(X0,add(X1,X2)) = add(add(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).

fof(f16,axiom,
    ! [X0,X1] : multiply(multiply(X0,X1),X1) = multiply(X0,multiply(X1,X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_alternative) ).

fof(f18,axiom,
    ! [X2,X0,X1] : associator(X0,X1,X2) = add(multiply(multiply(X0,X1),X2),additive_inverse(multiply(X0,multiply(X1,X2)))),
    file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',associator) ).

fof(f24,axiom,
    ! [X0,X1] : multiply(X0,additive_inverse(X1)) = additive_inverse(multiply(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_product2) ).

fof(f25,plain,
    ! [X0,X1] : additive_inverse(multiply(X0,X1)) = multiply(X0,additive_inverse(X1)),
    inference(reorient_equations,[],[f24]) ).

fof(f30,negated_conjecture,
    associator(x,y,y) != additive_identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_right_alternative) ).

fof(f31,plain,
    additive_identity != associator(x,y,y),
    inference(reorient_equations,[],[f30]) ).

fof(f32,plain,
    additive_identity != add(multiply(multiply(x,y),y),additive_inverse(multiply(x,multiply(y,y)))),
    inference(definition_unfolding,[],[f31,f18]) ).

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

tcf(c_76,plain,
    ! [X0: $i] : add(additive_inverse(X0),X0) = additive_identity,
    inference(cnf_transformation,[],[f8]) ).

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

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

tcf(c_82,plain,
    ! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    inference(cnf_transformation,[],[f15]) ).

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

tcf(c_87,plain,
    ! [X0: $i,X1: $i] : additive_inverse(multiply(X0,X1)) = multiply(X0,additive_inverse(X1)),
    inference(cnf_transformation,[],[f25]) ).

tcf(c_92,negated_conjecture,
    add(multiply(multiply(x,y),y),additive_inverse(multiply(x,multiply(y,y)))) != additive_identity,
    inference(cnf_transformation,[],[f32]) ).

tcf(c_110,plain,
    ! [X0: $i] : add(X0,additive_inverse(X0)) = additive_identity,
    inference(theory_normalisation,[status(thm)],[c_76,c_82,c_81]) ).

tcf(c_152,plain,
    additive_identity != additive_identity,
    inference(demodulation,[status(thm)],[c_92,c_87,c_75,c_110,c_79,c_83]) ).

tcf(c_153,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_152]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG024-7 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35  % Computer : n004.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 : Thu Sep 24 07:47:50 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.09/1.16  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.09/1.16  % SZS status Started for theBenchmark.p
% 2.09/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.09/1.16  
% 2.09/1.16  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.09/1.16  
% 2.09/1.16  % ------  iProver source info
% 2.09/1.16  
% 2.09/1.16  % git: date: 2026-07-19 20:42:38 +0200
% 2.09/1.16  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.09/1.16  % git: non_committed_changes: false
% 2.09/1.16  
% 2.09/1.16  % ------ Parsing...% successful
% 2.09/1.16  
% 2.09/1.16  
% 2.09/1.16  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.09/1.16  
% 2.09/1.16  % ------ Preprocessing...% 
% 2.09/1.16  
% 2.09/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.09/1.16  
% 2.09/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.09/1.16  
% 2.09/1.16  
%------------------------------------------------------------------------------