TSTP Solution File: SWV074+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV074+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n025.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 Sep 29 15:09:52 EDT 2022
% Result : Theorem 0.20s 0.41s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 20 ( 1 unt; 8 typ; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 86 ( 5 ~; 0 |; 64 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(leq_type,type,
leq: ( $i * $i ) > $o ).
tff(minus_type,type,
minus: ( $i * $i ) > $i ).
tff(n1_type,type,
n1: $i ).
tff(n135300_type,type,
n135300: $i ).
tff(pv36_type,type,
pv36: $i ).
tff(n5_type,type,
n5: $i ).
tff(pv31_type,type,
pv31: $i ).
tff(n0_type,type,
n0: $i ).
tff(1,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(2,plain,
( ( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) )
<=> $true ),
inference(rewrite,[status(thm)],]) ).
tff(3,plain,
( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
<=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,plain,
( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1)) )
<=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(5,plain,
( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
<=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) ),
inference(monotonicity,[status(thm)],[4]) ).
tff(6,plain,
( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
<=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) ),
inference(transitivity,[status(thm)],[5,3]) ).
tff(7,plain,
( ( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) )
<=> ( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) ) ),
inference(monotonicity,[status(thm)],[6,6]) ).
tff(8,plain,
( ( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) )
<=> $true ),
inference(transitivity,[status(thm)],[7,2]) ).
tff(9,plain,
( ~ ( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) )
<=> ~ $true ),
inference(monotonicity,[status(thm)],[8]) ).
tff(10,plain,
( ~ ( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) )
<=> $false ),
inference(transitivity,[status(thm)],[9,1]) ).
tff(11,axiom,
~ ( ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) )
=> ( leq(n0,pv31)
& leq(n0,pv36)
& leq(pv31,minus(n5,n1))
& leq(pv36,minus(n135300,n1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0015) ).
tff(12,plain,
$false,
inference(modus_ponens,[status(thm)],[11,10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV074+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Sep 4 01:27:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.35 Usage: tptp [options] [-file:]file
% 0.12/0.35 -h, -? prints this message.
% 0.12/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.35 -m, -model generate model.
% 0.12/0.35 -p, -proof generate proof.
% 0.12/0.35 -c, -core generate unsat core of named formulas.
% 0.12/0.35 -st, -statistics display statistics.
% 0.12/0.35 -t:timeout set timeout (in second).
% 0.12/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.35 -<param>:<value> configuration parameter and value.
% 0.12/0.35 -o:<output-file> file to place output in.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------