TSTP Solution File: SWC151-1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SWC151-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n009.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 Sep 20 11:55:39 EDT 2022

% Result   : Unsatisfiable 0.13s 0.37s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   12 (   6 unt;   3 typ;   0 def)
%            Number of atoms       :   12 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   4   ~;   0   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(totalorderP_type,type,
    totalorderP: $i > $o ).

tff(sk4_type,type,
    sk4: $i ).

tff(sk2_type,type,
    sk2: $i ).

tff(1,plain,
    ( ~ totalorderP(sk4)
  <=> ~ totalorderP(sk4) ),
    inference(rewrite,[status(thm)],]) ).

tff(2,axiom,
    ~ totalorderP(sk4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

tff(3,plain,
    ~ totalorderP(sk4),
    inference(modus_ponens,[status(thm)],[2,1]) ).

tff(4,plain,
    ( totalorderP(sk2)
  <=> totalorderP(sk4) ),
    inference(rewrite,[status(thm)],]) ).

tff(5,plain,
    ( totalorderP(sk2)
  <=> totalorderP(sk2) ),
    inference(rewrite,[status(thm)],]) ).

tff(6,axiom,
    totalorderP(sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

tff(7,plain,
    totalorderP(sk2),
    inference(modus_ponens,[status(thm)],[6,5]) ).

tff(8,plain,
    totalorderP(sk4),
    inference(modus_ponens,[status(thm)],[7,4]) ).

tff(9,plain,
    $false,
    inference(unit_resolution,[status(thm)],[8,3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SWC151-1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.10  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.08/0.30  % Computer : n009.cluster.edu
% 0.08/0.30  % Model    : x86_64 x86_64
% 0.08/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30  % Memory   : 8042.1875MB
% 0.08/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30  % CPULimit : 300
% 0.08/0.30  % WCLimit  : 300
% 0.08/0.30  % DateTime : Sat Sep  3 21:51:05 EDT 2022
% 0.08/0.30  % CPUTime  : 
% 0.08/0.30  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.08/0.30  Usage: tptp [options] [-file:]file
% 0.08/0.30    -h, -?       prints this message.
% 0.08/0.30    -smt2        print SMT-LIB2 benchmark.
% 0.08/0.30    -m, -model   generate model.
% 0.08/0.30    -p, -proof   generate proof.
% 0.08/0.30    -c, -core    generate unsat core of named formulas.
% 0.08/0.30    -st, -statistics display statistics.
% 0.08/0.30    -t:timeout   set timeout (in second).
% 0.08/0.30    -smt2status  display status in smt2 format instead of SZS.
% 0.08/0.30    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.08/0.30    -<param>:<value> configuration parameter and value.
% 0.08/0.30    -o:<output-file> file to place output in.
% 0.13/0.37  % SZS status Unsatisfiable
% 0.13/0.37  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------