TSTP Solution File: SET074-7 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET074-7 : TPTP v8.1.0. Bugfixed v2.1.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 : Tue Sep 20 05:05:24 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 32 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 73 ( 40 ~; 23 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 36 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
tff(member_type,type,
member: ( $i * $i ) > $o ).
tff(unordered_pair_type,type,
unordered_pair: ( $i * $i ) > $i ).
tff(y_type,type,
y: $i ).
tff(x_type,type,
x: $i ).
tff(universal_class_type,type,
universal_class: $i ).
tff(null_class_type,type,
null_class: $i ).
tff(1,plain,
( member(y,universal_class)
<=> member(y,universal_class) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom2_1) ).
tff(3,plain,
member(y,universal_class),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [Y: $i,X: $i] :
refl(
( ( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) )
<=> ( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) ) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) )
<=> ! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) )
<=> ! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(7,axiom,
! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
tff(8,plain,
! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) ),
inference(modus_ponens,[status(thm)],[7,6]) ).
tff(9,plain,
! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) ),
inference(skolemize,[status(sab)],[8]) ).
tff(10,plain,
! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) ),
inference(modus_ponens,[status(thm)],[9,5]) ).
tff(11,plain,
( ( ~ ! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) )
| ~ member(y,universal_class)
| member(y,unordered_pair(x,y)) )
<=> ( ~ ! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) )
| ~ member(y,universal_class)
| member(y,unordered_pair(x,y)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(12,plain,
( ~ ! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) )
| ~ member(y,universal_class)
| member(y,unordered_pair(x,y)) ),
inference(quant_inst,[status(thm)],]) ).
tff(13,plain,
( ~ ! [Y: $i,X: $i] :
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) )
| ~ member(y,universal_class)
| member(y,unordered_pair(x,y)) ),
inference(modus_ponens,[status(thm)],[12,11]) ).
tff(14,plain,
member(y,unordered_pair(x,y)),
inference(unit_resolution,[status(thm)],[13,10,3]) ).
tff(15,plain,
^ [Z: $i] :
refl(
( ~ member(Z,unordered_pair(x,y))
<=> ~ member(Z,unordered_pair(x,y)) )),
inference(bind,[status(th)],]) ).
tff(16,plain,
( ! [Z: $i] : ~ member(Z,unordered_pair(x,y))
<=> ! [Z: $i] : ~ member(Z,unordered_pair(x,y)) ),
inference(quant_intro,[status(thm)],[15]) ).
tff(17,plain,
^ [Z: $i] :
rewrite(
( ~ member(Z,null_class)
<=> ~ member(Z,unordered_pair(x,y)) )),
inference(bind,[status(th)],]) ).
tff(18,plain,
( ! [Z: $i] : ~ member(Z,null_class)
<=> ! [Z: $i] : ~ member(Z,unordered_pair(x,y)) ),
inference(quant_intro,[status(thm)],[17]) ).
tff(19,plain,
( ! [Z: $i] : ~ member(Z,null_class)
<=> ! [Z: $i] : ~ member(Z,null_class) ),
inference(rewrite,[status(thm)],]) ).
tff(20,axiom,
! [Z: $i] : ~ member(Z,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_null_class) ).
tff(21,plain,
! [Z: $i] : ~ member(Z,null_class),
inference(modus_ponens,[status(thm)],[20,19]) ).
tff(22,plain,
! [Z: $i] : ~ member(Z,unordered_pair(x,y)),
inference(modus_ponens,[status(thm)],[21,18]) ).
tff(23,plain,
! [Z: $i] : ~ member(Z,unordered_pair(x,y)),
inference(skolemize,[status(sab)],[22]) ).
tff(24,plain,
! [Z: $i] : ~ member(Z,unordered_pair(x,y)),
inference(modus_ponens,[status(thm)],[23,16]) ).
tff(25,plain,
( ~ ! [Z: $i] : ~ member(Z,unordered_pair(x,y))
| ~ member(y,unordered_pair(x,y)) ),
inference(quant_inst,[status(thm)],]) ).
tff(26,plain,
$false,
inference(unit_resolution,[status(thm)],[25,24,14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET074-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34 % Computer : n014.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 : Sat Sep 3 02:05:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.19/0.42 % SZS status Unsatisfiable
% 0.19/0.42 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------