%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SYN246-1 : TPTP v9.0.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n002.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:38:35 AM UTC 2025
% Result : Unsatisfiable 0.21s 0.42s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 26 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 133 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 187 ( 88 ~; 84 |; 0 &)
% ( 15 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 8 ( 8 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 42 ( 38 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
tff(m1_type,type,
m1: ( $i * $i * $i ) > $o ).
tff(c_type,type,
c: $i ).
tff(b_type,type,
b: $i ).
tff(k0_type,type,
k0: $i > $o ).
tff(l0_type,type,
l0: $i > $o ).
tff(1,plain,
( ~ m1(c,b,c)
<=> ~ m1(c,b,c) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
~ m1(c,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(3,plain,
~ m1(c,b,c),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [I: $i,J: $i] :
refl(( ( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
<=> ( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ) )),
inference(bind,[status(th)],[]) ).
tff(5,plain,
( ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
<=> ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
<=> ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(7,plain,
^ [I: $i,J: $i] :
trans(monotonicity(rewrite(( ( m1(I,J,I)
| ~ l0(I) )
<=> ( m1(I,J,I)
| ~ l0(I) ) )),
( ( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
<=> ( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ) )),
rewrite(( ( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
<=> ( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ) )),
( ( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
<=> ( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ) )),
inference(bind,[status(th)],[]) ).
tff(8,plain,
( ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
<=> ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ) ),
inference(quant_intro,[status(thm)],[7]) ).
tff(9,axiom,
! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).
tff(10,plain,
! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ),
inference(modus_ponens,[status(thm)],[10,6]) ).
tff(12,plain,
! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ),
inference(skolemize,[status(sab)],[11]) ).
tff(13,plain,
! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ),
inference(modus_ponens,[status(thm)],[12,5]) ).
tff(14,plain,
( k0(b)
<=> k0(b) ),
inference(rewrite,[status(thm)],[]) ).
tff(15,axiom,
k0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
tff(16,plain,
k0(b),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
( l0(c)
<=> l0(c) ),
inference(rewrite,[status(thm)],[]) ).
tff(18,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
tff(19,plain,
l0(c),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
( ( ~ ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
| ~ l0(c)
| ~ k0(b)
| m1(c,b,c) )
<=> ( ~ ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
| ~ l0(c)
| ~ k0(b)
| m1(c,b,c) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(21,plain,
( ( m1(c,b,c)
| ~ l0(c)
| ~ k0(b) )
<=> ( ~ l0(c)
| ~ k0(b)
| m1(c,b,c) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(22,plain,
( ( ~ ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
| m1(c,b,c)
| ~ l0(c)
| ~ k0(b) )
<=> ( ~ ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
| ~ l0(c)
| ~ k0(b)
| m1(c,b,c) ) ),
inference(monotonicity,[status(thm)],[21]) ).
tff(23,plain,
( ( ~ ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
| m1(c,b,c)
| ~ l0(c)
| ~ k0(b) )
<=> ( ~ ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
| ~ l0(c)
| ~ k0(b)
| m1(c,b,c) ) ),
inference(transitivity,[status(thm)],[22,20]) ).
tff(24,plain,
( ~ ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
| m1(c,b,c)
| ~ l0(c)
| ~ k0(b) ),
inference(quant_inst,[status(thm)],[]) ).
tff(25,plain,
( ~ ! [I: $i,J: $i] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) )
| ~ l0(c)
| ~ k0(b)
| m1(c,b,c) ),
inference(modus_ponens,[status(thm)],[24,23]) ).
tff(26,plain,
$false,
inference(unit_resolution,[status(thm)],[25,19,16,13,3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN246-1 : TPTP v9.0.0. Released v1.1.0.
% 0.12/0.12 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n002.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 : Fri Jun 20 12:31:17 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.21/0.42 % SZS status Unsatisfiable
% 0.21/0.42 % SZS output start Proof
% See solution above
% 0.21/0.43 % E exiting
%------------------------------------------------------------------------------