%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV453^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:39:32 AM UTC 2026
% Result : Theorem 0.91s 0.37s
% Output : Refutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 83 ( 21 unt; 0 typ; 6 def)
% Number of atoms : 355 ( 75 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 398 ( 49 ~; 72 |; 6 &; 265 @)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 31 ( 28 usr; 9 con; 0-4 aty)
% Number of variables : 74 ( 0 sgn 72 !; 2 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/UNIV':
!>[X0: $tType] : ( X0 > $o ) ).
thf(func_def_1,type,
'const/sets/INTER':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_2,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
vAND: $o > $o > $o ).
thf(func_def_7,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_8,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_9,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_11,type,
sK1: sK0 > $o ).
thf(func_def_12,type,
vNOT: $o > $o ).
thf(func_def_13,type,
sK2:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_14,type,
sK3: sK0 ).
thf(func_def_16,type,
sK5:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_17,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
sK6:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > sK0 > $o ) > ( X0 > sK0 > $o ) > X0 ) ).
thf(func_def_19,type,
sK7:
!>[X0: $tType] : ( ( X0 > sK0 > $o ) > X0 > sK0 ) ).
thf(func_def_20,type,
sK8:
!>[X0: $tType] : ( X0 > ( X0 > sK0 > $o ) > sK0 ) ).
thf(func_def_21,type,
sK9:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_22,type,
sK10:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_23,type,
sK11:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_24,type,
sK12:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_') ).
thf(f2,axiom,
! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_UNIV_') ).
thf(f3,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_INTER_') ).
thf(f5,conjecture,
! [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
= X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/INTER_UNIV_1') ).
thf(f6,negated_conjecture,
~ ! [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
= X1 ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ),
inference(rectify,[],[f3]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f12,plain,
? [X0: $tType,X1: X0 > $o] :
( ( 'const/sets/INTER' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
!= X1 ),
inference(ennf_transformation,[],[f6]) ).
thf(f13,plain,
( sK1
!= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).
thf(f14,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f15,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f18,plain,
( sK1
!= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f35,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $true )
| ( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= $false ) ),
inference(iff_proxy_clausification,[],[f16]) ).
thf(f36,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $false )
| ( $true
= ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
inference(iff_proxy_clausification,[],[f16]) ).
thf(f38,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $true ) ),
inference(and_proxy_clausification,[],[f36]) ).
thf(f39,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $false ) ),
inference(and_proxy_clausification,[],[f35]) ).
thf(f40,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
| ( ( X1 @ X2 )
= $false ) ),
inference(iff_proxy_clausification,[],[f14]) ).
thf(f41,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( ( X1 @ X2 )
= $true ) ),
inference(iff_proxy_clausification,[],[f14]) ).
thf(f42,plain,
( ( sK1 @ sK3 )
!= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK3 ) ),
inference(negative_extensionality,[],[f18]) ).
thf(f43,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f42]) ).
thf(f44,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ( $false
= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f42]) ).
thf(f46,definition,
( spl4_1
<=> ( $false
= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f47,plain,
( ( $false
!= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK3 ) )
| spl4_1 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f48,plain,
( ( $false
= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK3 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f50,definition,
( spl4_2
<=> ( $false
= ( sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f51,plain,
( ( $false
!= ( sK1 @ sK3 ) )
| spl4_2 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f52,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f53,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f44,f50,f46]) ).
thf(f55,definition,
( spl4_3
<=> ( $true
= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f57,plain,
( ( $true
= ( 'const/sets/INTER' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK3 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f59,definition,
( spl4_4
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f61,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f62,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f43,f59,f55]) ).
thf(f91,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true = $false )
| ( $true
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(constrained_superposition,[],[f41,f39]) ).
thf(f92,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f91]) ).
thf(f215,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true = $false )
| ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(constrained_superposition,[],[f40,f38]) ).
thf(f218,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f215]) ).
thf(f388,plain,
( ( $true = $false )
| ~ spl4_1
| ~ spl4_3 ),
inference(constrained_superposition,[],[f48,f57]) ).
thf(f398,plain,
( $false
| ~ spl4_1
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f388]) ).
thf(f399,plain,
( ~ spl4_1
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[],[f398]) ).
thf(f401,definition,
( spl4_6
<=> ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
thf(f403,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f401]) ).
thf(f405,definition,
( spl4_7
<=> ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ 'const/sets/UNIV' @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_7])],[avatar_definition]) ).
thf(f407,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ 'const/sets/UNIV' @ sK0 ) )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f405]) ).
thf(f549,plain,
( ( $true = $false )
| ~ spl4_2
| ~ spl4_4 ),
inference(forward_demodulation,[],[f61,f52]) ).
thf(f550,plain,
( $false
| ~ spl4_2
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f549]) ).
thf(f551,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f550]) ).
thf(f1295,plain,
( ( $false != $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| spl4_1 ),
inference(constrained_superposition,[],[f47,f218]) ).
thf(f1303,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| spl4_1 ),
inference(trivial_inequality_removal,[],[f1295]) ).
thf(f1375,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK3 ) )
| spl4_1 ),
inference(constrained_superposition,[],[f1303,f41]) ).
thf(f1400,plain,
( ( $true
= ( sK1 @ sK3 ) )
| spl4_1 ),
inference(trivial_inequality_removal,[],[f1375]) ).
thf(f1405,plain,
( ( $true = $false )
| spl4_1
| ~ spl4_2 ),
inference(forward_demodulation,[],[f1400,f52]) ).
thf(f1406,plain,
( $false
| spl4_1
| ~ spl4_2 ),
inference(trivial_inequality_removal,[],[f1405]) ).
thf(f1407,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f1406]) ).
thf(f1443,plain,
( ( $true = $false )
| ( $false
= ( sK1 @ sK3 ) )
| ~ spl4_6 ),
inference(constrained_superposition,[],[f403,f40]) ).
thf(f1464,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f1443]) ).
thf(f1472,plain,
( $false
| spl4_2
| ~ spl4_6 ),
inference(forward_subsumption_resolution,[],[f1464,f51]) ).
thf(f1473,plain,
( spl4_2
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f1472]) ).
thf(f1476,plain,
( ( $true = $false )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ 'const/sets/UNIV' @ sK0 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ~ spl4_1 ),
inference(constrained_superposition,[],[f48,f92]) ).
thf(f1487,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ 'const/sets/UNIV' @ sK0 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f1476]) ).
thf(f1493,plain,
( spl4_6
| spl4_7
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f1487,f46,f405,f401]) ).
thf(f1524,plain,
( ( $true = $false )
| ~ spl4_7 ),
inference(constrained_superposition,[],[f407,f15]) ).
thf(f1544,plain,
( $false
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f1524]) ).
thf(f1545,plain,
~ spl4_7,
inference(avatar_contradiction_clause,[],[f1544]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f53]) ).
cnf(s2,plain,
( spl4_3
| spl4_4 ),
inference(sat_conversion,[],[f62]) ).
cnf(s5,plain,
( ~ spl4_1
| ~ spl4_3 ),
inference(sat_conversion,[],[f399]) ).
cnf(s11,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(sat_conversion,[],[f551]) ).
cnf(s29,plain,
( spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f1407]) ).
cnf(s36,plain,
( spl4_2
| ~ spl4_6 ),
inference(sat_conversion,[],[f1473]) ).
cnf(s38,plain,
( ~ spl4_1
| spl4_6
| spl4_7 ),
inference(sat_conversion,[],[f1493]) ).
cnf(s40,plain,
~ spl4_7,
inference(sat_conversion,[],[f1545]) ).
cnf(s41,plain,
( ~ spl4_1
| spl4_6 ),
inference(rat,[],[s38,s40]) ).
cnf(s49,plain,
spl4_1,
inference(rat,[],[s1,s29]) ).
cnf(s50,plain,
spl4_6,
inference(rat,[],[s41,s49]) ).
cnf(s51,plain,
~ spl4_3,
inference(rat,[],[s5,s49]) ).
cnf(s52,plain,
spl4_2,
inference(rat,[],[s36,s50]) ).
cnf(s53,plain,
spl4_4,
inference(rat,[],[s2,s51]) ).
cnf(s54,plain,
$false,
inference(rat,[],[s11,s53,s52]) ).
thf(f1554,plain,
$false,
inference(avatar_sat_refutation,[],[s54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV453^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n009.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 15:48:30 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/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.91/0.37 % (4169381)Will run a generic schedule for satisfiability detection.
% 0.91/0.37 % (4169391)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=822994478:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.91/0.37 % (4169387)% WARNING: option uhcvi not known.
% 0.91/0.37 % (4169386)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3010706308_2999 on theBenchmark for (2999ds/0Mi)
% 0.91/0.37 % (4169388)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=908421633:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.91/0.37 % (4169387)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3182214922:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.91/0.37 % (4169389)dis+10_1_sil=32000:sp=arity:random_seed=572428340:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.91/0.37 % (4169390)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2960845935:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.91/0.37 % Exception at run slice level
% 0.91/0.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.91/0.37 % (4169387)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.91/0.37 % (4169392)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1033128615:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.91/0.37 % (4169390)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.91/0.37 % (4169387)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.91/0.37 % (4169400)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2890012908:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.91/0.37 % Exception at run slice level
% 0.91/0.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.91/0.37 % (4169391)Instruction limit reached!
% 0.91/0.37 % (4169391)------------------------------
% 0.91/0.37 % (4169391)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (4169391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (4169391)CaDiCaL version: 2.1.3
% 0.91/0.37 % (4169391)Termination reason: Instruction limit
% 0.91/0.37 % (4169391)Termination phase: Saturation
% 0.91/0.37 % (4169391)Time elapsed: 0.038 s
% 0.91/0.37 % (4169391)Peak memory usage: 12 MB
% 0.91/0.37 % (4169391)Instructions burned: 135 (million)
% 0.91/0.37 % (4169402)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1813327601:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.91/0.37 % (4169403)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1319534141:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.91/0.37 % (4169403)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.91/0.37 % (4169403)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.91/0.37 % (4169389)Instruction limit reached!
% 0.91/0.37 % (4169389)------------------------------
% 0.91/0.37 % (4169389)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (4169389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (4169389)CaDiCaL version: 2.1.3
% 0.91/0.37 % (4169389)Termination reason: Instruction limit
% 0.91/0.37 % (4169389)Termination phase: Saturation
% 0.91/0.37 % (4169389)Time elapsed: 0.054 s
% 0.91/0.37 % (4169389)Peak memory usage: 12 MB
% 0.91/0.37 % (4169389)Instructions burned: 103 (million)
% 0.91/0.37 % (4169390)Instruction limit reached!
% 0.91/0.37 % (4169390)------------------------------
% 0.91/0.37 % (4169390)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (4169390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (4169390)CaDiCaL version: 2.1.3
% 0.91/0.37 % (4169390)Termination reason: Instruction limit
% 0.91/0.37 % (4169390)Termination phase: Saturation
% 0.91/0.37 % (4169390)Time elapsed: 0.064 s
% 0.91/0.37 % (4169390)Peak memory usage: 12 MB
% 0.91/0.37 % (4169390)Instructions burned: 122 (million)
% 0.91/0.37 % (4169406)ott-21_1_sil=16000:fs=off:random_seed=4080617867:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.91/0.37 % (4169407)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2631030997:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.91/0.37 % (4169392)Instruction limit reached!
% 0.91/0.37 % (4169392)------------------------------
% 0.91/0.37 % (4169392)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.37 % (4169392)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.37 % (4169392)CaDiCaL version: 2.1.3
% 0.91/0.37 % (4169392)Termination reason: Instruction limit
% 0.91/0.37 % (4169392)Termination phase: Saturation
% 0.91/0.37 % (4169392)Time elapsed: 0.085 s
% 0.91/0.37 % (4169392)Peak memory usage: 13 MB
% 0.91/0.37 % (4169392)Instructions burned: 159 (million)
% 0.91/0.37 % (4169387) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4169381-4169387"...
% 0.91/0.37 % (4169387)...printing done.
% 0.91/0.37 % (4169410)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2677491145:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.91/0.37 % (4169387)Refutation found. Thanks to Tanya!
% 0.91/0.37 % SZS status Theorem for theBenchmark
% 0.91/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.91/0.38 % (4169387)------------------------------
% 0.91/0.38 % (4169387)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.91/0.38 % (4169387)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.91/0.38 % (4169387)CaDiCaL version: 2.1.3
% 0.91/0.38 % (4169387)Termination reason: Refutation
% 0.91/0.38 % (4169387)Time elapsed: 0.104 s
% 0.91/0.38 % (4169387)Peak memory usage: 13 MB
% 0.91/0.38 % (4169387)Instructions burned: 201 (million)
% 0.91/0.38 % (4169381)Success in time 0.144 s
% 0.91/0.38 % Vampire exiting
%------------------------------------------------------------------------------