↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 1.52s 1.30s
% Output   : CNFRefutation 3.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   60 (  60 unt;   0 def)
%            Number of atoms       :   60 (  43 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  25   !;   0   ?;  17   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f22,axiom,
    ! [X0] : add(X0,X0) = additive_identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause34) ).

fof(f23,plain,
    ! [X0] : additive_identity = add(X0,X0),
    inference(reorient_equations,[],[f22]) ).

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

fof(f25,axiom,
    multiply(a,b) = c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause36) ).

fof(f26,axiom,
    multiply(b,a) = d,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause37) ).

fof(f27,axiom,
    ! [X0,X1] : sum(X0,X1,add(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause38) ).

fof(f29,axiom,
    product(b,d,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause40) ).

fof(f30,axiom,
    product(c,b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause41) ).

fof(f33,axiom,
    ! [X0,X1] : product(a,multiply(b,X0),multiply(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause44) ).

fof(f40,axiom,
    product(a,d,multiply(c,a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause51) ).

fof(f46,axiom,
    ! [X0] : product(multiply(X0,b),a,multiply(X0,d)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).

fof(f55,axiom,
    product(add(b,a),b,add(b,c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause68) ).

fof(f57,axiom,
    product(add(a,b),a,add(a,d)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause70) ).

fof(f61,negated_conjecture,
    c != d,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).

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

tcf(c_131,plain,
    ! [X0: $i] : multiply(X0,X0) = X0,
    inference(cnf_transformation,[],[f24]) ).

tcf(c_132,plain,
    multiply(a,b) = c,
    inference(cnf_transformation,[],[f25]) ).

tcf(c_133,plain,
    multiply(b,a) = d,
    inference(cnf_transformation,[],[f26]) ).

tcf(c_134,plain,
    ! [X0: $i,X1: $i] : sum(X0,X1,add(X1,X0)),
    inference(cnf_transformation,[],[f27]) ).

tcf(c_136,plain,
    product(b,d,d),
    inference(cnf_transformation,[],[f29]) ).

tcf(c_137,plain,
    product(c,b,c),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_140,plain,
    ! [X0: $i,X1: $i] : product(a,multiply(b,X0),multiply(X1,X0)),
    inference(cnf_transformation,[],[f33]) ).

tcf(c_147,plain,
    product(a,d,multiply(c,a)),
    inference(cnf_transformation,[],[f40]) ).

tcf(c_153,plain,
    ! [X0: $i] : product(multiply(X0,b),a,multiply(X0,d)),
    inference(cnf_transformation,[],[f46]) ).

tcf(c_162,plain,
    product(add(b,a),b,add(b,c)),
    inference(cnf_transformation,[],[f55]) ).

tcf(c_164,plain,
    product(add(a,b),a,add(a,d)),
    inference(cnf_transformation,[],[f57]) ).

tcf(c_168,negated_conjecture,
    c != d,
    inference(cnf_transformation,[],[f61]) ).

tcf(c_193,plain,
    ! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
    inference(well_definedness,[status(thm)],[c_134]) ).

tcf(c_195,plain,
    multiply(b,d) = d,
    inference(well_definedness,[status(thm)],[c_136]) ).

tcf(c_196,plain,
    multiply(c,b) = c,
    inference(well_definedness,[status(thm)],[c_137]) ).

tcf(c_199,plain,
    ! [X0: $i,X1: $i] : multiply(a,multiply(b,X0)) = multiply(X1,X0),
    inference(well_definedness,[status(thm)],[c_140]) ).

tcf(c_206,plain,
    multiply(a,d) = multiply(c,a),
    inference(well_definedness,[status(thm)],[c_147]) ).

tcf(c_212,plain,
    ! [X0: $i] : multiply(multiply(X0,b),a) = multiply(X0,d),
    inference(well_definedness,[status(thm)],[c_153]) ).

tcf(c_221,plain,
    multiply(add(b,a),b) = add(b,c),
    inference(well_definedness,[status(thm)],[c_162]) ).

tcf(c_223,plain,
    multiply(add(a,b),a) = add(a,d),
    inference(well_definedness,[status(thm)],[c_164]) ).

tcf(c_450,plain,
    multiply(add(a,b),b) = add(b,c),
    inference(demodulation,[status(thm)],[c_221,c_193]) ).

tcf(c_459,plain,
    ! [X0: $i] : multiply(a,multiply(b,a)) = multiply(X0,d),
    inference(demodulation,[status(thm)],[c_212,c_199]) ).

tcf(c_460,plain,
    multiply(a,multiply(b,a)) = add(a,d),
    inference(demodulation,[status(thm)],[c_223,c_199]) ).

tcf(c_461,plain,
    multiply(a,multiply(b,b)) = add(b,c),
    inference(demodulation,[status(thm)],[c_450,c_199]) ).

tcf(c_462,plain,
    add(b,c) = c,
    inference(demodulation,[status(thm)],[c_461,c_131,c_132]) ).

tcf(c_463,plain,
    add(a,d) = multiply(a,d),
    inference(light_normalisation,[status(thm)],[c_460,c_133]) ).

tcf(c_464,plain,
    ! [X0: $i] : multiply(X0,d) = multiply(a,d),
    inference(light_normalisation,[status(thm)],[c_459,c_133]) ).

tcf(c_465,plain,
    multiply(a,d) = d,
    inference(demodulation,[status(thm)],[c_195,c_464]) ).

tcf(c_467,plain,
    add(a,d) = d,
    inference(demodulation,[status(thm)],[c_463,c_465]) ).

tcf(c_468,plain,
    multiply(c,a) = d,
    inference(demodulation,[status(thm)],[c_206,c_465]) ).

tcf(c_558,negated_conjecture,
    c != d,
    inference(demodulation,[status(thm)],[c_168]) ).

tcf(c_644,plain,
    ! [X0: $i] : multiply(a,multiply(b,X0)) = X0,
    inference(superposition,[status(thm)],[c_199,c_131]) ).

tcf(c_647,plain,
    ! [X0: $i,X1: $i] : multiply(X0,X1) = X1,
    inference(demodulation,[status(thm)],[c_199,c_644]) ).

tcf(c_649,plain,
    b = c,
    inference(demodulation,[status(thm)],[c_196,c_647]) ).

tcf(c_650,plain,
    b != d,
    inference(demodulation,[status(thm)],[c_558,c_649]) ).

tcf(c_651,plain,
    add(b,b) = b,
    inference(light_normalisation,[status(thm)],[c_462,c_649]) ).

tcf(c_652,plain,
    additive_identity = b,
    inference(demodulation,[status(thm)],[c_651,c_130]) ).

tcf(c_653,plain,
    additive_identity != d,
    inference(demodulation,[status(thm)],[c_650,c_652]) ).

tcf(c_654,plain,
    additive_identity = c,
    inference(demodulation,[status(thm)],[c_649,c_652]) ).

tcf(c_655,plain,
    multiply(additive_identity,a) = d,
    inference(light_normalisation,[status(thm)],[c_468,c_654]) ).

tcf(c_656,plain,
    a = d,
    inference(demodulation,[status(thm)],[c_655,c_647]) ).

tcf(c_657,plain,
    add(a,a) = a,
    inference(demodulation,[status(thm)],[c_467,c_656]) ).

tcf(c_658,plain,
    additive_identity != a,
    inference(demodulation,[status(thm)],[c_653,c_656]) ).

tcf(c_661,plain,
    additive_identity = a,
    inference(demodulation,[status(thm)],[c_657,c_130]) ).

tcf(c_662,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_661,c_658]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG039-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.38  % Computer : n026.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Thu Sep 24 07:58:24 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.43  
% 0.10/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43  
% 0.10/0.43  % Detected problem language: tptp
% 0.10/0.44  % Proving...
% 1.52/1.30  % SZS status Started for theBenchmark.p
% 1.52/1.30  % SZS status Unsatisfiable for theBenchmark.p
% 1.52/1.30  
% 1.52/1.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.52/1.30  
% 1.52/1.30  % ------  iProver source info
% 1.52/1.30  
% 1.52/1.30  % git: date: 2026-07-19 20:42:38 +0200
% 1.52/1.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.52/1.30  % git: non_committed_changes: false
% 1.52/1.30  
% 1.52/1.30  % ------ Parsing...% successful
% 1.52/1.30  
% 1.52/1.30  
% 1.52/1.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.52/1.30  
% 1.52/1.30  % ------ Preprocessing... sup_sim: 57  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 % 
% 1.52/1.30  
% 1.52/1.30  % ------ Preprocessing...% ------  preprocesses with Option_UEQ
% 1.52/1.30   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.52/1.30  
% 1.52/1.30  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 1.52/1.30  % ------ Proving...
% 1.52/1.30  % ------ Problem Properties 
% 1.52/1.30  
% 1.52/1.30  % 
% 1.52/1.30  % clauses                               27
% 1.52/1.30  % conjectures                           1
% 1.52/1.30  % EPR                                   1
% 1.52/1.30  % Horn                                  27
% 1.52/1.30  % unary                                 27
% 1.52/1.30  % binary                                0
% 1.52/1.30  % lits                                  27
% 1.52/1.30  % lits eq                               27
% 1.52/1.30  % fd_pure                               0
% 1.52/1.30  % fd_pseudo                             0
% 1.52/1.30  % fd_cond                               0
% 1.52/1.30  % fd_pseudo_cond                        0
% 1.52/1.30  % AC symbols                            1
% 1.52/1.30  
% 1.52/1.30  % ------ Schedule UEQ
% 1.52/1.30  
% 1.52/1.30  % ------ Option_UEQ Time Limit: 10.
% 1.52/1.30  
% 1.52/1.30  
% 1.52/1.30  % ------ 
% 1.52/1.30  % Current options:
% 1.52/1.30  % ------ 
% 1.52/1.30  
% 1.52/1.30  
% 1.52/1.30  % 
% 1.52/1.30  
% 1.52/1.30  % ------ Proving...
% 1.52/1.30  % 
% 1.52/1.30  
% 1.52/1.30  % SZS status Unsatisfiable for theBenchmark.p
% 1.52/1.30  
% 1.52/1.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.16/1.30  
% 3.16/1.30  
%------------------------------------------------------------------------------