TSTP Solution File: SWV061+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV061+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n008.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:48 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 26 ( 2 unt; 4 typ; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 104 ( 32 ~; 34 |; 16 &)
% ( 16 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(true_type,type,
true: $o ).
tff(gt_type,type,
gt: ( $i * $i ) > $o ).
tff(n1_type,type,
n1: $i ).
tff(loopcounter_type,type,
loopcounter: $i ).
tff(1,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(2,plain,
( ( $true
& $true )
<=> $true ),
inference(rewrite,[status(thm)],]) ).
tff(3,plain,
( ( ~ gt(loopcounter,n1)
| $true )
<=> $true ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',ttrue) ).
tff(5,plain,
( true
<=> $true ),
inference(iff_true,[status(thm)],[4]) ).
tff(6,plain,
( ( ~ gt(loopcounter,n1)
| true )
<=> ( ~ gt(loopcounter,n1)
| $true ) ),
inference(monotonicity,[status(thm)],[5]) ).
tff(7,plain,
( ( ~ gt(loopcounter,n1)
| true )
<=> $true ),
inference(transitivity,[status(thm)],[6,3]) ).
tff(8,plain,
( ( gt(loopcounter,n1)
| $true )
<=> $true ),
inference(rewrite,[status(thm)],]) ).
tff(9,plain,
( ( gt(loopcounter,n1)
| true )
<=> ( gt(loopcounter,n1)
| $true ) ),
inference(monotonicity,[status(thm)],[5]) ).
tff(10,plain,
( ( gt(loopcounter,n1)
| true )
<=> $true ),
inference(transitivity,[status(thm)],[9,8]) ).
tff(11,plain,
( ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) )
<=> ( $true
& $true ) ),
inference(monotonicity,[status(thm)],[10,7]) ).
tff(12,plain,
( ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) )
<=> $true ),
inference(transitivity,[status(thm)],[11,2]) ).
tff(13,plain,
( ~ ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) )
<=> ~ $true ),
inference(monotonicity,[status(thm)],[12]) ).
tff(14,plain,
( ~ ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) )
<=> $false ),
inference(transitivity,[status(thm)],[13,1]) ).
tff(15,plain,
( ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) )
<=> ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(16,plain,
( ~ ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) )
<=> ~ ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) ) ),
inference(monotonicity,[status(thm)],[15]) ).
tff(17,plain,
( ~ ( true
=> ( ( ~ gt(loopcounter,n1)
=> true )
& ( gt(loopcounter,n1)
=> true ) ) )
<=> ~ ( ~ true
| ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(18,axiom,
~ ( true
=> ( ( ~ gt(loopcounter,n1)
=> true )
& ( gt(loopcounter,n1)
=> true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0002) ).
tff(19,plain,
~ ( ~ true
| ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) ) ),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
~ ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) ),
inference(or_elim,[status(thm)],[19]) ).
tff(21,plain,
~ ( ( gt(loopcounter,n1)
| true )
& ( ~ gt(loopcounter,n1)
| true ) ),
inference(modus_ponens,[status(thm)],[20,16]) ).
tff(22,plain,
$false,
inference(modus_ponens,[status(thm)],[21,14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWV061+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Sep 4 01:19:40 EDT 2022
% 0.13/0.34 % 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.20/0.43 % SZS status Theorem
% 0.20/0.43 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------