↑ Up

Zipperpin---2.1.9999.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SWX200+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.R6dhu1g9QJ true

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 07:08:48 PM UTC 2026

% Result   : Theorem 0.57s 0.75s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   16 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   28 (   2 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   74 (  10   ~;   6   |;   1   &;  52   @)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (   0   ^;  17   !;   4   ?;  21   :)

% Comments : 
%------------------------------------------------------------------------------
thf(nil_type,type,
    nil: $i ).

thf(leqNat_type,type,
    leqNat: $i > $i > $o ).

thf(merge_type,type,
    merge: $i > $i > $i ).

thf(cons_type,type,
    cons: $i > $i > $i ).

thf(ord_type,type,
    ord: $i > $o ).

thf(z_type,type,
    z: $i ).

thf(s_type,type,
    s: $i > $i ).

thf(axiom_007,axiom,
    ! [Z: $i] :
      ~ ( leqNat @ ( s @ Z ) @ z ) ).

thf(zip_derived_cl6,plain,
    ! [X0: $i] :
      ~ ( leqNat @ ( s @ X0 ) @ z ),
    inference(cnf,[status(esa)],[axiom_007]) ).

thf(axiom_015,axiom,
    ! [Y: $i,Y2: $i,Xs: $i] :
      ( ( ord @ ( cons @ Y @ ( cons @ Y2 @ Xs ) ) )
    <=> ( ( leqNat @ Y @ Y2 )
        & ( ord @ ( cons @ Y2 @ Xs ) ) ) ) ).

thf(zip_derived_cl15,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( leqNat @ X0 @ X1 )
      | ~ ( ord @ ( cons @ X0 @ ( cons @ X1 @ X2 ) ) ) ),
    inference(cnf,[status(esa)],[axiom_015]) ).

thf(axiom_009,axiom,
    ! [Y: $i] :
      ( ( merge @ nil @ Y )
      = Y ) ).

thf(zip_derived_cl9,plain,
    ! [X0: $i] :
      ( ( merge @ nil @ X0 )
      = X0 ),
    inference(cnf,[status(esa)],[axiom_009]) ).

thf(goal_016,conjecture,
    ? [Xs: $i,Ys: $i] :
      ~ ( ( ord @ Xs )
       => ( ~ ( ord @ Ys )
         => ( ord @ ( merge @ Xs @ Ys ) ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ~ ? [Xs: $i,Ys: $i] :
        ~ ( ( ord @ Xs )
         => ( ~ ( ord @ Ys )
           => ( ord @ ( merge @ Xs @ Ys ) ) ) ),
    inference('cnf.neg',[status(esa)],[goal_016]) ).

thf(zip_derived_cl18,plain,
    ! [X0: $i,X1: $i] :
      ( ~ ( ord @ X0 )
      | ( ord @ ( merge @ X0 @ X1 ) )
      | ( ord @ X1 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl61,plain,
    ! [X0: $i] :
      ( ~ ( ord @ nil )
      | ( ord @ X0 )
      | ( ord @ X0 ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl9,zip_derived_cl18]) ).

thf(axiom_013,axiom,
    ord @ nil ).

thf(zip_derived_cl13,plain,
    ord @ nil,
    inference(cnf,[status(esa)],[axiom_013]) ).

thf(zip_derived_cl63,plain,
    ! [X0: $i] :
      ( ( ord @ X0 )
      | ( ord @ X0 ) ),
    inference(demod,[status(thm)],[zip_derived_cl61,zip_derived_cl13]) ).

thf(zip_derived_cl64,plain,
    ! [X0: $i] : ( ord @ X0 ),
    inference(simplify,[status(thm)],[zip_derived_cl63]) ).

thf(zip_derived_cl65,plain,
    ! [X0: $i,X1: $i] : ( leqNat @ X0 @ X1 ),
    inference(demod,[status(thm)],[zip_derived_cl15,zip_derived_cl64]) ).

thf(zip_derived_cl66,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl6,zip_derived_cl65]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWX200+1 : TPTP v9.3.0. Released v9.3.0.
% 0.13/0.14  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.R6dhu1g9QJ true
% 0.18/0.35  % Computer : n001.cluster.edu
% 0.18/0.35  % Model    : x86_64 x86_64
% 0.18/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35  % Memory   : 8042.1875MB
% 0.18/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35  % CPULimit : 300
% 0.18/0.35  % WCLimit  : 300
% 0.18/0.35  % DateTime : Tue May  5 11:16:03 EDT 2026
% 0.18/0.35  % CPUTime  : 
% 0.18/0.35  % Running portfolio for 300 s
% 0.18/0.35  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.36  % Number of cores: 8
% 0.22/0.36  % Python version: Python 3.6.8
% 0.22/0.36  % Running in FO mode
% 0.55/0.65  % Total configuration time : 435
% 0.55/0.65  % Estimated wc time : 1092
% 0.55/0.65  % Estimated cpu time (7 cpus) : 156.0
% 0.57/0.71  % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.57/0.73  % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.57/0.75  % Solved by fo/fo6_bce.sh.
% 0.57/0.75  % BCE start: 19
% 0.57/0.75  % BCE eliminated: 0
% 0.57/0.75  % PE start: 19
% 0.57/0.75  logic: eq
% 0.57/0.75  % PE eliminated: 0
% 0.57/0.75  % done 15 iterations in 0.016s
% 0.57/0.75  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.57/0.75  % SZS output start Refutation
% See solution above
% 0.57/0.75  
% 0.57/0.75  
% 0.57/0.75  % Terminating...
% 0.62/0.86  % Runner terminated.
% 0.62/0.87  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------