↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n008.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:25:50 PM UTC 2026

% Result   : Theorem 4.60s 1.31s
% Output   : CNFRefutation 4.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   44 (  22 unt;   0 def)
%            Number of atoms       :   93 (  35 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   93 (  44   ~;  35   |;  11   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 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  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn  40   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => aNaturalNumber0(sdtasdt0(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).

fof(f10,axiom,
    ! [X0,X1,X2] :
      ( ( aNaturalNumber0(X2)
        & aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).

fof(f40,axiom,
    ( xp != sz00
    & xm != sz00
    & xn != sz00
    & aNaturalNumber0(xp)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2987) ).

fof(f42,axiom,
    sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3014) ).

fof(f45,axiom,
    ( xq = sdtsldt0(xn,xp)
    & xn = sdtasdt0(xp,xq)
    & aNaturalNumber0(xq) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3059) ).

fof(f46,conjecture,
    sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f47,negated_conjecture,
    sdtasdt0(xp,sdtasdt0(xm,xm)) != sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
    inference(negated_conjecture,[status(cth)],[f46]) ).

fof(f51,plain,
    sdtasdt0(xp,sdtasdt0(xm,xm)) != sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
    inference(flattening,[],[f47]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | aNaturalNumber0(sdtasdt0(X0,X1)) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | aNaturalNumber0(sdtasdt0(X0,X1)) ),
    inference(flattening,[],[f54]) ).

fof(f61,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
    inference(flattening,[],[f61]) ).

fof(f63,plain,
    ! [X0,X1,X2] :
      ( ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f64,plain,
    ! [X0,X1,X2] :
      ( ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
    inference(flattening,[],[f63]) ).

fof(f143,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | aNaturalNumber0(sdtasdt0(X0,X1)) ),
    inference(cnf_transformation,[],[f55]) ).

fof(f148,plain,
    ! [X0,X1] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f149,plain,
    ! [X2,X0,X1] :
      ( ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0)
      | sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
    inference(cnf_transformation,[],[f64]) ).

fof(f211,plain,
    aNaturalNumber0(xp),
    inference(cnf_transformation,[],[f40]) ).

fof(f221,plain,
    sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
    inference(cnf_transformation,[],[f42]) ).

fof(f233,plain,
    xn = sdtasdt0(xp,xq),
    inference(cnf_transformation,[],[f45]) ).

fof(f234,plain,
    aNaturalNumber0(xq),
    inference(cnf_transformation,[],[f45]) ).

fof(f235,plain,
    sdtasdt0(xp,sdtasdt0(xm,xm)) != sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
    inference(cnf_transformation,[],[f51]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i] :
      ( aNaturalNumber0(sdtasdt0(X0,X1))
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f143]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i] :
      ( ( sdtasdt0(X0,X1) = sdtasdt0(X1,X0) )
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f148]) ).

tcf(c_59,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) )
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(cnf_transformation,[],[f149]) ).

tcf(c_119,plain,
    aNaturalNumber0(xp),
    inference(cnf_transformation,[],[f211]) ).

tcf(c_130,plain,
    sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
    inference(cnf_transformation,[],[f221]) ).

tcf(c_141,plain,
    aNaturalNumber0(xq),
    inference(cnf_transformation,[],[f234]) ).

tcf(c_142,plain,
    sdtasdt0(xp,xq) = xn,
    inference(cnf_transformation,[],[f233]) ).

tcf(c_144,negated_conjecture,
    sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xp,sdtasdt0(xm,xm)),
    inference(cnf_transformation,[],[f235]) ).

tcf(c_190,plain,
    ( aNaturalNumber0(xn)
    | ~ aNaturalNumber0(xq)
    | ~ aNaturalNumber0(xp) ),
    inference(superposition,[status(thm)],[c_142,c_53]) ).

tcf(c_204,plain,
    ! [X0: $i] :
      ( ( sdtasdt0(X0,xq) = sdtasdt0(xq,X0) )
      | ~ aNaturalNumber0(X0) ),
    inference(superposition,[status(thm)],[c_141,c_58]) ).

tcf(c_208,plain,
    sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xn,xn),
    inference(light_normalisation,[status(thm)],[c_144,c_130]) ).

tcf(c_251,plain,
    ! [X0: $i,X1: $i] :
      ( ( sdtasdt0(sdtasdt0(xp,X0),X1) = sdtasdt0(xp,sdtasdt0(X0,X1)) )
      | ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X0) ),
    inference(superposition,[status(thm)],[c_119,c_59]) ).

tcf(c_355,plain,
    aNaturalNumber0(xn),
    inference(global_subsumption_just,[status(thm)],[c_190,c_141,c_119,c_190]) ).

tcf(c_427,plain,
    sdtasdt0(xn,xq) = sdtasdt0(xq,xn),
    inference(superposition,[status(thm)],[c_355,c_204]) ).

tcf(c_589,plain,
    ! [X0: $i] :
      ( ( sdtasdt0(sdtasdt0(xp,xq),X0) = sdtasdt0(xp,sdtasdt0(xq,X0)) )
      | ~ aNaturalNumber0(X0) ),
    inference(superposition,[status(thm)],[c_141,c_251]) ).

tcf(c_1652,plain,
    ! [X0: $i] :
      ( ( sdtasdt0(xp,sdtasdt0(xq,X0)) = sdtasdt0(xn,X0) )
      | ~ aNaturalNumber0(X0) ),
    inference(light_normalisation,[status(thm)],[c_589,c_142]) ).

tcf(c_1658,plain,
    sdtasdt0(xp,sdtasdt0(xq,xn)) = sdtasdt0(xn,xn),
    inference(superposition,[status(thm)],[c_355,c_1652]) ).

tcf(c_1661,plain,
    sdtasdt0(xp,sdtasdt0(xq,xq)) = sdtasdt0(xn,xq),
    inference(superposition,[status(thm)],[c_141,c_1652]) ).

tcf(c_1663,plain,
    sdtasdt0(xp,sdtasdt0(xn,xq)) != sdtasdt0(xn,xn),
    inference(demodulation,[status(thm)],[c_208,c_1661]) ).

tcf(c_6826,plain,
    sdtasdt0(xp,sdtasdt0(xn,xq)) = sdtasdt0(xn,xn),
    inference(light_normalisation,[status(thm)],[c_1658,c_427]) ).

tcf(c_6841,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1663,c_6826]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM525+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37  % Computer : n008.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Thu Sep 24 04:27:40 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/0.41  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.42  
% 0.09/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42  
% 0.09/0.42  % Detected problem language: tptp
% 0.09/0.44  % Proving...
% 4.60/1.31  % SZS status Started for theBenchmark.p
% 4.60/1.31  % SZS status Theorem for theBenchmark.p
% 4.60/1.31  
% 4.60/1.31  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.60/1.31  
% 4.60/1.31  % ------  iProver source info
% 4.60/1.31  
% 4.60/1.31  % git: date: 2026-07-19 20:42:38 +0200
% 4.60/1.31  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.60/1.31  % git: non_committed_changes: false
% 4.60/1.31  
% 4.60/1.31  % ------ Parsing...
% 4.60/1.31  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 4.60/1.31  % ------ Proving...
% 4.60/1.31  % ------ Problem Properties 
% 4.60/1.31  
% 4.60/1.31  % 
% 4.60/1.31  % clauses                               96
% 4.60/1.31  % conjectures                           1
% 4.60/1.31  % EPR                                   28
% 4.60/1.31  % Horn                                  60
% 4.60/1.31  % unary                                 22
% 4.60/1.31  % binary                                10
% 4.60/1.31  % lits                                  390
% 4.60/1.31  % lits eq                               133
% 4.60/1.31  % fd_pure                               0
% 4.60/1.31  % fd_pseudo                             0
% 4.60/1.31  % fd_cond                               23
% 4.60/1.31  % fd_pseudo_cond                        15
% 4.60/1.31  % AC symbols                            0
% 4.60/1.31  
% 4.60/1.31  % ------ Input Options Time Limit: Unbounded
% 4.60/1.31  
% 4.60/1.31  
% 4.60/1.31  % ------ 
% 4.60/1.31  % Current options:
% 4.60/1.31  % ------ 
% 4.60/1.31  
% 4.60/1.31  
% 4.60/1.31  % 
% 4.60/1.31  
% 4.60/1.31  % ------ Proving...
% 4.60/1.31  % 
% 4.60/1.31  
% 4.60/1.31  % SZS status Theorem for theBenchmark.p
% 4.60/1.31  
% 4.60/1.31  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.60/1.31  
% 4.60/1.31  
%------------------------------------------------------------------------------