%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : CSR051-10 : TPTP v9.0.0. Released v7.3.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% 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 : Sat Jun 21 05:01:32 AM UTC 2025
% Result : Unsatisfiable 33.98s 34.19s
% Output : Proof 34.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 45 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 63 ( 59 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 7 ~; 3 |; 0 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 70 ( 63 !; 0 ?; 70 :)
% Comments :
%------------------------------------------------------------------------------
tff(b_type,type,
b: $i ).
tff(a_type,type,
a: $i ).
tff(ifeq3_type,type,
ifeq3: ( $i * $i * $i * $i ) > $i ).
tff(true_type,type,
true: $i ).
tff(marriagelicensedocument_type,type,
marriagelicensedocument: $i > $i ).
tff(c_tptpmarriagelicensedocument_type,type,
c_tptpmarriagelicensedocument: $i ).
tff(ifeq4_type,type,
ifeq4: ( $i * $i * $i * $i ) > $i ).
tff(mtvisible_type,type,
mtvisible: $i > $i ).
tff(c_tptp_member3356_mt_type,type,
c_tptp_member3356_mt: $i ).
tff(1,plain,
^ [X: $i] :
refl(( ( ifeq3(marriagelicensedocument(X),true,a,b) = b )
<=> ( ifeq3(marriagelicensedocument(X),true,a,b) = b ) )),
inference(bind,[status(th)],[]) ).
tff(2,plain,
( ! [X: $i] : ( ifeq3(marriagelicensedocument(X),true,a,b) = b )
<=> ! [X: $i] : ( ifeq3(marriagelicensedocument(X),true,a,b) = b ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [X: $i] : ( ifeq3(marriagelicensedocument(X),true,a,b) = b )
<=> ! [X: $i] : ( ifeq3(marriagelicensedocument(X),true,a,b) = b ) ),
inference(rewrite,[status(thm)],[]) ).
tff(4,axiom,
! [X: $i] : ( ifeq3(marriagelicensedocument(X),true,a,b) = b ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query151_1) ).
tff(5,plain,
! [X: $i] : ( ifeq3(marriagelicensedocument(X),true,a,b) = b ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [X: $i] : ( ifeq3(marriagelicensedocument(X),true,a,b) = b ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [X: $i] : ( ifeq3(marriagelicensedocument(X),true,a,b) = b ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [X: $i] : ( ifeq3(marriagelicensedocument(X),true,a,b) = b )
| ( ifeq3(marriagelicensedocument(c_tptpmarriagelicensedocument),true,a,b) = b ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(9,plain,
ifeq3(marriagelicensedocument(c_tptpmarriagelicensedocument),true,a,b) = b,
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
^ [B: $i,A: $i,C: $i] :
refl(( ( ifeq4(A,A,B,C) = B )
<=> ( ifeq4(A,A,B,C) = B ) )),
inference(bind,[status(th)],[]) ).
tff(11,plain,
( ! [B: $i,A: $i,C: $i] : ( ifeq4(A,A,B,C) = B )
<=> ! [B: $i,A: $i,C: $i] : ( ifeq4(A,A,B,C) = B ) ),
inference(quant_intro,[status(thm)],[10]) ).
tff(12,plain,
( ! [B: $i,A: $i,C: $i] : ( ifeq4(A,A,B,C) = B )
<=> ! [B: $i,A: $i,C: $i] : ( ifeq4(A,A,B,C) = B ) ),
inference(rewrite,[status(thm)],[]) ).
tff(13,axiom,
! [B: $i,A: $i,C: $i] : ( ifeq4(A,A,B,C) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
tff(14,plain,
! [B: $i,A: $i,C: $i] : ( ifeq4(A,A,B,C) = B ),
inference(modus_ponens,[status(thm)],[13,12]) ).
tff(15,plain,
! [B: $i,A: $i,C: $i] : ( ifeq4(A,A,B,C) = B ),
inference(skolemize,[status(sab)],[14]) ).
tff(16,plain,
! [B: $i,A: $i,C: $i] : ( ifeq4(A,A,B,C) = B ),
inference(modus_ponens,[status(thm)],[15,11]) ).
tff(17,plain,
( ~ ! [B: $i,A: $i,C: $i] : ( ifeq4(A,A,B,C) = B )
| ( ifeq4(true,true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = marriagelicensedocument(c_tptpmarriagelicensedocument) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(18,plain,
ifeq4(true,true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(unit_resolution,[status(thm)],[17,16]) ).
tff(19,plain,
( ( mtvisible(c_tptp_member3356_mt) = true )
<=> ( mtvisible(c_tptp_member3356_mt) = true ) ),
inference(rewrite,[status(thm)],[]) ).
tff(20,axiom,
mtvisible(c_tptp_member3356_mt) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query151) ).
tff(21,plain,
mtvisible(c_tptp_member3356_mt) = true,
inference(modus_ponens,[status(thm)],[20,19]) ).
tff(22,plain,
true = mtvisible(c_tptp_member3356_mt),
inference(symmetry,[status(thm)],[21]) ).
tff(23,plain,
ifeq4(true,true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true),
inference(monotonicity,[status(thm)],[22]) ).
tff(24,plain,
ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = ifeq4(true,true,marriagelicensedocument(c_tptpmarriagelicensedocument),true),
inference(symmetry,[status(thm)],[23]) ).
tff(25,plain,
( ( ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true )
<=> ( ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true ) ),
inference(rewrite,[status(thm)],[]) ).
tff(26,axiom,
ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2_395) ).
tff(27,plain,
ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
inference(modus_ponens,[status(thm)],[26,25]) ).
tff(28,plain,
true = ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true),
inference(symmetry,[status(thm)],[27]) ).
tff(29,plain,
true = marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(transitivity,[status(thm)],[28,24,18]) ).
tff(30,plain,
ifeq3(true,true,a,b) = ifeq3(marriagelicensedocument(c_tptpmarriagelicensedocument),true,a,b),
inference(monotonicity,[status(thm)],[29]) ).
tff(31,plain,
^ [B: $i,A: $i,C: $i] :
refl(( ( ifeq3(A,A,B,C) = B )
<=> ( ifeq3(A,A,B,C) = B ) )),
inference(bind,[status(th)],[]) ).
tff(32,plain,
( ! [B: $i,A: $i,C: $i] : ( ifeq3(A,A,B,C) = B )
<=> ! [B: $i,A: $i,C: $i] : ( ifeq3(A,A,B,C) = B ) ),
inference(quant_intro,[status(thm)],[31]) ).
tff(33,plain,
( ! [B: $i,A: $i,C: $i] : ( ifeq3(A,A,B,C) = B )
<=> ! [B: $i,A: $i,C: $i] : ( ifeq3(A,A,B,C) = B ) ),
inference(rewrite,[status(thm)],[]) ).
tff(34,axiom,
! [B: $i,A: $i,C: $i] : ( ifeq3(A,A,B,C) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
tff(35,plain,
! [B: $i,A: $i,C: $i] : ( ifeq3(A,A,B,C) = B ),
inference(modus_ponens,[status(thm)],[34,33]) ).
tff(36,plain,
! [B: $i,A: $i,C: $i] : ( ifeq3(A,A,B,C) = B ),
inference(skolemize,[status(sab)],[35]) ).
tff(37,plain,
! [B: $i,A: $i,C: $i] : ( ifeq3(A,A,B,C) = B ),
inference(modus_ponens,[status(thm)],[36,32]) ).
tff(38,plain,
( ~ ! [B: $i,A: $i,C: $i] : ( ifeq3(A,A,B,C) = B )
| ( ifeq3(true,true,a,b) = a ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(39,plain,
ifeq3(true,true,a,b) = a,
inference(unit_resolution,[status(thm)],[38,37]) ).
tff(40,plain,
a = ifeq3(true,true,a,b),
inference(symmetry,[status(thm)],[39]) ).
tff(41,plain,
a = b,
inference(transitivity,[status(thm)],[40,30,9]) ).
tff(42,plain,
( ( a != b )
<=> ( a != b ) ),
inference(rewrite,[status(thm)],[]) ).
tff(43,axiom,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
tff(44,plain,
a != b,
inference(modus_ponens,[status(thm)],[43,42]) ).
tff(45,plain,
$false,
inference(unit_resolution,[status(thm)],[44,41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR051-10 : TPTP v9.0.0. Released v7.3.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 19 12:41:09 EDT 2025
% 0.12/0.33 % CPUTime :
% 33.98/34.19 % SZS status Unsatisfiable
% 33.98/34.19 % SZS output start Proof
% See solution above
% 34.36/34.51 % E exiting
%------------------------------------------------------------------------------