%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : CSR051+2 : TPTP v9.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% 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 : Sat Jun 21 05:01:33 AM UTC 2025
% Result : Theorem 82.98s 83.18s
% Output : Proof 83.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 26 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 95 ( 53 ~; 32 |; 0 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 4 ( 4 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 17 ( 6 !; 9 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
tff(mtvisible_type,type,
mtvisible: $i > $o ).
tff(c_tptp_member3356_mt_type,type,
c_tptp_member3356_mt: $i ).
tff(marriagelicensedocument_type,type,
marriagelicensedocument: $i > $o ).
tff(c_tptpmarriagelicensedocument_type,type,
c_tptpmarriagelicensedocument: $i ).
tff(c_cycnounlearnermt_type,type,
c_cycnounlearnermt: $i ).
tff(1,plain,
^ [X: $i] :
refl(( ~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) )
<=> ~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ) )),
inference(bind,[status(th)],[]) ).
tff(2,plain,
( ! [X: $i] :
~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) )
<=> ! [X: $i] :
~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ~ ? [X: $i] :
( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) )
<=> ~ ? [X: $i] :
( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(4,plain,
( ~ ? [X: $i] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) )
<=> ~ ? [X: $i] :
( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(5,axiom,
~ ? [X: $i] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query101) ).
tff(6,plain,
~ ? [X: $i] :
( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(modus_ponens,[status(thm)],[5,4]) ).
tff(7,plain,
~ ? [X: $i] :
( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(modus_ponens,[status(thm)],[6,3]) ).
tff(8,plain,
~ ? [X: $i] :
( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(modus_ponens,[status(thm)],[7,3]) ).
tff(9,plain,
~ ? [X: $i] :
( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(modus_ponens,[status(thm)],[8,3]) ).
tff(10,plain,
^ [X: $i] :
refl($oeq(~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ),
~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ))),
inference(bind,[status(th)],[]) ).
tff(11,plain,
! [X: $i] :
~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(nnf-neg,[status(sab)],[9,10]) ).
tff(12,plain,
! [X: $i] :
~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(modus_ponens,[status(thm)],[11,2]) ).
tff(13,plain,
( ~ ! [X: $i] :
~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) )
| ~ ( marriagelicensedocument(c_cycnounlearnermt)
| ~ mtvisible(c_tptp_member3356_mt) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(14,plain,
~ ( marriagelicensedocument(c_cycnounlearnermt)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(unit_resolution,[status(thm)],[13,12]) ).
tff(15,plain,
( marriagelicensedocument(c_cycnounlearnermt)
| ~ mtvisible(c_tptp_member3356_mt)
| mtvisible(c_tptp_member3356_mt) ),
inference(tautology,[status(thm)],[]) ).
tff(16,plain,
mtvisible(c_tptp_member3356_mt),
inference(unit_resolution,[status(thm)],[15,14]) ).
tff(17,plain,
( ( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) )
<=> ( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(18,plain,
( ( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) )
<=> ( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(19,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_51) ).
tff(20,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(modus_ponens,[status(thm)],[19,18]) ).
tff(21,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(modus_ponens,[status(thm)],[20,17]) ).
tff(22,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(unit_resolution,[status(thm)],[21,16]) ).
tff(23,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt)
| ~ marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(tautology,[status(thm)],[]) ).
tff(24,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(unit_resolution,[status(thm)],[23,22]) ).
tff(25,plain,
( ~ ! [X: $i] :
~ ( marriagelicensedocument(X)
| ~ mtvisible(c_tptp_member3356_mt) )
| ~ ( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(26,plain,
$false,
inference(unit_resolution,[status(thm)],[25,12,24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR051+2 : TPTP v9.0.0. Released v3.4.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n003.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 : Thu Jun 19 12:40:54 EDT 2025
% 0.12/0.35 % CPUTime :
% 82.98/83.18 % SZS status Theorem
% 82.98/83.18 % SZS output start Proof
% See solution above
% 83.03/83.24 % E exiting
%------------------------------------------------------------------------------