%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU821^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:34:11 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 437 ( 63 equ; 0 cnn)
% Maximal formula atoms : 3 ( 11 avg)
% Number of connectives : 850 ( 23 ~; 32 |; 59 &; 556 @)
% ( 0 <=>; 110 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 28 ( 23 usr; 6 con; 0-4 aty)
% ( 63 !!; 7 ??; 0 @@+; 0 @@-)
% Number of variables : 125 ( 91 ^; 30 !; 4 ?; 125 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
powerset: $i > $i ).
thf(func_def_2,type,
nonempty: $i > $o ).
thf(func_def_3,type,
transitiveset: $i > $o ).
thf(func_def_4,type,
stricttotalorderedByIn: $i > $o ).
thf(func_def_6,type,
wellorderedByIn: $i > $o ).
thf(func_def_7,type,
ordinal: $i > $o ).
thf(func_def_8,type,
vAND: $o > $o > $o ).
thf(func_def_9,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
vIMP: $o > $o > $o ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_16,type,
vOR: $o > $o > $o ).
thf(func_def_17,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_18,type,
vNOT: $o > $o ).
thf(func_def_19,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_24,type,
sK2: $i > $i ).
thf(f1,axiom,
( stricttotalorderedByIn
= ( ^ [X0: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ~ ( in @ X2 @ X2 ) )
& ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( in @ X3 @ X2 )
| ( in @ X2 @ X3 )
| ( X2 = X3 ) ) ) )
& ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( ( in @ X2 @ X3 )
& ( in @ X1 @ X2 ) )
=> ( in @ X1 @ X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',stricttotalorderedByIn) ).
thf(f2,axiom,
( wellorderedByIn
= ( ^ [X0: $i] :
( ! [X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ( ( nonempty @ X1 )
=> ? [X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X2 @ X3 )
| ( X2 = X3 ) ) )
& ( in @ X2 @ X1 ) ) ) )
& ( stricttotalorderedByIn @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wellorderedByIn) ).
thf(f3,axiom,
( ordinal
= ( ^ [X0: $i] :
( ( wellorderedByIn @ X0 )
& ( transitiveset @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordinal) ).
thf(f4,conjecture,
! [X0: $i] :
( ( ordinal @ X0 )
=> ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ~ ( in @ X1 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordinalIrrefl) ).
thf(f5,negated_conjecture,
~ ! [X0: $i] :
( ( ordinal @ X0 )
=> ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ~ ( in @ X1 @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( stricttotalorderedByIn
= ( ^ [X0: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ~ ( in @ X1 @ X1 ) )
& ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( in @ X3 @ X2 )
| ( in @ X2 @ X3 )
| ( X2 = X3 ) ) ) )
& ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ! [X5: $i] :
( ( in @ X5 @ X0 )
=> ! [X6: $i] :
( ( in @ X6 @ X0 )
=> ( ( ( in @ X5 @ X6 )
& ( in @ X4 @ X5 ) )
=> ( in @ X4 @ X6 ) ) ) ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( stricttotalorderedByIn
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ( ( in @ Y1 @ Y2 )
& ( in @ Y2 @ Y3 ) )
=> ( in @ Y1 @ Y3 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( ( Y1 = Y2 )
| ( in @ Y1 @ Y2 )
| ( in @ Y2 @ Y1 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ~ ( in @ Y1 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( wellorderedByIn
= ( ^ [X0: $i] :
( ! [X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ( ( nonempty @ X1 )
=> ? [X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X2 @ X3 )
| ( X2 = X3 ) ) )
& ( in @ X2 @ X1 ) ) ) )
& ( stricttotalorderedByIn @ X0 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
( wellorderedByIn
= ( ^ [Y0: $i] :
( ( stricttotalorderedByIn @ Y0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( powerset @ Y0 ) )
=> ( ( nonempty @ Y1 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ( Y2 = Y3 )
| ( in @ Y2 @ Y3 ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( ordinal
= ( ^ [X0: $i] :
( ( wellorderedByIn @ X0 )
& ( transitiveset @ X0 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
( ordinal
= ( ^ [Y0: $i] :
( ( transitiveset @ Y0 )
& ( wellorderedByIn @ Y0 ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ! [X0: $i] :
( ( ordinal @ X0 )
=> ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ~ ( in @ X1 @ X1 ) ) ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
~ ! [X0: $i] :
( ( ( ordinal @ X0 )
= $true )
=> ! [X1: $i] :
( ( ( in @ X1 @ X0 )
= $true )
=> ( ( in @ X1 @ X1 )
!= $true ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
~ ! [X0: $i] :
( ( ( ordinal @ X0 )
= $true )
=> ! [X1: $i] :
( ( ( in @ X1 @ X0 )
= $true )
=> ( ( in @ X1 @ X1 )
!= $true ) ) ),
inference(flattening,[],[f13]) ).
thf(f15,plain,
? [X0: $i] :
( ? [X1: $i] :
( ( ( in @ X1 @ X1 )
= $true )
& ( ( in @ X1 @ X0 )
= $true ) )
& ( ( ordinal @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f16,plain,
( ( $true
= ( in @ sK1 @ sK1 ) )
& ( $true
= ( in @ sK1 @ sK0 ) )
& ( $true
= ( ordinal @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f15]) ).
thf(f17,plain,
( stricttotalorderedByIn
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ( ( in @ Y1 @ Y2 )
& ( in @ Y2 @ Y3 ) )
=> ( in @ Y1 @ Y3 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( ( Y1 = Y2 )
| ( in @ Y1 @ Y2 )
| ( in @ Y2 @ Y1 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ~ ( in @ Y1 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f18,plain,
( wellorderedByIn
= ( ^ [Y0: $i] :
( ( stricttotalorderedByIn @ Y0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( powerset @ Y0 ) )
=> ( ( nonempty @ Y1 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ( Y2 = Y3 )
| ( in @ Y2 @ Y3 ) ) ) ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f19,plain,
( ordinal
= ( ^ [Y0: $i] :
( ( transitiveset @ Y0 )
& ( wellorderedByIn @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f20,plain,
( $true
= ( ordinal @ sK0 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f21,plain,
( $true
= ( in @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f22,plain,
( $true
= ( in @ sK1 @ sK1 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f25,plain,
( wellorderedByIn
= ( ^ [Y0: $i] :
( ( ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y1 )
=> ( ( ( in @ Y2 @ Y3 )
& ( in @ Y3 @ Y4 ) )
=> ( in @ Y2 @ Y4 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ( Y2 = Y3 )
| ( in @ Y2 @ Y3 )
| ( in @ Y3 @ Y2 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ~ ( in @ Y2 @ Y2 ) ) ) )
@ Y0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( powerset @ Y0 ) )
=> ( ( nonempty @ Y1 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ( Y2 = Y3 )
| ( in @ Y2 @ Y3 ) ) ) ) ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f18,f17]) ).
thf(f26,plain,
( ordinal
= ( ^ [Y0: $i] :
( ( transitiveset @ Y0 )
& ( ^ [Y1: $i] :
( ( ^ [Y2: $i] :
( ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( !! @ $i
@ ^ [Y5: $i] :
( ( in @ Y5 @ Y2 )
=> ( ( ( in @ Y3 @ Y4 )
& ( in @ Y4 @ Y5 ) )
=> ( in @ Y3 @ Y5 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( ( Y3 = Y4 )
| ( in @ Y3 @ Y4 )
| ( in @ Y4 @ Y3 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ~ ( in @ Y3 @ Y3 ) ) ) )
@ Y1 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ ( powerset @ Y1 ) )
=> ( ( nonempty @ Y2 )
=> ( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
& ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( ( Y3 = Y4 )
| ( in @ Y3 @ Y4 ) ) ) ) ) ) ) ) ) )
@ Y0 ) ) ) ),
inference(definition_unfolding,[],[f19,f25]) ).
thf(f27,plain,
( $true
= ( ^ [Y0: $i] :
( ( transitiveset @ Y0 )
& ( ^ [Y1: $i] :
( ( ^ [Y2: $i] :
( ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( !! @ $i
@ ^ [Y5: $i] :
( ( in @ Y5 @ Y2 )
=> ( ( ( in @ Y3 @ Y4 )
& ( in @ Y4 @ Y5 ) )
=> ( in @ Y3 @ Y5 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( ( Y3 = Y4 )
| ( in @ Y3 @ Y4 )
| ( in @ Y4 @ Y3 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ~ ( in @ Y3 @ Y3 ) ) ) )
@ Y1 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ ( powerset @ Y1 ) )
=> ( ( nonempty @ Y2 )
=> ( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
& ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( ( Y3 = Y4 )
| ( in @ Y3 @ Y4 ) ) ) ) ) ) ) ) ) )
@ Y0 ) )
@ sK0 ) ),
inference(definition_unfolding,[],[f20,f26]) ).
thf(f28,plain,
( $true
= ( ( transitiveset @ sK0 )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK0 )
=> ( ( ( in @ Y0 @ Y1 )
& ( in @ Y1 @ Y2 ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
=> ( ( Y0 = Y1 )
| ( in @ Y0 @ Y1 )
| ( in @ Y1 @ Y0 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ~ ( in @ Y0 @ Y0 ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( powerset @ sK0 ) )
=> ( ( nonempty @ Y0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( ( Y1 = Y2 )
| ( in @ Y1 @ Y2 ) ) ) ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f29,plain,
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK0 )
=> ( ( ( in @ Y0 @ Y1 )
& ( in @ Y1 @ Y2 ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
=> ( ( Y0 = Y1 )
| ( in @ Y0 @ Y1 )
| ( in @ Y1 @ Y0 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ~ ( in @ Y0 @ Y0 ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( powerset @ sK0 ) )
=> ( ( nonempty @ Y0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( ( Y1 = Y2 )
| ( in @ Y1 @ Y2 ) ) ) ) ) ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f28]) ).
thf(f32,plain,
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK0 )
=> ( ( ( in @ Y0 @ Y1 )
& ( in @ Y1 @ Y2 ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
=> ( ( Y0 = Y1 )
| ( in @ Y0 @ Y1 )
| ( in @ Y1 @ Y0 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ~ ( in @ Y0 @ Y0 ) ) ) ) ),
inference(and_proxy_clausification,[],[f29]) ).
thf(f33,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ~ ( in @ Y0 @ Y0 ) ) ) ),
inference(and_proxy_clausification,[],[f32]) ).
thf(f57,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ~ ( in @ Y0 @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f33]) ).
thf(f58,plain,
! [X1: $i] :
( $true
= ( ( in @ X1 @ sK0 )
=> ~ ( in @ X1 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f57]) ).
thf(f59,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( $true
= ( ~ ( in @ X1 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f58]) ).
thf(f60,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( ( in @ X1 @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f59]) ).
thf(f75,plain,
( ( $true = $false )
| ( ( in @ sK1 @ sK0 )
= $false ) ),
inference(constrained_superposition,[],[f22,f60]) ).
thf(f80,plain,
( ( in @ sK1 @ sK0 )
= $false ),
inference(trivial_inequality_removal,[],[f75]) ).
thf(f97,plain,
$true = $false,
inference(constrained_superposition,[],[f21,f80]) ).
thf(f98,plain,
$false,
inference(trivial_inequality_removal,[],[f97]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU821^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17 % Computer : n020.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 14:35:34 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.25 % (1139188)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (1139198)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=866834152:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.25 % (1139198) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1139188-1139198"...
% 0.07/0.25 % (1139194)% WARNING: option uhcvi not known.
% 0.07/0.25 % (1139198)...printing done.
% 0.07/0.25 % (1139198)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Theorem for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.25 % (1139198)------------------------------
% 0.07/0.25 % (1139198)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (1139198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (1139198)CaDiCaL version: 2.1.3
% 0.07/0.25 % (1139198)Termination reason: Refutation
% 0.07/0.25 % (1139198)Time elapsed: 0.003 s
% 0.07/0.25 % (1139198)Peak memory usage: 12 MB
% 0.07/0.25 % (1139198)Instructions burned: 11 (million)
% 0.07/0.25 % (1139188)Success in time 0.032 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------