↑ Up

Zipperpin---2.1.9999.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : SYN071-1 : TPTP v9.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.TuuLLIhrrs true

% Computer : n007.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 : Thu Oct  2 05:03:56 PM UTC 2025

% Result   : Unsatisfiable 0.57s 0.76s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   34 (  33 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   19 (   8   ~;  11   |;   0   &;   0   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(d_type,type,
    d: $i ).

thf(c_type,type,
    c: $i ).

thf(b_type,type,
    b: $i ).

thf(a_type,type,
    a: $i ).

thf(clause_2,axiom,
    ( ( a = c )
    | ( b = d ) ) ).

thf(zip_derived_cl1,plain,
    ( ( a = c )
    | ( b = d ) ),
    inference(cnf,[status(esa)],[clause_2]) ).

thf(zip_derived_cl1_001,plain,
    ( ( a = c )
    | ( b = d ) ),
    inference(cnf,[status(esa)],[clause_2]) ).

thf(clause_1,axiom,
    ( ( a = b )
    | ( c = d ) ) ).

thf(zip_derived_cl0,plain,
    ( ( a = b )
    | ( c = d ) ),
    inference(cnf,[status(esa)],[clause_1]) ).

thf(zip_derived_cl5,plain,
    ( ( a = c )
    | ( a = b )
    | ( c = b ) ),
    inference('s_sup+',[status(thm)],[zip_derived_cl1,zip_derived_cl0]) ).

thf(clause_4,conjecture,
    b = c ).

thf(zf_stmt_0,negated_conjecture,
    b != c,
    inference('cnf.neg',[status(esa)],[clause_4]) ).

thf(zip_derived_cl3,plain,
    b != c,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl7,plain,
    ( ( a = c )
    | ( a = b ) ),
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl5,zip_derived_cl3]) ).

thf(zip_derived_cl0_002,plain,
    ( ( a = b )
    | ( c = d ) ),
    inference(cnf,[status(esa)],[clause_1]) ).

thf(clause_3,conjecture,
    a = d ).

thf(zf_stmt_1,negated_conjecture,
    a != d,
    inference('cnf.neg',[status(esa)],[clause_3]) ).

thf(zip_derived_cl2,plain,
    a != d,
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl4,plain,
    ( ( a = b )
    | ( a != c ) ),
    inference('s_sup-',[status(thm)],[zip_derived_cl0,zip_derived_cl2]) ).

thf(zip_derived_cl8,plain,
    a = b,
    inference(clc,[status(thm)],[zip_derived_cl7,zip_derived_cl4]) ).

thf(zip_derived_cl9,plain,
    ( ( a = c )
    | ( a = d ) ),
    inference(demod,[status(thm)],[zip_derived_cl1,zip_derived_cl8]) ).

thf(zip_derived_cl2_003,plain,
    a != d,
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl10,plain,
    a = c,
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl9,zip_derived_cl2]) ).

thf(zip_derived_cl3_004,plain,
    b != c,
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl8_005,plain,
    a = b,
    inference(clc,[status(thm)],[zip_derived_cl7,zip_derived_cl4]) ).

thf(zip_derived_cl11,plain,
    a != c,
    inference(demod,[status(thm)],[zip_derived_cl3,zip_derived_cl8]) ).

thf(zip_derived_cl14,plain,
    $false,
    inference('simplify_reflect-',[status(thm)],[zip_derived_cl10,zip_derived_cl11]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYN071-1 : TPTP v9.2.0. Released v1.0.0.
% 0.15/0.14  % Command  : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.TuuLLIhrrs true
% 0.15/0.36  % Computer : n007.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Wed Oct  1 13:34:08 EDT 2025
% 0.15/0.36  % CPUTime  : 
% 0.15/0.36  % Running portfolio for 300 s
% 0.15/0.36  % File         : /export/starexec/sandbox2/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.57/0.67  % Total configuration time : 435
% 0.57/0.67  % Estimated wc time : 1092
% 0.57/0.67  % Estimated cpu time (7 cpus) : 156.0
% 0.57/0.73  % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.57/0.74  % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.57/0.76  % Solved by fo/fo6_bce.sh.
% 0.57/0.76  % BCE start: 4
% 0.57/0.76  % BCE eliminated: 0
% 0.57/0.76  % PE start: 4
% 0.57/0.76  logic: eq
% 0.57/0.76  % PE eliminated: 0
% 0.57/0.76  % done 8 iterations in 0.006s
% 0.57/0.76  % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.57/0.76  % SZS output start Refutation
% See solution above
% 0.57/0.76  
% 0.57/0.76  
% 0.57/0.76  % Terminating...
% 1.41/0.87  % Runner terminated.
% 1.41/0.88  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------