%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO053^2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:48:49 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 35 unt; 0 typ; 0 def)
% Number of atoms : 124 ( 34 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 192 ( 39 ~; 12 |; 0 &; 129 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 78 ( 78 >; 0 *; 0 +; 0 <<)
% Number of symbols : 50 ( 46 usr; 3 con; 0-4 aty)
% ( 12 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 99 ( 71 ^; 23 !; 5 ?; 99 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mu: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
meq_ind: mu > mu > $i > $o ).
thf(func_def_1,type,
meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_3,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_4,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_5,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_6,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_11,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_12,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(func_def_13,type,
mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(func_def_14,type,
mtrue: $i > $o ).
thf(func_def_15,type,
mfalse: $i > $o ).
thf(func_def_16,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_17,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_18,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
mserial: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
meuclidean: ( $i > $i > $o ) > $o ).
thf(func_def_23,type,
mpartially_functional: ( $i > $i > $o ) > $o ).
thf(func_def_24,type,
mfunctional: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
mweakly_dense: ( $i > $i > $o ) > $o ).
thf(func_def_26,type,
mweakly_connected: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
mweakly_directed: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_29,type,
minvalid: ( $i > $o ) > $o ).
thf(func_def_30,type,
msatisfiable: ( $i > $o ) > $o ).
thf(func_def_31,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_32,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_35,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_36,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vNOT: $o > $o ).
thf(func_def_38,type,
vOR: $o > $o > $o ).
thf(func_def_39,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_42,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vIMP: $o > $o > $o ).
thf(func_def_44,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_45,type,
vAND: $o > $o > $o ).
thf(func_def_46,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_47,type,
sK0: $i > ( $i > $i > $o ) > $i ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(f14,axiom,
( mtrue
= ( ^ [X0: $i] : $true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mtrue) ).
thf(f16,axiom,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
| ~ ( X0 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(f17,axiom,
( mdia
= ( ^ [X0: $i > $i > $o,X1: $i > $o] : ( mnot @ ( mbox @ X0 @ ( mnot @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mdia) ).
thf(f28,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(f32,conjecture,
? [X0: $i > $i > $o] :
~ ( mvalid @ ( mdia @ X0 @ mtrue ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f33,negated_conjecture,
~ ? [X0: $i > $i > $o] :
~ ( mvalid @ ( mdia @ X0 @ mtrue ) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
thf(f36,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f37,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f36]) ).
thf(f53,plain,
( mtrue
= ( ^ [Y0: $i] : $true ) ),
inference(fool_elimination,[],[f14]) ).
thf(f54,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
| ~ ( X0 @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f16]) ).
thf(f55,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f54]) ).
thf(f56,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] : ( mnot @ ( mbox @ Y0 @ ( mnot @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f77,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f28]) ).
thf(f78,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f77]) ).
thf(f85,plain,
~ ? [X0: $i > $i > $o] :
~ ( mvalid @ ( mdia @ X0 @ mtrue ) ),
inference(rectify,[],[f33]) ).
thf(f86,plain,
~ ? [X0: $i > $i > $o] :
( ( mvalid @ ( mdia @ X0 @ mtrue ) )
!= $true ),
inference(fool_elimination,[],[f85]) ).
thf(f87,plain,
~ ? [X0: $i > $i > $o] :
( ( mvalid @ ( mdia @ X0 @ mtrue ) )
!= $true ),
inference(flattening,[],[f86]) ).
thf(f88,plain,
! [X0: $i > $i > $o] :
( ( mvalid @ ( mdia @ X0 @ mtrue ) )
= $true ),
inference(ennf_transformation,[],[f87]) ).
thf(f91,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f102,plain,
( mtrue
= ( ^ [Y0: $i] : $true ) ),
inference(cnf_transformation,[],[f53]) ).
thf(f104,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ~ ( Y0 @ Y2 @ Y3 )
| ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f55]) ).
thf(f105,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] : ( mnot @ ( mbox @ Y0 @ ( mnot @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f56]) ).
thf(f116,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f78]) ).
thf(f120,plain,
! [X0: $i > $i > $o] :
( ( mvalid @ ( mdia @ X0 @ mtrue ) )
= $true ),
inference(cnf_transformation,[],[f88]) ).
thf(f131,plain,
( mdia
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ~ ( Y2 @ Y4 @ Y5 )
| ( Y3 @ Y5 ) ) )
@ Y0
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) ) ) ),
inference(definition_unfolding,[],[f105,f91,f104,f91]) ).
thf(f132,plain,
! [X0: $i > $i > $o] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ ( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ~ ( Y2 @ Y4 @ Y5 )
| ( Y3 @ Y5 ) ) )
@ Y0
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y1 ) ) )
@ X0
@ ^ [Y0: $i] : $true ) ) ),
inference(definition_unfolding,[],[f120,f116,f131,f102]) ).
thf(f133,plain,
! [X0: $i > $i > $o] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( X0 @ Y0 @ Y1 )
| ~ $true ) ) ) ),
inference(beta-eta_normalization,[],[f132]) ).
thf(f134,plain,
! [X0: $i > $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i] :
~ ( !! @ $i
@ ^ [Y1: $i] :
( ~ ( X0 @ Y0 @ Y1 )
| ~ $true ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f133]) ).
thf(f135,plain,
! [X0: $i > $i > $o,X1: $i] :
( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( X0 @ X1 @ Y0 )
| ~ $true ) ) ) ),
inference(beta-eta_normalization,[],[f134]) ).
thf(f136,plain,
! [X0: $i > $i > $o,X1: $i] :
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( X0 @ X1 @ Y0 )
| ~ $true ) ) ),
inference(not_proxy_clausification,[],[f135]) ).
thf(f137,plain,
! [X0: $i > $i > $o,X1: $i] :
( $false
= ( ^ [Y0: $i] :
( ~ ( X0 @ X1 @ Y0 )
| ~ $true )
@ ( sK0 @ X1 @ X0 ) ) ),
inference(sigma_proxy_clausification,[],[f136]) ).
thf(f138,plain,
! [X0: $i > $i > $o,X1: $i] :
( $false
= ( ~ ( X0 @ X1 @ ( sK0 @ X1 @ X0 ) )
| ~ $true ) ),
inference(beta-eta_normalization,[],[f137]) ).
thf(f140,plain,
! [X0: $i > $i > $o,X1: $i] :
( $false
= ( ~ ( X0 @ X1 @ ( sK0 @ X1 @ X0 ) ) ) ),
inference(or_proxy_clausification,[],[f138]) ).
thf(f141,plain,
! [X0: $i > $i > $o,X1: $i] :
( $true
= ( X0 @ X1 @ ( sK0 @ X1 @ X0 ) ) ),
inference(not_proxy_clausification,[],[f140]) ).
thf(f153,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i,Y1: $i] : $false
@ X1
@ ( sK0 @ X1
@ ^ [Y0: $i,Y1: $i] : $false ) ) ),
inference(primitive_instantiation,[],[f141]) ).
thf(f158,plain,
$true = $false,
inference(beta-eta_normalization,[],[f153]) ).
thf(f159,plain,
$false,
inference(trivial_inequality_removal,[],[f158]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO053^2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n017.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 16:20:22 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.20/0.27 % (542165)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (542174)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=147268250:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (542174)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (542174) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-542165-542174"...
% 0.20/0.27 % (542171)% WARNING: option uhcvi not known.
% 0.20/0.27 % (542174)...printing done.
% 0.20/0.27 % (542174)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (542174)------------------------------
% 0.20/0.28 % (542174)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (542174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (542174)CaDiCaL version: 2.1.3
% 0.20/0.28 % (542174)Termination reason: Refutation
% 0.20/0.28 % (542174)Time elapsed: 0.003 s
% 0.20/0.28 % (542174)Peak memory usage: 12 MB
% 0.20/0.28 % (542174)Instructions burned: 9 (million)
% 0.20/0.28 % (542165)Success in time 0.037 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------