TSTP Solution File: LCL648+1.001 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : LCL648+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n013.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 : Sun Sep 18 04:57:03 EDT 2022
% Result : Theorem 0.19s 0.37s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 15 ( 2 unt; 3 typ; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 7 ( 9 avg)
% Number of connectives : 179 ( 94 ~; 41 |; 28 &)
% ( 16 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 13 ( 13 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 38 ( 28 !; 9 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
tff(p101_type,type,
p101: $i > $o ).
tff(p201_type,type,
p201: $i > $o ).
tff(r1_type,type,
r1: ( $i * $i ) > $o ).
tff(1,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(2,plain,
( ~ $false
<=> $true ),
inference(rewrite,[status(thm)],]) ).
tff(3,plain,
( ? [X: $i] : $false
<=> $false ),
inference(elim_unused_vars,[status(thm)],]) ).
tff(4,plain,
^ [X: $i] :
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
<=> ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )),
( ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) ) )),
rewrite(
( ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> $true )),
( ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> $true )),
( ~ ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> ~ $true )),
rewrite(
( ~ $true
<=> $false )),
( ~ ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> $false )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ? [X: $i] :
~ ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> ? [X: $i] : $false ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ? [X: $i] :
~ ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> $false ),
inference(transitivity,[status(thm)],[5,3]) ).
tff(7,plain,
( ~ ? [X: $i] :
~ ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> ~ $false ),
inference(monotonicity,[status(thm)],[6]) ).
tff(8,plain,
( ~ ? [X: $i] :
~ ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> $true ),
inference(transitivity,[status(thm)],[7,2]) ).
tff(9,plain,
( ~ ~ ? [X: $i] :
~ ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> ~ $true ),
inference(monotonicity,[status(thm)],[8]) ).
tff(10,plain,
( ~ ~ ? [X: $i] :
~ ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) )
<=> $false ),
inference(transitivity,[status(thm)],[9,1]) ).
tff(11,axiom,
~ ~ ? [X: $i] :
~ ( ~ ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y: $i] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
tff(12,plain,
$false,
inference(modus_ponens,[status(thm)],[11,10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL648+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Sep 1 22:55:32 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.19/0.37 % SZS status Theorem
% 0.19/0.37 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------