TSTP Solution File: CAT006-4 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : CAT006-4 : TPTP v8.1.0. Released v1.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 : Tue Sep 6 17:29:41 EDT 2022
% Result : Unsatisfiable 0.13s 0.40s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 37
% Syntax : Number of formulae : 84 ( 25 unt; 6 typ; 0 def)
% Number of atoms : 217 ( 69 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 239 ( 107 ~; 100 |; 0 &)
% ( 32 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 7 ( 7 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 100 ( 90 !; 0 ?; 100 :)
% Comments :
%------------------------------------------------------------------------------
tff(there_exists_type,type,
there_exists: $i > $o ).
tff(compose_type,type,
compose: ( $i * $i ) > $i ).
tff(codomain_type,type,
codomain: $i > $i ).
tff(a_type,type,
a: $i ).
tff(d_type,type,
d: $i ).
tff(domain_type,type,
domain: $i > $i ).
tff(1,plain,
^ [X: $i] :
refl(
( ( compose(X,domain(X)) = X )
<=> ( compose(X,domain(X)) = X ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [X: $i] : ( compose(X,domain(X)) = X )
<=> ! [X: $i] : ( compose(X,domain(X)) = X ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [X: $i] : ( compose(X,domain(X)) = X )
<=> ! [X: $i] : ( compose(X,domain(X)) = X ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [X: $i] : ( compose(X,domain(X)) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',compose_domain) ).
tff(5,plain,
! [X: $i] : ( compose(X,domain(X)) = X ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [X: $i] : ( compose(X,domain(X)) = X ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [X: $i] : ( compose(X,domain(X)) = X ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [X: $i] : ( compose(X,domain(X)) = X )
| ( compose(d,domain(d)) = d ) ),
inference(quant_inst,[status(thm)],]) ).
tff(9,plain,
compose(d,domain(d)) = d,
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
( there_exists(compose(d,a))
<=> there_exists(compose(d,a)) ),
inference(rewrite,[status(thm)],]) ).
tff(11,axiom,
there_exists(compose(d,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',da_exists) ).
tff(12,plain,
there_exists(compose(d,a)),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
^ [Y: $i,X: $i] :
refl(
( ( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) )
<=> ( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ) )),
inference(bind,[status(th)],]) ).
tff(14,plain,
( ! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) )
<=> ! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ) ),
inference(quant_intro,[status(thm)],[13]) ).
tff(15,plain,
( ! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) )
<=> ! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(16,axiom,
! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_codomain_composition1) ).
tff(17,plain,
! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ),
inference(skolemize,[status(sab)],[17]) ).
tff(19,plain,
! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ),
inference(modus_ponens,[status(thm)],[18,14]) ).
tff(20,plain,
( ( ~ ! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) )
| ~ there_exists(compose(d,a))
| ( domain(d) = codomain(a) ) )
<=> ( ~ ! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) )
| ~ there_exists(compose(d,a))
| ( domain(d) = codomain(a) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(21,plain,
( ~ ! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) )
| ~ there_exists(compose(d,a))
| ( domain(d) = codomain(a) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(22,plain,
( ~ ! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) )
| ~ there_exists(compose(d,a))
| ( domain(d) = codomain(a) ) ),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
domain(d) = codomain(a),
inference(unit_resolution,[status(thm)],[22,19,12]) ).
tff(24,plain,
codomain(a) = domain(d),
inference(symmetry,[status(thm)],[23]) ).
tff(25,plain,
compose(d,codomain(a)) = compose(d,domain(d)),
inference(monotonicity,[status(thm)],[24]) ).
tff(26,plain,
compose(d,codomain(a)) = d,
inference(transitivity,[status(thm)],[25,9]) ).
tff(27,plain,
( there_exists(compose(d,codomain(a)))
<=> there_exists(d) ),
inference(monotonicity,[status(thm)],[26]) ).
tff(28,plain,
( there_exists(d)
<=> there_exists(compose(d,codomain(a))) ),
inference(symmetry,[status(thm)],[27]) ).
tff(29,plain,
^ [Y: $i,X: $i] :
refl(
( ( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) )
<=> ( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) ) )),
inference(bind,[status(th)],]) ).
tff(30,plain,
( ! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) )
<=> ! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) ) ),
inference(quant_intro,[status(thm)],[29]) ).
tff(31,plain,
( ! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) )
<=> ! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(32,plain,
^ [Y: $i,X: $i] :
rewrite(
( ( ~ there_exists(compose(X,Y))
| there_exists(domain(X)) )
<=> ( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) ) )),
inference(bind,[status(th)],]) ).
tff(33,plain,
( ! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| there_exists(domain(X)) )
<=> ! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) ) ),
inference(quant_intro,[status(thm)],[32]) ).
tff(34,axiom,
! [Y: $i,X: $i] :
( ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',composition_implies_domain) ).
tff(35,plain,
! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) ),
inference(modus_ponens,[status(thm)],[34,33]) ).
tff(36,plain,
! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) ),
inference(modus_ponens,[status(thm)],[35,31]) ).
tff(37,plain,
! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) ),
inference(skolemize,[status(sab)],[36]) ).
tff(38,plain,
! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) ),
inference(modus_ponens,[status(thm)],[37,30]) ).
tff(39,plain,
( ( ~ ! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) )
| there_exists(domain(d))
| ~ there_exists(compose(d,a)) )
<=> ( ~ ! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) )
| there_exists(domain(d))
| ~ there_exists(compose(d,a)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(40,plain,
( ~ ! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) )
| there_exists(domain(d))
| ~ there_exists(compose(d,a)) ),
inference(quant_inst,[status(thm)],]) ).
tff(41,plain,
( ~ ! [Y: $i,X: $i] :
( there_exists(domain(X))
| ~ there_exists(compose(X,Y)) )
| there_exists(domain(d))
| ~ there_exists(compose(d,a)) ),
inference(modus_ponens,[status(thm)],[40,39]) ).
tff(42,plain,
there_exists(domain(d)),
inference(unit_resolution,[status(thm)],[41,38,12]) ).
tff(43,plain,
^ [X: $i] :
refl(
( ( there_exists(X)
| ~ there_exists(domain(X)) )
<=> ( there_exists(X)
| ~ there_exists(domain(X)) ) )),
inference(bind,[status(th)],]) ).
tff(44,plain,
( ! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) )
<=> ! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) ) ),
inference(quant_intro,[status(thm)],[43]) ).
tff(45,plain,
( ! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) )
<=> ! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(46,plain,
^ [X: $i] :
rewrite(
( ( ~ there_exists(domain(X))
| there_exists(X) )
<=> ( there_exists(X)
| ~ there_exists(domain(X)) ) )),
inference(bind,[status(th)],]) ).
tff(47,plain,
( ! [X: $i] :
( ~ there_exists(domain(X))
| there_exists(X) )
<=> ! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) ) ),
inference(quant_intro,[status(thm)],[46]) ).
tff(48,axiom,
! [X: $i] :
( ~ there_exists(domain(X))
| there_exists(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_has_elements) ).
tff(49,plain,
! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) ),
inference(modus_ponens,[status(thm)],[48,47]) ).
tff(50,plain,
! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) ),
inference(modus_ponens,[status(thm)],[49,45]) ).
tff(51,plain,
! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) ),
inference(skolemize,[status(sab)],[50]) ).
tff(52,plain,
! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) ),
inference(modus_ponens,[status(thm)],[51,44]) ).
tff(53,plain,
( ( ~ ! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) )
| there_exists(d)
| ~ there_exists(domain(d)) )
<=> ( ~ ! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) )
| there_exists(d)
| ~ there_exists(domain(d)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(54,plain,
( ~ ! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) )
| there_exists(d)
| ~ there_exists(domain(d)) ),
inference(quant_inst,[status(thm)],]) ).
tff(55,plain,
( ~ ! [X: $i] :
( there_exists(X)
| ~ there_exists(domain(X)) )
| there_exists(d)
| ~ there_exists(domain(d)) ),
inference(modus_ponens,[status(thm)],[54,53]) ).
tff(56,plain,
there_exists(d),
inference(unit_resolution,[status(thm)],[55,52,42]) ).
tff(57,plain,
there_exists(compose(d,codomain(a))),
inference(modus_ponens,[status(thm)],[56,28]) ).
tff(58,plain,
( ( d = codomain(a) )
<=> ( codomain(a) = d ) ),
inference(commutativity,[status(thm)],]) ).
tff(59,plain,
( ( compose(d,codomain(a)) = codomain(a) )
<=> ( d = codomain(a) ) ),
inference(monotonicity,[status(thm)],[26]) ).
tff(60,plain,
( ( compose(d,codomain(a)) = codomain(a) )
<=> ( codomain(a) = d ) ),
inference(transitivity,[status(thm)],[59,58]) ).
tff(61,plain,
( ( codomain(a) = d )
<=> ( compose(d,codomain(a)) = codomain(a) ) ),
inference(symmetry,[status(thm)],[60]) ).
tff(62,plain,
( ( codomain(a) != d )
<=> ( compose(d,codomain(a)) != codomain(a) ) ),
inference(monotonicity,[status(thm)],[61]) ).
tff(63,plain,
( ( codomain(a) != d )
<=> ( codomain(a) != d ) ),
inference(rewrite,[status(thm)],]) ).
tff(64,axiom,
codomain(a) != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_a_is_d) ).
tff(65,plain,
codomain(a) != d,
inference(modus_ponens,[status(thm)],[64,63]) ).
tff(66,plain,
compose(d,codomain(a)) != codomain(a),
inference(modus_ponens,[status(thm)],[65,62]) ).
tff(67,plain,
^ [X: $i] :
refl(
( ( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) )
<=> ( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) ) )),
inference(bind,[status(th)],]) ).
tff(68,plain,
( ! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) )
<=> ! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) ) ),
inference(quant_intro,[status(thm)],[67]) ).
tff(69,plain,
( ! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) )
<=> ! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(70,axiom,
! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dx_equals_x) ).
tff(71,plain,
! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) ),
inference(modus_ponens,[status(thm)],[70,69]) ).
tff(72,plain,
! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) ),
inference(skolemize,[status(sab)],[71]) ).
tff(73,plain,
! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) ),
inference(modus_ponens,[status(thm)],[72,68]) ).
tff(74,plain,
( ( ~ ! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) )
| ~ there_exists(compose(d,codomain(a)))
| ( compose(d,codomain(a)) = codomain(a) ) )
<=> ( ~ ! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) )
| ~ there_exists(compose(d,codomain(a)))
| ( compose(d,codomain(a)) = codomain(a) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(75,plain,
( ~ ! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) )
| ~ there_exists(compose(d,codomain(a)))
| ( compose(d,codomain(a)) = codomain(a) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(76,plain,
( ~ ! [X: $i] :
( ~ there_exists(compose(d,X))
| ( compose(d,X) = X ) )
| ~ there_exists(compose(d,codomain(a)))
| ( compose(d,codomain(a)) = codomain(a) ) ),
inference(modus_ponens,[status(thm)],[75,74]) ).
tff(77,plain,
( ~ there_exists(compose(d,codomain(a)))
| ( compose(d,codomain(a)) = codomain(a) ) ),
inference(unit_resolution,[status(thm)],[76,73]) ).
tff(78,plain,
$false,
inference(unit_resolution,[status(thm)],[77,66,57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT006-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n013.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 : Tue Aug 30 06:02:32 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.13/0.40 % SZS status Unsatisfiable
% 0.13/0.40 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------