%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SYN261-1 : TPTP v9.0.0. Released v1.1.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:38:37 AM UTC 2025
% Result : Unsatisfiable 0.19s 0.46s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 26 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 78 ( 40 ~; 28 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 44 ( 39 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
tff(p1_type,type,
p1: ( $i * $i * $i ) > $o ).
tff(b_type,type,
b: $i ).
tff(p0_type,type,
p0: ( $i * $i ) > $o ).
tff(c_type,type,
c: $i ).
tff(1,plain,
^ [B: $i,C: $i] :
refl(( ( ~ p0(C,B)
| p1(B,B,B) )
<=> ( ~ p0(C,B)
| p1(B,B,B) ) )),
inference(bind,[status(th)],[]) ).
tff(2,plain,
( ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
<=> ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
<=> ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(4,plain,
^ [B: $i,C: $i] :
rewrite(( ( p1(B,B,B)
| ~ p0(C,B) )
<=> ( ~ p0(C,B)
| p1(B,B,B) ) )),
inference(bind,[status(th)],[]) ).
tff(5,plain,
( ! [B: $i,C: $i] :
( p1(B,B,B)
| ~ p0(C,B) )
<=> ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,axiom,
! [B: $i,C: $i] :
( p1(B,B,B)
| ~ p0(C,B) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
tff(7,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(modus_ponens,[status(thm)],[7,3]) ).
tff(9,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(skolemize,[status(sab)],[8]) ).
tff(10,plain,
! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) ),
inference(modus_ponens,[status(thm)],[9,2]) ).
tff(11,plain,
( p0(c,b)
<=> p0(c,b) ),
inference(rewrite,[status(thm)],[]) ).
tff(12,axiom,
p0(c,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
tff(13,plain,
p0(c,b),
inference(modus_ponens,[status(thm)],[12,11]) ).
tff(14,plain,
( ( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(c,b)
| p1(b,b,b) )
<=> ( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(c,b)
| p1(b,b,b) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(15,plain,
( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(c,b)
| p1(b,b,b) ),
inference(quant_inst,[status(thm)],[]) ).
tff(16,plain,
( ~ ! [B: $i,C: $i] :
( ~ p0(C,B)
| p1(B,B,B) )
| ~ p0(c,b)
| p1(b,b,b) ),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
p1(b,b,b),
inference(unit_resolution,[status(thm)],[16,13,10]) ).
tff(18,plain,
^ [X: $i] :
refl(( ~ p1(b,X,b)
<=> ~ p1(b,X,b) )),
inference(bind,[status(th)],[]) ).
tff(19,plain,
( ! [X: $i] : ~ p1(b,X,b)
<=> ! [X: $i] : ~ p1(b,X,b) ),
inference(quant_intro,[status(thm)],[18]) ).
tff(20,plain,
( ! [X: $i] : ~ p1(b,X,b)
<=> ! [X: $i] : ~ p1(b,X,b) ),
inference(rewrite,[status(thm)],[]) ).
tff(21,axiom,
! [X: $i] : ~ p1(b,X,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(22,plain,
! [X: $i] : ~ p1(b,X,b),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
! [X: $i] : ~ p1(b,X,b),
inference(skolemize,[status(sab)],[22]) ).
tff(24,plain,
! [X: $i] : ~ p1(b,X,b),
inference(modus_ponens,[status(thm)],[23,19]) ).
tff(25,plain,
( ~ ! [X: $i] : ~ p1(b,X,b)
| ~ p1(b,b,b) ),
inference(quant_inst,[status(thm)],[]) ).
tff(26,plain,
$false,
inference(unit_resolution,[status(thm)],[25,24,17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SYN261-1 : TPTP v9.0.0. Released v1.1.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 20 12:30:09 EDT 2025
% 0.11/0.33 % CPUTime :
% 0.19/0.46 % SZS status Unsatisfiable
% 0.19/0.46 % SZS output start Proof
% See solution above
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------