↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n007.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:21:10 PM UTC 2026

% Result   : Theorem 3.40s 1.28s
% Output   : CNFRefutation 3.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (  20 unt;   2 def)
%            Number of atoms       :   41 (  31 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   18 (  10   ~;   4   |;   4   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  14   !;   4   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f99,axiom,
    ! [X0,X1] : s(X0,s(X0,X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_7) ).

fof(f100,conjecture,
    ! [X0,X1,X2,X3] :
      ( X1 = X3
      | s(X0,X3) != X2
      | s(X0,X1) != X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_8) ).

fof(f101,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( X1 = X3
        | s(X0,X3) != X2
        | s(X0,X1) != X2 ),
    inference(negated_conjecture,[status(cth)],[f100]) ).

fof(f112,plain,
    ? [X0,X1,X2,X3] :
      ( X1 != X3
      & s(X0,X3) = X2
      & s(X0,X1) = X2 ),
    inference(ennf_transformation,[],[f101]) ).

fof(f113,plain,
    ( sK1 != sK3
    & sK2 = s(sK0,sK3)
    & sK2 = s(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f112]) ).

fof(f226,plain,
    ! [X0,X1] : s(X0,s(X0,X1)) = X1,
    inference(cnf_transformation,[],[f99]) ).

fof(f227,plain,
    sK1 != sK3,
    inference(cnf_transformation,[],[f113]) ).

fof(f228,plain,
    sK2 = s(sK0,sK3),
    inference(cnf_transformation,[],[f113]) ).

fof(f229,plain,
    sK2 = s(sK0,sK1),
    inference(cnf_transformation,[],[f113]) ).

tcf(c_161,plain,
    ! [X0: $i,X1: $i] : s(X0,s(X0,X1)) = X1,
    inference(cnf_transformation,[],[f226]) ).

tcf(c_162,negated_conjecture,
    s(sK0,sK1) = sK2,
    inference(cnf_transformation,[],[f229]) ).

tcf(c_163,negated_conjecture,
    s(sK0,sK3) = sK2,
    inference(cnf_transformation,[],[f228]) ).

tcf(c_164,negated_conjecture,
    sK1 != sK3,
    inference(cnf_transformation,[],[f227]) ).

tcf(c_3829,definition,
    iPr_def_10 = s(sK0,sK3),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_3830,definition,
    iPr_def_11 = s(sK0,sK1),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_3831,negated_conjecture,
    sK1 != sK3,
    inference(demodulation,[status(thm)],[c_164]) ).

tcf(c_3832,negated_conjecture,
    iPr_def_10 = sK2,
    inference(demodulation,[status(thm)],[c_163,c_3829]) ).

tcf(c_3833,negated_conjecture,
    iPr_def_11 = sK2,
    inference(demodulation,[status(thm)],[c_162,c_3830]) ).

tcf(c_5395,plain,
    iPr_def_10 = iPr_def_11,
    inference(light_normalisation,[status(thm)],[c_3833,c_3832]) ).

tcf(c_5397,plain,
    s(sK0,sK1) = iPr_def_10,
    inference(light_normalisation,[status(thm)],[c_3830,c_5395]) ).

tcf(c_5399,plain,
    s(sK0,iPr_def_10) = sK1,
    inference(superposition,[status(thm)],[c_5397,c_161]) ).

tcf(c_5400,plain,
    s(sK0,iPr_def_10) = sK3,
    inference(superposition,[status(thm)],[c_3829,c_161]) ).

tcf(c_5415,plain,
    sK1 = sK3,
    inference(light_normalisation,[status(thm)],[c_5400,c_5399]) ).

tcf(c_5416,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_5415,c_3831]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO498+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n007.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Wed Sep 23 12:11:37 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  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.09/0.41  
% 0.09/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41  
% 0.09/0.41  % Detected problem language: tptp
% 0.09/0.42  % Proving...
% 3.40/1.28  % SZS status Started for theBenchmark.p
% 3.40/1.28  % SZS status Theorem for theBenchmark.p
% 3.40/1.28  
% 3.40/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.40/1.28  
% 3.40/1.28  % ------  iProver source info
% 3.40/1.28  
% 3.40/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 3.40/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.40/1.28  % git: non_committed_changes: false
% 3.40/1.28  
% 3.40/1.28  % ------ Parsing...
% 3.40/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.40/1.28  
% 3.40/1.28  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 3.40/1.28  
% 3.40/1.28  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.40/1.28  
% 3.40/1.28  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.40/1.28  % ------ Proving...
% 3.40/1.28  % ------ Problem Properties 
% 3.40/1.28  
% 3.40/1.28  % 
% 3.40/1.28  % clauses                               126
% 3.40/1.28  % conjectures                           3
% 3.40/1.28  % EPR                                   100
% 3.40/1.28  % Horn                                  99
% 3.40/1.28  % unary                                 28
% 3.40/1.28  % binary                                39
% 3.40/1.28  % lits                                  353
% 3.40/1.28  % lits eq                               61
% 3.40/1.28  % fd_pure                               0
% 3.40/1.28  % fd_pseudo                             0
% 3.40/1.28  % fd_cond                               0
% 3.40/1.28  % fd_pseudo_cond                        31
% 3.40/1.28  % AC symbols                            0
% 3.40/1.28  
% 3.40/1.28  % ------ Schedule dynamic 5 is on 
% 3.40/1.28  
% 3.40/1.28  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.40/1.28  
% 3.40/1.28  
% 3.40/1.28  % ------ 
% 3.40/1.28  % Current options:
% 3.40/1.28  % ------ 
% 3.40/1.28  
% 3.40/1.28  
% 3.40/1.28  % 
% 3.40/1.28  
% 3.40/1.28  % ------ Proving...
% 3.40/1.28  % 
% 3.40/1.28  
% 3.40/1.28  % SZS status Theorem for theBenchmark.p
% 3.40/1.28  
% 3.40/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.40/1.28  
% 3.40/1.28  
%------------------------------------------------------------------------------