%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SEV432^1 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n017.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 : Wed Feb 25 09:41:14 AM UTC 2026
% Result : Theorem 1.62s 1.32s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 16 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 57 ( 10 ~; 1 |; 0 &; 44 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 25 ( 4 ^; 14 !; 7 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
b: $tType ).
thf(func_def_2,type,
f: a > b ).
thf(func_def_6,type,
sK0: ( b > a ) > b ).
thf(func_def_7,type,
sK1: b > a ).
thf(func_def_9,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f16,plain,
$false,
inference(equality_resolution,[status(thm)],[f14]) ).
thf(f14,plain,
! [X0: b > b] :
( ( sK0
@ ^ [Y0: b] : ( sK1 @ ( X0 @ Y0 ) ) )
!= ( X0
@ ( sK0
@ ^ [Y0: b] : ( sK1 @ ( X0 @ Y0 ) ) ) ) ),
inference(equality_resolution,[status(thm)],[f13]) ).
thf(f13,plain,
! [X0: b > b,X1: b] :
( ( ( sK0
@ ^ [Y0: b] : ( sK1 @ ( X0 @ Y0 ) ) )
!= X1 )
| ( ( X0
@ ( sK0
@ ^ [Y0: b] : ( sK1 @ ( X0 @ Y0 ) ) ) )
!= X1 ) ),
inference(constrained_superposition,[status(thm)],[f11,f12]) ).
thf(f12,plain,
! [X0: b] :
( ( f @ ( sK1 @ X0 ) )
= X0 ),
inference(cnf_transformation,[status(thm)],[f10]) ).
thf(f10,plain,
! [X0: b] :
( ( f @ ( sK1 @ X0 ) )
= X0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f1,f9]) ).
thf(f9,plain,
! [X0: b] :
( ? [X1: a] :
( ( f @ X1 )
= X0 )
=> ( ( f @ ( sK1 @ X0 ) )
= X0 ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f1,axiom,
! [X0: b] :
? [X1: a] :
( ( f @ X1 )
= X0 ),
file('/export/starexec/sandbox2/tmp/tmp.JClVO5wJXo/DTF2THF_8969.p',fsurj) ).
thf(f11,plain,
! [X0: b > a] :
( ( f @ ( X0 @ ( sK0 @ X0 ) ) )
!= ( sK0 @ X0 ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
! [X0: b > a] :
( ( f @ ( X0 @ ( sK0 @ X0 ) ) )
!= ( sK0 @ X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
thf(f7,plain,
! [X0: b > a] :
( ? [X1: b] :
( ( f @ ( X0 @ X1 ) )
!= X1 )
=> ( ( f @ ( X0 @ ( sK0 @ X0 ) ) )
!= ( sK0 @ X0 ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
! [X0: b > a] :
? [X1: b] :
( ( f @ ( X0 @ X1 ) )
!= X1 ),
inference(ennf_transformation,[status(thm)],[f5]) ).
thf(f5,plain,
~ ? [X0: b > a] :
! [X1: b] :
( ( f @ ( X0 @ X1 ) )
= X1 ),
inference(rectify,[status(thm)],[f3]) ).
thf(f3,negated_conjecture,
~ ? [X2: b > a] :
! [X1: b] :
( ( f @ ( X2 @ X1 ) )
= X1 ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f2,conjecture,
? [X2: b > a] :
! [X1: b] :
( ( f @ ( X2 @ X1 ) )
= X1 ),
file('/export/starexec/sandbox2/tmp/tmp.JClVO5wJXo/DTF2THF_8969.p',invexists) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV432^1 : TPTP v9.2.1. Released v5.2.0.
% 0.12/0.12 % Command : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.34 % Computer : n017.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Feb 24 12:45:11 EST 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.45 ---- Original DTF file ---
% 0.19/0.45 thf(spec,logic,$$dhol).
% 0.19/0.45 %------------------------------------------------------------------------------
% 0.19/0.45 % File : SEV432^1 : TPTP v9.2.1. Released v5.2.0.
% 0.19/0.45 % Domain : Set Theory
% 0.19/0.45 % Problem : Surjective functions f:A->B have right inverses
% 0.19/0.45 % Version : Especial.
% 0.19/0.45 % English :
% 0.19/0.45
% 0.19/0.45 % Refs : [Bro11] Brown (2011), Email to Geoff Sutcliffe
% 0.19/0.45 % Source : [Bro11]
% 0.19/0.45 % Names : INVEXISTS5 [Bro11]
% 0.19/0.45
% 0.19/0.45 % Status : Theorem
% 0.19/0.45 % Rating : 0.33 v9.1.0, 0.25 v9.0.0, 0.30 v8.2.0, 0.31 v8.1.0, 0.27 v7.5.0, 0.14 v7.4.0, 0.11 v7.2.0, 0.12 v7.1.0, 0.00 v6.2.0, 0.43 v6.1.0, 0.14 v6.0.0, 0.29 v5.5.0, 0.33 v5.4.0, 0.40 v5.2.0
% 0.19/0.45 % Syntax : Number of formulae : 5 ( 2 unt; 3 typ; 0 def)
% 0.19/0.45 % Number of atoms : 2 ( 2 equ; 0 cnn)
% 0.19/0.45 % Maximal formula atoms : 1 ( 1 avg)
% 0.19/0.45 % Number of connectives : 3 ( 0 ~; 0 |; 0 &; 3 @)
% 0.19/0.45 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.19/0.45 % Maximal formula depth : 3 ( 3 avg)
% 0.19/0.45 % Number of types : 2 ( 2 usr)
% 0.19/0.45 % Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% 0.19/0.45 % Number of symbols : 2 ( 1 usr; 0 con; 1-2 aty)
% 0.19/0.45 % Number of variables : 4 ( 0 ^; 2 !; 2 ?; 4 :)
% 0.19/0.45 % SPC : TH0_THM_EQU_NAR
% 0.19/0.45
% 0.19/0.45 % Comments :
% 0.19/0.45 %------------------------------------------------------------------------------
% 0.19/0.45 thf(a,type,
% 0.19/0.45 a: $tType ).
% 0.19/0.45
% 0.19/0.45 thf(b,type,
% 0.19/0.45 b: $tType ).
% 0.19/0.45
% 0.19/0.45 thf(f,type,
% 0.19/0.45 f: a > b ).
% 0.19/0.45
% 0.19/0.45 thf(fsurj,axiom,
% 0.19/0.45 ! [Y: b] :
% 0.19/0.45 ? [X: a] :
% 0.19/0.45 ( ( f @ X )
% 0.19/0.45 = Y ) ).
% 0.19/0.45
% 0.19/0.45 thf(invexists,conjecture,
% 0.19/0.45 ? [G: b > a] :
% 0.19/0.45 ! [X: b] :
% 0.19/0.45 ( ( f @ ( G @ X ) )
% 0.19/0.45 = X ) ).
% 0.19/0.45
% 0.19/0.45 %------------------------------------------------------------------------------
% 0.19/0.45 ------------------------
% 1.45/1.28 ---- Embedded in THF ---
% 1.45/1.28 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.45/1.28 %%% Generated on Tue Feb 24 12:45:12 EST 2026
% 1.45/1.28 %%% using '$$dhol' embedding, version 1.3.0.
% 1.45/1.28 %%% Logic specification used:
% 1.45/1.28 %%% thf(spec, logic, $$dhol).
% 1.45/1.28
% 1.45/1.28 % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.JClVO5wJXo/DTF2DTF8969.p
% See solution above
% 1.45/1.28 ------------------------
% 1.45/1.29 ---- Cleaned THF ---
% 1.45/1.29 thf(a,type,
% 1.45/1.29 a: $tType ).
% 1.45/1.29
% 1.45/1.29 thf(b,type,
% 1.45/1.29 b: $tType ).
% 1.45/1.29
% 1.45/1.29 thf(f,type,
% 1.45/1.29 f: a > b ).
% 1.45/1.29
% 1.45/1.29 thf(fsurj,axiom,
% 1.45/1.29 ! [Y: b] :
% 1.45/1.29 ? [X: a] :
% 1.45/1.29 ( ( f @ X )
% 1.45/1.29 = Y ) ).
% 1.45/1.29
% 1.45/1.29 thf(invexists,conjecture,
% 1.45/1.29 ? [G: b > a] :
% 1.45/1.29 ! [X: b] :
% 1.45/1.29 ( ( f @ ( G @ X ) )
% 1.45/1.29 = X ) ).
% 1.45/1.29 ------------------------
% 1.62/1.31 % (9178)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_8969 for (2999ds/183Mi)
% 1.62/1.31 % (9178)First to succeed.
% 1.62/1.32 % (9178)Refutation found. Thanks to Tanya!
% 1.62/1.32 % SZS status Theorem for DTF2THF_8969
% 1.62/1.32 % SZS output start Proof for DTF2THF_8969
% 1.62/1.32 thf(type_def_5, type, a: $tType).
% 1.62/1.32 thf(type_def_6, type, b: $tType).
% 1.62/1.32 thf(func_def_0, type, a: $tType).
% 1.62/1.32 thf(func_def_1, type, b: $tType).
% 1.62/1.32 thf(func_def_2, type, f: a > b).
% 1.62/1.32 thf(func_def_6, type, sK0: (b > a) > b).
% 1.62/1.32 thf(func_def_7, type, sK1: b > a).
% 1.62/1.32 thf(func_def_9, type, ph3: !>[X0: $tType]:(X0)).
% 1.62/1.32 thf(f16,plain,(
% 1.62/1.32 $false),
% 1.62/1.32 inference(equality_resolution,[status(thm)],[f14])).
% 1.62/1.32 thf(f14,plain,(
% 1.62/1.32 ( ! [X0 : b > b] : (((sK0 @ (^[Y0 : b]: (sK1 @ (X0 @ Y0)))) != (X0 @ (sK0 @ (^[Y0 : b]: (sK1 @ (X0 @ Y0))))))) )),
% 1.62/1.32 inference(equality_resolution,[status(thm)],[f13])).
% 1.62/1.32 thf(f13,plain,(
% 1.62/1.32 ( ! [X0 : b > b,X1 : b] : (((sK0 @ (^[Y0 : b]: (sK1 @ (X0 @ Y0)))) != X1) | ((X0 @ (sK0 @ (^[Y0 : b]: (sK1 @ (X0 @ Y0))))) != X1)) )),
% 1.62/1.32 inference(constrained_superposition,[status(thm)],[f11,f12])).
% 1.62/1.32 thf(f12,plain,(
% 1.62/1.32 ( ! [X0 : b] : (((f @ (sK1 @ X0)) = X0)) )),
% 1.62/1.32 inference(cnf_transformation,[status(thm)],[f10])).
% 1.62/1.32 thf(f10,plain,(
% 1.62/1.32 ! [X0 : b] : ((f @ (sK1 @ X0)) = X0)),
% 1.62/1.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f1,f9])).
% 1.62/1.32 thf(f9,plain,(
% 1.62/1.32 ! [X0 : b] : (? [X1 : a] : ((f @ X1) = X0) => ((f @ (sK1 @ X0)) = X0))),
% 1.62/1.32 introduced(definition,[],[choice_axiom])).
% 1.62/1.32 thf(f1,axiom,(
% 1.62/1.32 ! [X0 : b] : ? [X1 : a] : ((f @ X1) = X0)),
% 1.62/1.32 file('/export/starexec/sandbox2/tmp/tmp.JClVO5wJXo/DTF2THF_8969.p',fsurj)).
% 1.62/1.32 thf(f11,plain,(
% 1.62/1.32 ( ! [X0 : b > a] : (((f @ (X0 @ (sK0 @ X0))) != (sK0 @ X0))) )),
% 1.62/1.32 inference(cnf_transformation,[status(thm)],[f8])).
% 1.62/1.32 thf(f8,plain,(
% 1.62/1.32 ! [X0 : b > a] : ((f @ (X0 @ (sK0 @ X0))) != (sK0 @ X0))),
% 1.62/1.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
% 1.62/1.32 thf(f7,plain,(
% 1.62/1.32 ! [X0 : b > a] : (? [X1 : b] : ((f @ (X0 @ X1)) != X1) => ((f @ (X0 @ (sK0 @ X0))) != (sK0 @ X0)))),
% 1.62/1.32 introduced(definition,[],[choice_axiom])).
% 1.62/1.32 thf(f6,plain,(
% 1.62/1.32 ! [X0 : b > a] : ? [X1 : b] : ((f @ (X0 @ X1)) != X1)),
% 1.62/1.32 inference(ennf_transformation,[status(thm)],[f5])).
% 1.62/1.32 thf(f5,plain,(
% 1.62/1.32 ~? [X0 : b > a] : ! [X1 : b] : ((f @ (X0 @ X1)) = X1)),
% 1.62/1.32 inference(rectify,[status(thm)],[f3])).
% 1.62/1.32 thf(f3,negated_conjecture,(
% 1.62/1.32 ~? [X2 : b > a] : ! [X1 : b] : ((f @ (X2 @ X1)) = X1)),
% 1.62/1.32 inference(negated_conjecture,[status(cth)],[f2])).
% 1.62/1.32 thf(f2,conjecture,(
% 1.62/1.32 ? [X2 : b > a] : ! [X1 : b] : ((f @ (X2 @ X1)) = X1)),
% 1.62/1.32 file('/export/starexec/sandbox2/tmp/tmp.JClVO5wJXo/DTF2THF_8969.p',invexists)).
% 1.62/1.32 % SZS output end Proof for DTF2THF_8969
% 1.62/1.32 % (9178)------------------------------
% 1.62/1.32 % (9178)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.62/1.32 % (9178)Termination reason: Refutation
% 1.62/1.32
% 1.62/1.32 % (9178)Memory used [KB]: 5500
% 1.62/1.32 % (9178)Time elapsed: 0.004 s
% 1.62/1.32 % (9178)Instructions burned: 3 (million)
% 1.62/1.32 % (9178)------------------------------
% 1.62/1.32 % (9178)------------------------------
% 1.62/1.32 % (9177)Success in time 0.017 s
%------------------------------------------------------------------------------