%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL614^1 : 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 : n014.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:15:03 AM UTC 2026
% Result : Theorem 0.22s 0.33s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 37 unt; 0 typ; 0 def)
% Number of atoms : 223 ( 46 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 285 ( 18 ~; 11 |; 2 &; 214 @)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 71 ( 71 >; 0 *; 0 +; 0 <<)
% Number of symbols : 39 ( 35 usr; 5 con; 0-4 aty)
% ( 17 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 105 ( 83 ^; 19 !; 3 ?; 105 :)
% 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_22,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_23,type,
vNOT: $o > $o ).
thf(func_def_24,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_25,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_26,type,
vOR: $o > $o > $o ).
thf(func_def_27,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_28,type,
vAND: $o > $o > $o ).
thf(func_def_29,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_30,type,
vIMP: $o > $o > $o ).
thf(func_def_31,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_32,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_33,type,
sK0: $i > $i > $o ).
thf(func_def_34,type,
sK1: $i > $o ).
thf(func_def_35,type,
sK2: $i > $o ).
thf(f3,axiom,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mnot) ).
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(f6,axiom,
( mimpl
= ( ^ [X0: $i > $o,X1: $i > $o] : ( mor @ ( mnot @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mimpl) ).
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(f16,conjecture,
! [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ( mvalid @ ( mimpl @ X1 @ X2 ) )
=> ( mvalid @ ( mimpl @ ( mbox @ X0 @ X1 ) @ ( mbox @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',regularity) ).
thf(f17,negated_conjecture,
~ ! [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ( mvalid @ ( mimpl @ X1 @ X2 ) )
=> ( mvalid @ ( mimpl @ ( mbox @ X0 @ X1 ) @ ( mbox @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f16]) ).
thf(f20,plain,
( mnot
= ( ^ [X0: $i > $o,X1: $i] :
~ ( X0 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f21,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f20]) ).
thf(f22,plain,
( mor
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f23,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f22]) ).
thf(f26,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f28,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f29,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f28]) ).
thf(f36,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f12]) ).
thf(f37,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f36]) ).
thf(f44,plain,
~ ! [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ( mvalid @ ( mimpl @ X1 @ X2 ) )
=> ( mvalid @ ( mimpl @ ( mbox @ X0 @ X1 ) @ ( mbox @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f17]) ).
thf(f45,plain,
~ ! [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ( ( mvalid @ ( mimpl @ X1 @ X2 ) )
= $true )
=> ( ( mvalid @ ( mimpl @ ( mbox @ X0 @ X1 ) @ ( mbox @ X0 @ X1 ) ) )
= $true ) ),
inference(fool_elimination,[],[f44]) ).
thf(f46,plain,
? [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ( ( mvalid @ ( mimpl @ ( mbox @ X0 @ X1 ) @ ( mbox @ X0 @ X1 ) ) )
!= $true )
& ( ( mvalid @ ( mimpl @ X1 @ X2 ) )
= $true ) ),
inference(ennf_transformation,[],[f45]) ).
thf(f47,plain,
( ( $true
!= ( mvalid @ ( mimpl @ ( mbox @ sK0 @ sK1 ) @ ( mbox @ sK0 @ sK1 ) ) ) )
& ( $true
= ( mvalid @ ( mimpl @ sK1 @ sK2 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f46]) ).
thf(f50,plain,
( mnot
= ( ^ [Y0: $i > $o,Y1: $i] :
~ ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f51,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f53,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mor @ ( mnot @ Y0 ) @ Y1 ) ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f55,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f59,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f64,plain,
( $true
!= ( mvalid @ ( mimpl @ ( mbox @ sK0 @ sK1 ) @ ( mbox @ sK0 @ sK1 ) ) ) ),
inference(cnf_transformation,[],[f47]) ).
thf(f67,plain,
( mimpl
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 ) ) ),
inference(definition_unfolding,[],[f53,f51,f50]) ).
thf(f69,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ ( ^ [Y2: $i > $o,Y3: $i] :
~ ( Y2 @ Y3 )
@ Y0 )
@ Y1 )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ sK0
@ sK1 )
@ ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ sK0
@ sK1 ) ) ) ),
inference(definition_unfolding,[],[f64,f59,f67,f55,f55]) ).
thf(f76,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( sK1 @ Y1 ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( sK1 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f69]) ).
thf(f77,plain,
( $false
= ( ^ [Y0: $i] :
( ~ ( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( sK1 @ Y1 ) ) )
| ( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( sK1 @ Y1 ) ) ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f76]) ).
thf(f78,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) )
| ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f77]) ).
thf(f79,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) ) ),
inference(or_proxy_clausification,[],[f78]) ).
thf(f80,plain,
( $false
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) ) ) ),
inference(or_proxy_clausification,[],[f78]) ).
thf(f81,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) ) ) ),
inference(not_proxy_clausification,[],[f80]) ).
thf(f82,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( sK0 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f81]) ).
thf(f83,plain,
! [X1: $i] :
( $true
= ( ( sK0 @ sK3 @ X1 )
=> ( sK1 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f82]) ).
thf(f84,plain,
! [X1: $i] :
( ( $false
= ( sK0 @ sK3 @ X1 ) )
| ( $true
= ( sK1 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f83]) ).
thf(f85,plain,
( $false
= ( ^ [Y0: $i] :
( ( sK0 @ sK3 @ Y0 )
=> ( sK1 @ Y0 ) )
@ sK4 ) ),
inference(sigma_proxy_clausification,[],[f79]) ).
thf(f86,plain,
( $false
= ( ( sK0 @ sK3 @ sK4 )
=> ( sK1 @ sK4 ) ) ),
inference(beta-eta_normalization,[],[f85]) ).
thf(f87,plain,
( $false
= ( sK1 @ sK4 ) ),
inference(imp_proxy_clausification,[],[f86]) ).
thf(f88,plain,
( $true
= ( sK0 @ sK3 @ sK4 ) ),
inference(imp_proxy_clausification,[],[f86]) ).
thf(f90,plain,
( ( $false = $true )
| ( $true
= ( sK1 @ sK4 ) ) ),
inference(constrained_superposition,[],[f88,f84]) ).
thf(f91,plain,
( $true
= ( sK1 @ sK4 ) ),
inference(trivial_inequality_removal,[],[f90]) ).
thf(f93,plain,
$false = $true,
inference(forward_demodulation,[],[f91,f87]) ).
thf(f94,plain,
$false,
inference(trivial_inequality_removal,[],[f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL614^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 % Computer : n014.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Tue Sep 29 09:21:30 UTC 2026
% 0.09/0.23 % CPUTime :
% 0.09/0.23 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.22/0.27 Running first-order model finding
% 0.22/0.27 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.22/0.33 % (2427501)Will run a generic schedule for satisfiability detection.
% 0.22/0.33 % (2427506)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3314119891_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.33 % (2427507)% WARNING: option uhcvi not known.
% 0.22/0.33 % Exception at run slice level
% 0.22/0.33 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.33 % (2427507)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=147376400:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.33 % (2427507)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.33 % (2427507)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.22/0.33 % (2427512)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1601926781:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.33 % (2427507) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2427501-2427507"...
% 0.22/0.33 % (2427507)...printing done.
% 0.22/0.33 % (2427512) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2427501-2427512"...
% 0.22/0.33 % (2427507)Refutation found. Thanks to Tanya!
% 0.22/0.33 % SZS status Theorem for theBenchmark
% 0.22/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.33 % (2427507)------------------------------
% 0.22/0.33 % (2427507)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.33 % (2427507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.33 % (2427507)CaDiCaL version: 2.1.3
% 0.22/0.33 % (2427507)Termination reason: Refutation
% 0.22/0.33 % (2427507)Time elapsed: 0.005 s
% 0.22/0.33 % (2427507)Peak memory usage: 12 MB
% 0.22/0.33 % (2427507)Instructions burned: 6 (million)
% 0.22/0.33 % (2427501)Success in time 0.038 s
% 0.22/0.33 % Vampire exiting
%------------------------------------------------------------------------------