↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : DAT063_1 : TPTP v9.3.1. Released v5.5.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 01:13:57 PM UTC 2026

% Result   : Theorem 1.31s 1.29s
% Output   : CNFRefutation 1.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   14 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   10 (   6   ~;   0   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :    4 (   4 atm;   0 fun;   0 num;   0 var)
%            Number of types       :    3 (   1 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn   5   !;   1   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    empty: heap ).

tff(pred_def_1,type,
    lsls: ( heap * heap ) > $o ).

tff(func_def_2,type,
    app: ( $int * heap ) > heap ).

tff(func_def_3,type,
    toop: heap > $int ).

tff(func_def_4,type,
    length: heap > $int ).

tff(type_def_5,type,
    heap: $tType ).

tff(func_def_9,type,
    sK0: heap ).

tff(f10,axiom,
    ! [X0: heap] : ~ lsls(X0,empty),
    file('/export/starexec/sandbox/benchmark/Axioms/DAT005_0.ax',ax_26) ).

tff(f12,conjecture,
    ! [X0: heap] :
      ( lsls(X0,empty)
     => $less(length(X0),length(empty)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_1b) ).

tff(f13,negated_conjecture,
    ~ ! [X0: heap] :
        ( lsls(X0,empty)
       => $less(length(X0),length(empty)) ),
    inference(negated_conjecture,[status(cth)],[f12]) ).

tff(f28,plain,
    ? [X0: heap] :
      ( lsls(X0,empty)
      & ~ $less(length(X0),length(empty)) ),
    inference(ennf_transformation,[],[f13]) ).

tff(f33,plain,
    ( lsls(sK0,empty)
    & ~ $less(length(sK0),length(empty)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f28]) ).

tff(f45,plain,
    ! [X0: heap] : ~ lsls(X0,empty),
    inference(cnf_transformation,[],[f10]) ).

tff(f49,plain,
    lsls(sK0,empty),
    inference(cnf_transformation,[],[f33]) ).

tcf(c_71,plain,
    ! [X0_heap: heap] : ~ lsls(X0_heap,empty),
    inference(cnf_transformation,[],[f45]) ).

tcf(c_76,negated_conjecture,
    lsls(sK0,empty),
    inference(cnf_transformation,[],[f49]) ).

tcf(c_162,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_76,c_71]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : DAT063_1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37  % Computer : n026.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep 25 10:25: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.41  Running TFA theorem proving
% 0.10/0.41  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.42  
% 0.10/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42  
% 0.10/0.42  % Detected problem language: tptp
% 0.10/0.43  % Proving...
% 1.31/1.29  % SZS status Started for theBenchmark.p
% 1.31/1.29  % SZS status Theorem for theBenchmark.p
% 1.31/1.29  
% 1.31/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.31/1.29  
% 1.31/1.29  % ------  iProver source info
% 1.31/1.29  
% 1.31/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 1.31/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.31/1.29  % git: non_committed_changes: false
% 1.31/1.29  
% 1.31/1.29  % ------ Parsing...
% 1.31/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.31/1.29  
% 1.31/1.29  % ------ Preprocessing...% 
% 1.31/1.29  
% 1.31/1.29  % SZS status Theorem for theBenchmark.p
% 1.31/1.29  
% 1.31/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.31/1.29  
% 1.31/1.29  
%------------------------------------------------------------------------------