%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : SYO114^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n020.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:53:24 AM UTC 2026
% Result : Theorem 1.65s 1.44s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 243 ( 59 equ; 0 cnn)
% Maximal formula atoms : 14 ( 15 avg)
% Number of connectives : 233 ( 64 ~; 55 |; 18 &; 95 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 25 ( 0 ^; 19 !; 6 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
cP: $i > $o ).
thf(func_def_4,type,
cQ: $i > $o ).
thf(func_def_6,type,
cR: $i > $o ).
thf(func_def_10,type,
sK0: $i > $i ).
thf(f18,plain,
$false,
inference(subsumption_resolution,[status(thm)],[f17,f16]) ).
thf(f16,plain,
! [X0: $i] :
( ( cP @ X0 )
= $true ),
inference(subsumption_resolution,[status(thm)],[f15,f9]) ).
thf(f9,plain,
! [X2: $i] :
( ( cQ @ X2 )
= $true ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f8,plain,
( ( ( ( cP @ b )
!= $true )
| ( ( cP @ a )
!= $true ) )
& ! [X0: $i] :
( ( ( cP @ X0 )
= $true )
| ( ( cQ @ X0 )
!= $true )
| ( ( cQ @ ( sK0 @ X0 ) )
!= $true )
| ( ( cQ @ d )
!= $true )
| ( ( cQ @ c )
!= $true ) )
& ! [X2: $i] :
( ( ( ( cP @ X2 )
= $true )
| ( ( cR @ X2 )
= $true ) )
& ( ( cQ @ X2 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
thf(f7,plain,
! [X0: $i] :
( ? [X1: $i] :
( ( ( cP @ X0 )
= $true )
| ( ( cQ @ X0 )
!= $true )
| ( ( cQ @ X1 )
!= $true )
| ( ( cQ @ d )
!= $true )
| ( ( cQ @ c )
!= $true ) )
=> ( ( ( cP @ X0 )
= $true )
| ( ( cQ @ X0 )
!= $true )
| ( ( cQ @ ( sK0 @ X0 ) )
!= $true )
| ( ( cQ @ d )
!= $true )
| ( ( cQ @ c )
!= $true ) ) ),
introduced(definition,[],[choice_axiom]) ).
thf(f6,plain,
( ( ( ( cP @ b )
!= $true )
| ( ( cP @ a )
!= $true ) )
& ! [X0: $i] :
? [X1: $i] :
( ( ( cP @ X0 )
= $true )
| ( ( cQ @ X0 )
!= $true )
| ( ( cQ @ X1 )
!= $true )
| ( ( cQ @ d )
!= $true )
| ( ( cQ @ c )
!= $true ) )
& ! [X2: $i] :
( ( ( ( cP @ X2 )
= $true )
| ( ( cR @ X2 )
= $true ) )
& ( ( cQ @ X2 )
= $true ) ) ),
inference(flattening,[status(thm)],[f5]) ).
thf(f5,plain,
~ ~ ( ( ( ( cP @ a )
!= $true )
| ( ( cP @ b )
!= $true ) )
& ! [X0: $i] :
? [X1: $i] :
( ( ( cP @ X0 )
= $true )
| ( ( cQ @ X0 )
!= $true )
| ( ( cQ @ c )
!= $true )
| ( ( cQ @ X1 )
!= $true )
| ( ( cQ @ d )
!= $true ) )
& ! [X2: $i] :
( ( ( ( cP @ X2 )
= $true )
| ( ( cR @ X2 )
= $true ) )
& ( ( cQ @ X2 )
= $true ) ) ),
inference(fool_elimination,[status(thm)],[f4]) ).
thf(f4,plain,
~ ~ ( ( ~ ( cP @ a )
| ~ ( cP @ b ) )
& ! [X0: $i] :
? [X1: $i] :
( ( cP @ X0 )
| ~ ( cQ @ X0 )
| ~ ( cQ @ c )
| ~ ( cQ @ X1 )
| ~ ( cQ @ d ) )
& ! [X2: $i] :
( ( cQ @ X2 )
& ( ( cP @ X2 )
| ( cR @ X2 ) ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,negated_conjecture,
~ ~ ( ( ~ ( cP @ a )
| ~ ( cP @ b ) )
& ! [X1: $i] :
? [X2: $i] :
( ( cP @ X1 )
| ~ ( cQ @ X1 )
| ~ ( cQ @ c )
| ~ ( cQ @ X2 )
| ~ ( cQ @ d ) )
& ! [X0: $i] :
( ( cQ @ X0 )
& ( ( cP @ X0 )
| ( cR @ X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f1,conjecture,
~ ( ( ~ ( cP @ a )
| ~ ( cP @ b ) )
& ! [X1: $i] :
? [X2: $i] :
( ( cP @ X1 )
| ~ ( cQ @ X1 )
| ~ ( cQ @ c )
| ~ ( cQ @ X2 )
| ~ ( cQ @ d ) )
& ! [X0: $i] :
( ( cQ @ X0 )
& ( ( cP @ X0 )
| ( cR @ X0 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.OsyxWB7X8G/DTF2THF_25117.p',cTHM119) ).
thf(f15,plain,
! [X0: $i] :
( ( ( cQ @ ( sK0 @ X0 ) )
!= $true )
| ( ( cP @ X0 )
= $true ) ),
inference(subsumption_resolution,[status(thm)],[f14,f9]) ).
thf(f14,plain,
! [X0: $i] :
( ( ( cQ @ c )
!= $true )
| ( ( cQ @ ( sK0 @ X0 ) )
!= $true )
| ( ( cP @ X0 )
= $true ) ),
inference(subsumption_resolution,[status(thm)],[f13,f9]) ).
thf(f13,plain,
! [X0: $i] :
( ( ( cQ @ X0 )
!= $true )
| ( ( cQ @ ( sK0 @ X0 ) )
!= $true )
| ( ( cQ @ c )
!= $true )
| ( ( cP @ X0 )
= $true ) ),
inference(subsumption_resolution,[status(thm)],[f11,f9]) ).
thf(f11,plain,
! [X0: $i] :
( ( ( cQ @ d )
!= $true )
| ( ( cP @ X0 )
= $true )
| ( ( cQ @ c )
!= $true )
| ( ( cQ @ X0 )
!= $true )
| ( ( cQ @ ( sK0 @ X0 ) )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
thf(f17,plain,
( ( cP @ a )
!= $true ),
inference(subsumption_resolution,[status(thm)],[f12,f16]) ).
thf(f12,plain,
( ( ( cP @ b )
!= $true )
| ( ( cP @ a )
!= $true ) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO114^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.33 % Computer : n020.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue Feb 24 14:24:42 EST 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.33 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.26/0.48 ---- Original DTF file ---
% 0.26/0.48 thf(spec,logic,$$dhol).
% 0.26/0.48 %------------------------------------------------------------------------------
% 0.26/0.48 % File : SYO114^5 : TPTP v9.2.1. Released v4.0.0.
% 0.26/0.48 % Domain : Syntactic
% 0.26/0.48 % Problem : TPS problem THM119
% 0.26/0.48 % Version : Especial.
% 0.26/0.48 % English :
% 0.26/0.48
% 0.26/0.48 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.26/0.48 % Source : [Bro09]
% 0.26/0.48 % Names : tps_0536 [Bro09]
% 0.26/0.48 % : THM119 [TPS]
% 0.26/0.48
% 0.26/0.48 % Status : Theorem
% 0.26/0.48 % Rating : 0.17 v9.1.0, 0.25 v9.0.0, 0.17 v8.2.0, 0.18 v8.1.0, 0.17 v7.4.0, 0.22 v7.3.0, 0.20 v7.2.0, 0.25 v7.1.0, 0.29 v7.0.0, 0.25 v6.4.0, 0.29 v6.3.0, 0.33 v6.0.0, 0.17 v5.5.0, 0.20 v5.4.0, 0.25 v5.3.0, 0.00 v4.0.0
% 0.26/0.48 % Syntax : Number of formulae : 8 ( 0 unt; 7 typ; 0 def)
% 0.26/0.48 % Number of atoms : 10 ( 0 equ; 0 cnn)
% 0.26/0.48 % Maximal formula atoms : 10 ( 10 avg)
% 0.26/0.48 % Number of connectives : 26 ( 7 ~; 6 |; 3 &; 10 @)
% 0.26/0.48 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.26/0.48 % Maximal formula depth : 12 ( 12 avg)
% 0.26/0.48 % Number of types : 2 ( 0 usr)
% 0.26/0.48 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.26/0.48 % Number of symbols : 7 ( 7 usr; 4 con; 0-1 aty)
% 0.26/0.48 % Number of variables : 3 ( 0 ^; 2 !; 1 ?; 3 :)
% 0.26/0.48 % SPC : TH0_THM_NEQ_NAR
% 0.26/0.48
% 0.26/0.48 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.26/0.48 % project in the Department of Mathematical Sciences at Carnegie
% 0.26/0.48 % Mellon University. Distributed under the Creative Commons copyleft
% 0.26/0.48 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.26/0.48 %------------------------------------------------------------------------------
% 0.26/0.48 thf(b,type,
% 0.26/0.48 b: $i ).
% 0.26/0.48
% 0.26/0.48 thf(cP,type,
% 0.26/0.48 cP: $i > $o ).
% 0.26/0.48
% 0.26/0.48 thf(a,type,
% 0.26/0.48 a: $i ).
% 0.26/0.48
% 0.26/0.48 thf(d,type,
% 0.26/0.48 d: $i ).
% 0.26/0.48
% 0.26/0.48 thf(cQ,type,
% 0.26/0.48 cQ: $i > $o ).
% 0.26/0.48
% 0.26/0.48 thf(c,type,
% 0.26/0.48 c: $i ).
% 0.26/0.48
% 0.26/0.48 thf(cR,type,
% 0.26/0.48 cR: $i > $o ).
% 0.26/0.48
% 0.26/0.48 thf(cTHM119,conjecture,
% 0.26/0.48 ~ ( ! [Xz: $i] :
% 0.26/0.48 ( ( ( cP @ Xz )
% 0.26/0.48 | ( cR @ Xz ) )
% 0.26/0.48 & ( cQ @ Xz ) )
% 0.26/0.48 & ! [Xx: $i] :
% 0.26/0.48 ? [Xy: $i] :
% 0.26/0.48 ( ( cP @ Xx )
% 0.26/0.48 | ~ ( cQ @ Xx )
% 0.26/0.48 | ~ ( cQ @ Xy )
% 0.26/0.48 | ~ ( cQ @ c )
% 0.26/0.48 | ~ ( cQ @ d ) )
% 0.26/0.48 & ( ~ ( cP @ a )
% 0.26/0.48 | ~ ( cP @ b ) ) ) ).
% 0.26/0.48
% 0.26/0.48 %------------------------------------------------------------------------------
% 0.26/0.48 ------------------------
% 1.65/1.41 ---- Embedded in THF ---
% 1.65/1.41 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.65/1.41 %%% Generated on Tue Feb 24 14:24:43 EST 2026
% 1.65/1.41 %%% using '$$dhol' embedding, version 1.3.0.
% 1.65/1.41 %%% Logic specification used:
% 1.65/1.41 %%% thf(spec, logic, $$dhol).
% 1.65/1.41
% 1.65/1.41 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.OsyxWB7X8G/DTF2DTF25117.p
% See solution above
% 1.65/1.41 ------------------------
% 1.65/1.42 ---- Cleaned THF ---
% 1.65/1.42 thf(b,type,
% 1.65/1.42 b: $i ).
% 1.65/1.42
% 1.65/1.42 thf(cP,type,
% 1.65/1.42 cP: $i > $o ).
% 1.65/1.42
% 1.65/1.42 thf(a,type,
% 1.65/1.42 a: $i ).
% 1.65/1.42
% 1.65/1.42 thf(d,type,
% 1.65/1.42 d: $i ).
% 1.65/1.42
% 1.65/1.42 thf(cQ,type,
% 1.65/1.42 cQ: $i > $o ).
% 1.65/1.42
% 1.65/1.42 thf(c,type,
% 1.65/1.42 c: $i ).
% 1.65/1.42
% 1.65/1.42 thf(cR,type,
% 1.65/1.42 cR: $i > $o ).
% 1.65/1.42
% 1.65/1.42 thf(cTHM119,conjecture,
% 1.65/1.42 ~ ( ! [Xz: $i] :
% 1.65/1.42 ( ( ( cP @ Xz )
% 1.65/1.42 | ( cR @ Xz ) )
% 1.65/1.42 & ( cQ @ Xz ) )
% 1.65/1.42 & ! [Xx: $i] :
% 1.65/1.42 ? [Xy: $i] :
% 1.65/1.42 ( ( cP @ Xx )
% 1.65/1.42 | ~ ( cQ @ Xx )
% 1.65/1.42 | ~ ( cQ @ Xy )
% 1.65/1.42 | ~ ( cQ @ c )
% 1.65/1.42 | ~ ( cQ @ d ) )
% 1.65/1.42 & ( ~ ( cP @ a )
% 1.65/1.42 | ~ ( cP @ b ) ) ) ).
% 1.65/1.42 ------------------------
% 1.65/1.44 % (25217)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on DTF2THF_25117 for (3000ds/27Mi)
% 1.65/1.44 % (25216)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on DTF2THF_25117 for (3000ds/4Mi)
% 1.65/1.44 % (25215)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_25117 for (3000ds/183Mi)
% 1.65/1.44 % (25218)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_25117 for (3000ds/2Mi)
% 1.65/1.44 % (25219)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_25117 for (3000ds/2Mi)
% 1.65/1.44 % (25220)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_25117 for (3000ds/275Mi)
% 1.65/1.44 % (25221)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_25117 for (3000ds/18Mi)
% 1.65/1.44 % (25215)First to succeed.
% 1.65/1.44 % (25218)Instruction limit reached!
% 1.65/1.44 % (25218)------------------------------
% 1.65/1.44 % (25218)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.44 % (25218)Termination reason: Unknown
% 1.65/1.44 % (25219)Instruction limit reached!
% 1.65/1.44 % (25219)------------------------------
% 1.65/1.44 % (25219)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.44 % (25218)Termination phase: Saturation
% 1.65/1.44
% 1.65/1.44 % (25218)Memory used [KB]: 5500
% 1.65/1.44 % (25218)Time elapsed: 0.003 s
% 1.65/1.44 % (25218)Instructions burned: 2 (million)
% 1.65/1.44 % (25218)------------------------------
% 1.65/1.44 % (25218)------------------------------
% 1.65/1.44 % (25219)Termination reason: Unknown
% 1.65/1.44 % (25219)Termination phase: Saturation
% 1.65/1.44
% 1.65/1.44 % (25219)Memory used [KB]: 5500
% 1.65/1.44 % (25219)Time elapsed: 0.003 s
% 1.65/1.44 % (25219)Instructions burned: 2 (million)
% 1.65/1.44 % (25219)------------------------------
% 1.65/1.44 % (25219)------------------------------
% 1.65/1.44 % (25216)Also succeeded, but the first one will report.
% 1.65/1.44 % (25215)Refutation found. Thanks to Tanya!
% 1.65/1.44 % SZS status Theorem for DTF2THF_25117
% 1.65/1.44 % SZS output start Proof for DTF2THF_25117
% 1.65/1.44 thf(func_def_1, type, cP: $i > $o).
% 1.65/1.44 thf(func_def_4, type, cQ: $i > $o).
% 1.65/1.44 thf(func_def_6, type, cR: $i > $o).
% 1.65/1.44 thf(func_def_10, type, sK0: $i > $i).
% 1.65/1.44 thf(f18,plain,(
% 1.65/1.44 $false),
% 1.65/1.44 inference(subsumption_resolution,[status(thm)],[f17,f16])).
% 1.65/1.44 thf(f16,plain,(
% 1.65/1.44 ( ! [X0 : $i] : (((cP @ X0) = $true)) )),
% 1.65/1.44 inference(subsumption_resolution,[status(thm)],[f15,f9])).
% 1.65/1.44 thf(f9,plain,(
% 1.65/1.44 ( ! [X2 : $i] : (((cQ @ X2) = $true)) )),
% 1.65/1.44 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.44 thf(f8,plain,(
% 1.65/1.44 (((cP @ b) != $true) | ((cP @ a) != $true)) & ! [X0 : $i] : (((cP @ X0) = $true) | ((cQ @ X0) != $true) | ((cQ @ (sK0 @ X0)) != $true) | ((cQ @ d) != $true) | ((cQ @ c) != $true)) & ! [X2 : $i] : ((((cP @ X2) = $true) | ((cR @ X2) = $true)) & ((cQ @ X2) = $true))),
% 1.65/1.44 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
% 1.65/1.44 thf(f7,plain,(
% 1.65/1.44 ! [X0 : $i] : (? [X1 : $i] : (((cP @ X0) = $true) | ((cQ @ X0) != $true) | ((cQ @ X1) != $true) | ((cQ @ d) != $true) | ((cQ @ c) != $true)) => (((cP @ X0) = $true) | ((cQ @ X0) != $true) | ((cQ @ (sK0 @ X0)) != $true) | ((cQ @ d) != $true) | ((cQ @ c) != $true)))),
% 1.65/1.44 introduced(definition,[],[choice_axiom])).
% 1.65/1.44 thf(f6,plain,(
% 1.65/1.44 (((cP @ b) != $true) | ((cP @ a) != $true)) & ! [X0 : $i] : ? [X1 : $i] : (((cP @ X0) = $true) | ((cQ @ X0) != $true) | ((cQ @ X1) != $true) | ((cQ @ d) != $true) | ((cQ @ c) != $true)) & ! [X2 : $i] : ((((cP @ X2) = $true) | ((cR @ X2) = $true)) & ((cQ @ X2) = $true))),
% 1.65/1.44 inference(flattening,[status(thm)],[f5])).
% 1.65/1.44 thf(f5,plain,(
% 1.65/1.44 ~~((~((cP @ a) = $true) | ~((cP @ b) = $true)) & ! [X0 : $i] : ? [X1 : $i] : (((cP @ X0) = $true) | ~((cQ @ X0) = $true) | ~((cQ @ c) = $true) | ~((cQ @ X1) = $true) | ~((cQ @ d) = $true)) & ! [X2 : $i] : ((((cP @ X2) = $true) | ((cR @ X2) = $true)) & ((cQ @ X2) = $true)))),
% 1.65/1.44 inference(fool_elimination,[status(thm)],[f4])).
% 1.65/1.44 thf(f4,plain,(
% 1.65/1.44 ~~((~(cP @ a) | ~(cP @ b)) & ! [X0 : $i] : ? [X1 : $i] : ((cP @ X0) | ~(cQ @ X0) | ~(cQ @ c) | ~(cQ @ X1) | ~(cQ @ d)) & ! [X2 : $i] : ((cQ @ X2) & ((cP @ X2) | (cR @ X2))))),
% 1.65/1.44 inference(rectify,[status(thm)],[f2])).
% 1.65/1.44 thf(f2,negated_conjecture,(
% 1.65/1.44 ~~((~(cP @ a) | ~(cP @ b)) & ! [X1 : $i] : ? [X2 : $i] : ((cP @ X1) | ~(cQ @ X1) | ~(cQ @ c) | ~(cQ @ X2) | ~(cQ @ d)) & ! [X0 : $i] : ((cQ @ X0) & ((cP @ X0) | (cR @ X0))))),
% 1.65/1.44 inference(negated_conjecture,[status(cth)],[f1])).
% 1.65/1.44 thf(f1,conjecture,(
% 1.65/1.44 ~((~(cP @ a) | ~(cP @ b)) & ! [X1 : $i] : ? [X2 : $i] : ((cP @ X1) | ~(cQ @ X1) | ~(cQ @ c) | ~(cQ @ X2) | ~(cQ @ d)) & ! [X0 : $i] : ((cQ @ X0) & ((cP @ X0) | (cR @ X0))))),
% 1.65/1.44 file('/export/starexec/sandbox/tmp/tmp.OsyxWB7X8G/DTF2THF_25117.p',cTHM119)).
% 1.65/1.44 thf(f15,plain,(
% 1.65/1.44 ( ! [X0 : $i] : (((cQ @ (sK0 @ X0)) != $true) | ((cP @ X0) = $true)) )),
% 1.65/1.44 inference(subsumption_resolution,[status(thm)],[f14,f9])).
% 1.65/1.44 thf(f14,plain,(
% 1.65/1.44 ( ! [X0 : $i] : (((cQ @ c) != $true) | ((cQ @ (sK0 @ X0)) != $true) | ((cP @ X0) = $true)) )),
% 1.65/1.44 inference(subsumption_resolution,[status(thm)],[f13,f9])).
% 1.65/1.44 thf(f13,plain,(
% 1.65/1.44 ( ! [X0 : $i] : (((cQ @ X0) != $true) | ((cQ @ (sK0 @ X0)) != $true) | ((cQ @ c) != $true) | ((cP @ X0) = $true)) )),
% 1.65/1.44 inference(subsumption_resolution,[status(thm)],[f11,f9])).
% 1.65/1.44 thf(f11,plain,(
% 1.65/1.44 ( ! [X0 : $i] : (((cQ @ d) != $true) | ((cP @ X0) = $true) | ((cQ @ c) != $true) | ((cQ @ X0) != $true) | ((cQ @ (sK0 @ X0)) != $true)) )),
% 1.65/1.44 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.44 thf(f17,plain,(
% 1.65/1.44 ((cP @ a) != $true)),
% 1.65/1.44 inference(subsumption_resolution,[status(thm)],[f12,f16])).
% 1.65/1.44 thf(f12,plain,(
% 1.65/1.44 ((cP @ b) != $true) | ((cP @ a) != $true)),
% 1.65/1.44 inference(cnf_transformation,[status(thm)],[f8])).
% 1.65/1.44 % SZS output end Proof for DTF2THF_25117
% 1.65/1.44 % (25215)------------------------------
% 1.65/1.44 % (25215)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.44 % (25215)Termination reason: Refutation
% 1.65/1.44
% 1.65/1.44 % (25215)Memory used [KB]: 5500
% 1.65/1.44 % (25215)Time elapsed: 0.003 s
% 1.65/1.44 % (25215)Instructions burned: 1 (million)
% 1.65/1.44 % (25215)------------------------------
% 1.65/1.44 % (25215)------------------------------
% 1.65/1.44 % (25214)Success in time 0.017 s
%------------------------------------------------------------------------------