%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV435^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:40:06 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 59 ( 54 unt; 0 typ; 0 def)
% Number of atoms : 225 ( 57 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 185 ( 7 ~; 14 |; 0 &; 141 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 56 ( 56 >; 0 *; 0 +; 0 <<)
% Number of symbols : 47 ( 43 usr; 5 con; 0-4 aty)
% ( 12 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 97 ( 89 ^; 8 !; 0 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
individuals: $tType ).
thf(func_def_1,type,
prop_a: $i > $o ).
thf(func_def_2,type,
prop_b: $i > $o ).
thf(func_def_3,type,
prop_c: $i > $o ).
thf(func_def_4,type,
mfalse: $i > $o ).
thf(func_def_5,type,
mtrue: $i > $o ).
thf(func_def_6,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
miff: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_12,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_13,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_14,type,
mall: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_15,type,
mexists: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_16,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_17,type,
msatisfiable: ( $i > $o ) > $o ).
thf(func_def_18,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_19,type,
minvalid: ( $i > $o ) > $o ).
thf(func_def_20,type,
rel: $i > $i > $o ).
thf(func_def_21,type,
icl_atom: ( $i > $o ) > $i > $o ).
thf(func_def_22,type,
icl_princ: ( $i > $o ) > $i > $o ).
thf(func_def_23,type,
icl_and: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_24,type,
icl_or: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_25,type,
icl_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_26,type,
icl_true: $i > $o ).
thf(func_def_27,type,
icl_false: $i > $o ).
thf(func_def_28,type,
icl_says: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_29,type,
iclval: ( $i > $o ) > $o ).
thf(func_def_30,type,
a: $i > $o ).
thf(func_def_33,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_34,type,
vNOT: $o > $o ).
thf(func_def_35,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vOR: $o > $o > $o ).
thf(func_def_38,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
vAND: $o > $o > $o ).
thf(func_def_40,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_41,type,
vIMP: $o > $o > $o ).
thf(func_def_42,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(f1,axiom,
( mfalse
= ( ^ [X0: $i] : $false ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mfalse) ).
thf(f2,axiom,
( mtrue
= ( ^ [X0: $i] : $true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mtrue) ).
thf(f4,axiom,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mor) ).
thf(f8,axiom,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(f12,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(f17,axiom,
( icl_princ
= ( ^ [X0: $i > $o] : X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_princ) ).
thf(f21,axiom,
icl_true = mtrue,
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_true) ).
thf(f22,axiom,
icl_false = mfalse,
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_false) ).
thf(f23,axiom,
( icl_says
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mbox @ rel @ ( mor @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_says) ).
thf(f24,axiom,
( iclval
= ( ^ [X0: $i > $o] : ( mvalid @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV008^0.ax',icl_s4_valid) ).
thf(f25,axiom,
( ( icl_princ @ a )
= icl_true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
thf(f26,conjecture,
iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',untrust) ).
thf(f27,negated_conjecture,
~ ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) ),
inference(negated_conjecture,[status(cth)],[f26]) ).
thf(f28,plain,
( mfalse
= ( ^ [Y0: $i] : $false ) ),
inference(fool_elimination,[],[f1]) ).
thf(f29,plain,
( mtrue
= ( ^ [Y0: $i] : $true ) ),
inference(fool_elimination,[],[f2]) ).
thf(f32,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f33,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f32]) ).
thf(f38,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f39,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f38]) ).
thf(f46,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f12]) ).
thf(f47,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f46]) ).
thf(f55,plain,
( icl_princ
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(fool_elimination,[],[f17]) ).
thf(f59,plain,
( icl_says
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mbox @ rel @ ( mor @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f23]) ).
thf(f60,plain,
( iclval
= ( ^ [Y0: $i > $o] : ( mvalid @ Y0 ) ) ),
inference(fool_elimination,[],[f24]) ).
thf(f61,plain,
~ ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) ),
inference(rectify,[],[f27]) ).
thf(f62,plain,
( ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) )
!= $true ),
inference(fool_elimination,[],[f61]) ).
thf(f63,plain,
( ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) )
!= $true ),
inference(flattening,[],[f62]) ).
thf(f64,plain,
( mfalse
= ( ^ [Y0: $i] : $false ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f65,plain,
( mtrue
= ( ^ [Y0: $i] : $true ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f67,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f33]) ).
thf(f71,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f75,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f47]) ).
thf(f80,plain,
( icl_princ
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(cnf_transformation,[],[f55]) ).
thf(f84,plain,
mtrue = icl_true,
inference(cnf_transformation,[],[f21]) ).
thf(f85,plain,
mfalse = icl_false,
inference(cnf_transformation,[],[f22]) ).
thf(f86,plain,
( icl_says
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mbox @ rel @ ( mor @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f59]) ).
thf(f87,plain,
( iclval
= ( ^ [Y0: $i > $o] : ( mvalid @ Y0 ) ) ),
inference(cnf_transformation,[],[f60]) ).
thf(f88,plain,
( icl_true
= ( icl_princ @ a ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f89,plain,
( ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) )
!= $true ),
inference(cnf_transformation,[],[f63]) ).
thf(f98,plain,
( icl_true
= ( ^ [Y0: $i] : $true ) ),
inference(definition_unfolding,[],[f84,f65]) ).
thf(f99,plain,
( icl_false
= ( ^ [Y0: $i] : $false ) ),
inference(definition_unfolding,[],[f85,f64]) ).
thf(f100,plain,
( icl_says
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ( Y2 @ Y4 @ Y5 )
=> ( Y3 @ Y5 ) ) )
@ rel
@ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ Y0
@ Y1 ) ) ) ),
inference(definition_unfolding,[],[f86,f71,f67]) ).
thf(f101,plain,
( iclval
= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
@ Y0 ) ) ),
inference(definition_unfolding,[],[f87,f75]) ).
thf(f102,plain,
( ( ^ [Y0: $i] : $true )
= ( ^ [Y0: $i > $o] : Y0
@ a ) ),
inference(definition_unfolding,[],[f88,f98,f80]) ).
thf(f103,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
@ Y0 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ( Y2 @ Y4 @ Y5 )
=> ( Y3 @ Y5 ) ) )
@ rel
@ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ Y0
@ Y1 ) )
@ ( ^ [Y0: $i > $o] : Y0
@ a )
@ ^ [Y0: $i] : $false ) ) ),
inference(definition_unfolding,[],[f89,f101,f100,f80,f99]) ).
thf(f104,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel @ Y0 @ Y1 )
=> ( ( a @ Y1 )
| $false ) ) ) ) ),
inference(beta-eta_normalization,[],[f103]) ).
thf(f105,plain,
( $false
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel @ Y0 @ Y1 )
=> ( ( a @ Y1 )
| $false ) ) )
@ sK0 ) ),
inference(sigma_proxy_clausification,[],[f104]) ).
thf(f106,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( rel @ sK0 @ Y0 )
=> ( ( a @ Y0 )
| $false ) ) ) ),
inference(beta-eta_normalization,[],[f105]) ).
thf(f107,plain,
( $false
= ( ^ [Y0: $i] :
( ( rel @ sK0 @ Y0 )
=> ( ( a @ Y0 )
| $false ) )
@ sK1 ) ),
inference(sigma_proxy_clausification,[],[f106]) ).
thf(f108,plain,
( $false
= ( ( rel @ sK0 @ sK1 )
=> ( ( a @ sK1 )
| $false ) ) ),
inference(beta-eta_normalization,[],[f107]) ).
thf(f109,plain,
( $false
= ( ( a @ sK1 )
| $false ) ),
inference(imp_proxy_clausification,[],[f108]) ).
thf(f112,plain,
( $false
= ( a @ sK1 ) ),
inference(or_proxy_clausification,[],[f109]) ).
thf(f113,plain,
( a
= ( ^ [Y0: $i] : $true ) ),
inference(beta-eta_normalization,[],[f102]) ).
thf(f123,plain,
! [X1: $i] :
( ( a @ X1 )
= ( ^ [Y0: $i] : $true
@ X1 ) ),
inference(argument_congruence,[],[f113]) ).
thf(f124,plain,
! [X1: $i] :
( ( $true
= ( a @ X1 ) )
| ( $false
= ( ^ [Y0: $i] : $true
@ X1 ) ) ),
inference(iff_proxy_clausification,[],[f123]) ).
thf(f127,plain,
! [X1: $i] :
( ( $true
= ( a @ X1 ) )
| ( $false = $true ) ),
inference(beta-eta_normalization,[],[f124]) ).
thf(f128,plain,
! [X1: $i] :
( $true
= ( a @ X1 ) ),
inference(trivial_inequality_removal,[],[f127]) ).
thf(f130,plain,
$false = $true,
inference(constrained_superposition,[],[f112,f128]) ).
thf(f131,plain,
$false,
inference(trivial_inequality_removal,[],[f130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV435^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 % Computer : n007.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 16:01:41 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/0.22 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 % (3553676)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (3553684)dis+10_1_sil=32000:sp=arity:random_seed=1604008109:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (3553684) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3553676-3553684"...
% 0.20/0.27 % (3553682)% WARNING: option uhcvi not known.
% 0.20/0.27 % (3553684)...printing done.
% 0.20/0.27 % (3553684)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.27 % (3553684)------------------------------
% 0.20/0.27 % (3553684)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (3553684)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (3553684)CaDiCaL version: 2.1.3
% 0.20/0.27 % (3553684)Termination reason: Refutation
% 0.20/0.27 % (3553684)Time elapsed: 0.003 s
% 0.20/0.27 % (3553684)Peak memory usage: 12 MB
% 0.20/0.27 % (3553684)Instructions burned: 6 (million)
% 0.20/0.27 % (3553676)Success in time 0.037 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------