TSTP Solution File: LAT388+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : LAT388+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n014.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 : Sat Sep 17 18:33:41 EDT 2022
% Result : Theorem 0.21s 0.42s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 32 ( 17 unt; 7 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 35 ( 26 ~; 1 |; 1 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 4 ( 4 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 22 ( 5 !; 15 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
tff(aSupremumOfIn0_type,type,
aSupremumOfIn0: ( $i * $i * $i ) > $o ).
tff(cS1142_type,type,
cS1142: $i > $i ).
tff(xf_type,type,
xf: $i ).
tff(xT_type,type,
xT: $i ).
tff(xS_type,type,
xS: $i ).
tff(xp_type,type,
xp: $i ).
tff(aFixedPointOf0_type,type,
aFixedPointOf0: ( $i * $i ) > $o ).
tff(1,plain,
^ [W0: $i] :
refl(
( ~ aSupremumOfIn0(W0,xT,cS1142(xf))
<=> ~ aSupremumOfIn0(W0,xT,cS1142(xf)) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [W0: $i] : ~ aSupremumOfIn0(W0,xT,cS1142(xf))
<=> ! [W0: $i] : ~ aSupremumOfIn0(W0,xT,cS1142(xf)) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ~ ? [W0: $i] : aSupremumOfIn0(W0,xT,cS1142(xf))
<=> ~ ? [W0: $i] : aSupremumOfIn0(W0,xT,cS1142(xf)) ),
inference(rewrite,[status(thm)],]) ).
tff(4,plain,
( ~ ? [W0: $i] : aSupremumOfIn0(W0,xT,xS)
<=> ~ ? [W0: $i] : aSupremumOfIn0(W0,xT,cS1142(xf)) ),
inference(rewrite,[status(thm)],]) ).
tff(5,plain,
( ~ ? [W0: $i] : aSupremumOfIn0(W0,xT,xS)
<=> ~ ? [W0: $i] : aSupremumOfIn0(W0,xT,xS) ),
inference(rewrite,[status(thm)],]) ).
tff(6,axiom,
~ ? [W0: $i] : aSupremumOfIn0(W0,xT,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(7,plain,
~ ? [W0: $i] : aSupremumOfIn0(W0,xT,xS),
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
~ ? [W0: $i] : aSupremumOfIn0(W0,xT,xS),
inference(modus_ponens,[status(thm)],[7,5]) ).
tff(9,plain,
~ ? [W0: $i] : aSupremumOfIn0(W0,xT,xS),
inference(modus_ponens,[status(thm)],[8,5]) ).
tff(10,plain,
~ ? [W0: $i] : aSupremumOfIn0(W0,xT,xS),
inference(modus_ponens,[status(thm)],[9,5]) ).
tff(11,plain,
~ ? [W0: $i] : aSupremumOfIn0(W0,xT,cS1142(xf)),
inference(modus_ponens,[status(thm)],[10,4]) ).
tff(12,plain,
~ ? [W0: $i] : aSupremumOfIn0(W0,xT,cS1142(xf)),
inference(modus_ponens,[status(thm)],[11,3]) ).
tff(13,plain,
~ ? [W0: $i] : aSupremumOfIn0(W0,xT,cS1142(xf)),
inference(modus_ponens,[status(thm)],[12,3]) ).
tff(14,plain,
~ ? [W0: $i] : aSupremumOfIn0(W0,xT,cS1142(xf)),
inference(modus_ponens,[status(thm)],[13,3]) ).
tff(15,plain,
^ [W0: $i] : refl($oeq(~ aSupremumOfIn0(W0,xT,cS1142(xf)),~ aSupremumOfIn0(W0,xT,cS1142(xf)))),
inference(bind,[status(th)],]) ).
tff(16,plain,
! [W0: $i] : ~ aSupremumOfIn0(W0,xT,cS1142(xf)),
inference(nnf-neg,[status(sab)],[14,15]) ).
tff(17,plain,
! [W0: $i] : ~ aSupremumOfIn0(W0,xT,cS1142(xf)),
inference(modus_ponens,[status(thm)],[16,2]) ).
tff(18,plain,
( aSupremumOfIn0(xp,xT,xS)
<=> aSupremumOfIn0(xp,xT,cS1142(xf)) ),
inference(rewrite,[status(thm)],]) ).
tff(19,plain,
( aSupremumOfIn0(xp,xT,xS)
<=> aSupremumOfIn0(xp,xT,xS) ),
inference(rewrite,[status(thm)],]) ).
tff(20,axiom,
( aFixedPointOf0(xp,xf)
& aSupremumOfIn0(xp,xT,xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).
tff(21,plain,
aSupremumOfIn0(xp,xT,xS),
inference(and_elim,[status(thm)],[20]) ).
tff(22,plain,
aSupremumOfIn0(xp,xT,xS),
inference(modus_ponens,[status(thm)],[21,19]) ).
tff(23,plain,
aSupremumOfIn0(xp,xT,cS1142(xf)),
inference(modus_ponens,[status(thm)],[22,18]) ).
tff(24,plain,
( ~ ! [W0: $i] : ~ aSupremumOfIn0(W0,xT,cS1142(xf))
| ~ aSupremumOfIn0(xp,xT,cS1142(xf)) ),
inference(quant_inst,[status(thm)],]) ).
tff(25,plain,
$false,
inference(unit_resolution,[status(thm)],[24,23,17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LAT388+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Sep 1 16:49:31 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.36 Usage: tptp [options] [-file:]file
% 0.13/0.36 -h, -? prints this message.
% 0.13/0.36 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.36 -m, -model generate model.
% 0.13/0.36 -p, -proof generate proof.
% 0.13/0.36 -c, -core generate unsat core of named formulas.
% 0.13/0.36 -st, -statistics display statistics.
% 0.13/0.36 -t:timeout set timeout (in second).
% 0.13/0.36 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.36 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.36 -<param>:<value> configuration parameter and value.
% 0.13/0.36 -o:<output-file> file to place output in.
% 0.21/0.42 % SZS status Theorem
% 0.21/0.42 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------