TSTP Solution File: SYN050-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SYN050-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n003.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 23:53:20 EDT 2022
% Result : Unsatisfiable 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 38 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 124 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 176 ( 87 ~; 75 |; 0 &)
% ( 14 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 47 !; 0 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
tff(big_r_type,type,
big_r: $i > $o ).
tff(f_type,type,
f: ( $i * $i ) > $i ).
tff(b_type,type,
b: $i ).
tff(a_type,type,
a: $i ).
tff(big_q_type,type,
big_q: $i > $o ).
tff(big_p_type,type,
big_p: $i > $o ).
tff(1,plain,
( big_q(b)
<=> big_q(b) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
big_q(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
tff(3,plain,
big_q(b),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
( big_p(a)
<=> big_p(a) ),
inference(rewrite,[status(thm)],]) ).
tff(5,axiom,
big_p(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
tff(6,plain,
big_p(a),
inference(modus_ponens,[status(thm)],[5,4]) ).
tff(7,plain,
^ [Z: $i,Y: $i] :
refl(
( ( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
<=> ( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) ) )),
inference(bind,[status(th)],]) ).
tff(8,plain,
( ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
<=> ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) ) ),
inference(quant_intro,[status(thm)],[7]) ).
tff(9,plain,
( ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
<=> ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) ) ),
inference(rewrite,[status(thm)],]) ).
tff(10,plain,
^ [Z: $i,Y: $i] :
rewrite(
( ( ~ big_p(Y)
| ~ big_q(Z)
| big_r(f(Y,Z)) )
<=> ( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) ) )),
inference(bind,[status(th)],]) ).
tff(11,plain,
( ! [Z: $i,Y: $i] :
( ~ big_p(Y)
| ~ big_q(Z)
| big_r(f(Y,Z)) )
<=> ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) ) ),
inference(quant_intro,[status(thm)],[10]) ).
tff(12,axiom,
! [Z: $i,Y: $i] :
( ~ big_p(Y)
| ~ big_q(Z)
| big_r(f(Y,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
tff(13,plain,
! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) ),
inference(modus_ponens,[status(thm)],[12,11]) ).
tff(14,plain,
! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) ),
inference(modus_ponens,[status(thm)],[13,9]) ).
tff(15,plain,
! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) ),
inference(skolemize,[status(sab)],[14]) ).
tff(16,plain,
! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) ),
inference(modus_ponens,[status(thm)],[15,8]) ).
tff(17,plain,
( ( ~ ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
| ~ big_q(b)
| ~ big_p(a)
| big_r(f(a,b)) )
<=> ( ~ ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
| ~ big_q(b)
| ~ big_p(a)
| big_r(f(a,b)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(18,plain,
( ( big_r(f(a,b))
| ~ big_q(b)
| ~ big_p(a) )
<=> ( ~ big_q(b)
| ~ big_p(a)
| big_r(f(a,b)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(19,plain,
( ( ~ ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
| big_r(f(a,b))
| ~ big_q(b)
| ~ big_p(a) )
<=> ( ~ ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
| ~ big_q(b)
| ~ big_p(a)
| big_r(f(a,b)) ) ),
inference(monotonicity,[status(thm)],[18]) ).
tff(20,plain,
( ( ~ ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
| big_r(f(a,b))
| ~ big_q(b)
| ~ big_p(a) )
<=> ( ~ ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
| ~ big_q(b)
| ~ big_p(a)
| big_r(f(a,b)) ) ),
inference(transitivity,[status(thm)],[19,17]) ).
tff(21,plain,
( ~ ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
| big_r(f(a,b))
| ~ big_q(b)
| ~ big_p(a) ),
inference(quant_inst,[status(thm)],]) ).
tff(22,plain,
( ~ ! [Z: $i,Y: $i] :
( big_r(f(Y,Z))
| ~ big_q(Z)
| ~ big_p(Y) )
| ~ big_q(b)
| ~ big_p(a)
| big_r(f(a,b)) ),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
big_r(f(a,b)),
inference(unit_resolution,[status(thm)],[22,16,6,3]) ).
tff(24,plain,
^ [W: $i] :
refl(
( ~ big_r(W)
<=> ~ big_r(W) )),
inference(bind,[status(th)],]) ).
tff(25,plain,
( ! [W: $i] : ~ big_r(W)
<=> ! [W: $i] : ~ big_r(W) ),
inference(quant_intro,[status(thm)],[24]) ).
tff(26,plain,
( ! [W: $i] : ~ big_r(W)
<=> ! [W: $i] : ~ big_r(W) ),
inference(rewrite,[status(thm)],]) ).
tff(27,axiom,
! [W: $i] : ~ big_r(W),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
tff(28,plain,
! [W: $i] : ~ big_r(W),
inference(modus_ponens,[status(thm)],[27,26]) ).
tff(29,plain,
! [W: $i] : ~ big_r(W),
inference(skolemize,[status(sab)],[28]) ).
tff(30,plain,
! [W: $i] : ~ big_r(W),
inference(modus_ponens,[status(thm)],[29,25]) ).
tff(31,plain,
( ~ ! [W: $i] : ~ big_r(W)
| ~ big_r(f(a,b)) ),
inference(quant_inst,[status(thm)],]) ).
tff(32,plain,
$false,
inference(unit_resolution,[status(thm)],[31,30,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN050-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n003.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 : Mon Sep 5 01:21:56 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.13/0.38 % SZS status Unsatisfiable
% 0.13/0.38 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------