%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN356^5 : 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 : n001.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:41:50 AM UTC 2026
% Result : Theorem 0.07s 0.24s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 12 unt; 0 typ; 2 def)
% Number of atoms : 260 ( 51 equ; 0 cnn)
% Maximal formula atoms : 14 ( 7 avg)
% Number of connectives : 223 ( 26 ~; 19 |; 24 &; 140 @)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
cQ: $i > $i > $o ).
thf(func_def_3,type,
cR: $i > $i > $o ).
thf(f1,conjecture,
( ( ! [X2: $i,X3: $i] :
( ( cQ @ X2 @ X3 )
=> ( cQ @ X2 @ X2 ) )
& ! [X0: $i,X1: $i] :
( ( cR @ X0 @ X1 )
=> ( ( cQ @ X0 @ X1 )
& ( cR @ X1 @ X0 ) ) )
& ( cR @ cA @ cB ) )
=> ( ( cQ @ cB @ cB )
& ( cQ @ cA @ cA ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cLX2107) ).
thf(f2,negated_conjecture,
~ ( ( ! [X2: $i,X3: $i] :
( ( cQ @ X2 @ X3 )
=> ( cQ @ X2 @ X2 ) )
& ! [X0: $i,X1: $i] :
( ( cR @ X0 @ X1 )
=> ( ( cQ @ X0 @ X1 )
& ( cR @ X1 @ X0 ) ) )
& ( cR @ cA @ cB ) )
=> ( ( cQ @ cB @ cB )
& ( cQ @ cA @ cA ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: $i,X1: $i] :
( ( cQ @ X0 @ X1 )
=> ( cQ @ X0 @ X0 ) )
& ! [X2: $i,X3: $i] :
( ( cR @ X2 @ X3 )
=> ( ( cQ @ X2 @ X3 )
& ( cR @ X3 @ X2 ) ) )
& ( cR @ cA @ cB ) )
=> ( ( cQ @ cB @ cB )
& ( cQ @ cA @ cA ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ! [X0: $i,X1: $i] :
( ( ( cQ @ X0 @ X1 )
= $true )
=> ( ( cQ @ X0 @ X0 )
= $true ) )
& ! [X2: $i,X3: $i] :
( ( ( cR @ X2 @ X3 )
= $true )
=> ( ( ( cQ @ X2 @ X3 )
= $true )
& ( ( cR @ X3 @ X2 )
= $true ) ) )
& ( ( cR @ cA @ cB )
= $true ) )
=> ( ( ( cQ @ cB @ cB )
= $true )
& ( ( cQ @ cA @ cA )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ( ( cQ @ cB @ cB )
!= $true )
| ( ( cQ @ cA @ cA )
!= $true ) )
& ! [X0: $i,X1: $i] :
( ( ( cQ @ X0 @ X0 )
= $true )
| ( ( cQ @ X0 @ X1 )
!= $true ) )
& ! [X2: $i,X3: $i] :
( ( ( ( cQ @ X2 @ X3 )
= $true )
& ( ( cR @ X3 @ X2 )
= $true ) )
| ( ( cR @ X2 @ X3 )
!= $true ) )
& ( ( cR @ cA @ cB )
= $true ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ( ( cQ @ cB @ cB )
!= $true )
| ( ( cQ @ cA @ cA )
!= $true ) )
& ! [X0: $i,X1: $i] :
( ( ( cQ @ X0 @ X0 )
= $true )
| ( ( cQ @ X0 @ X1 )
!= $true ) )
& ! [X2: $i,X3: $i] :
( ( ( ( cQ @ X2 @ X3 )
= $true )
& ( ( cR @ X3 @ X2 )
= $true ) )
| ( ( cR @ X2 @ X3 )
!= $true ) )
& ( ( cR @ cA @ cB )
= $true ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ( cR @ cA @ cB )
= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f8,plain,
! [X2: $i,X3: $i] :
( ( ( cR @ X2 @ X3 )
!= $true )
| ( ( cR @ X3 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f9,plain,
! [X2: $i,X3: $i] :
( ( ( cR @ X2 @ X3 )
!= $true )
| ( ( cQ @ X2 @ X3 )
= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f10,plain,
! [X0: $i,X1: $i] :
( ( ( cQ @ X0 @ X1 )
!= $true )
| ( ( cQ @ X0 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f11,plain,
( ( ( cQ @ cB @ cB )
!= $true )
| ( ( cQ @ cA @ cA )
!= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f15,definition,
( spl0_1
<=> ( ( cQ @ cA @ cA )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f19,definition,
( spl0_2
<=> ( ( cQ @ cB @ cB )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f21,plain,
( ( ( cQ @ cB @ cB )
!= $true )
| spl0_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f22,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f11,f19,f15]) ).
thf(f23,plain,
( ( $true != $true )
| ( $true
= ( cR @ cB @ cA ) ) ),
inference(constrained_superposition,[],[f8,f7]) ).
thf(f24,plain,
( $true
= ( cR @ cB @ cA ) ),
inference(trivial_inequality_removal,[],[f23]) ).
thf(f25,plain,
( ( $true != $true )
| ( $true
= ( cQ @ cA @ cB ) ) ),
inference(constrained_superposition,[],[f9,f7]) ).
thf(f26,plain,
( $true
= ( cQ @ cA @ cB ) ),
inference(trivial_inequality_removal,[],[f25]) ).
thf(f27,plain,
( ( $true != $true )
| ( $true
= ( cQ @ cB @ cA ) ) ),
inference(constrained_superposition,[],[f9,f24]) ).
thf(f30,plain,
( $true
= ( cQ @ cB @ cA ) ),
inference(trivial_inequality_removal,[],[f27]) ).
thf(f31,plain,
( ( $true != $true )
| ( ( cQ @ cA @ cA )
= $true ) ),
inference(constrained_superposition,[],[f10,f26]) ).
thf(f32,plain,
( ( cQ @ cA @ cA )
= $true ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f35,plain,
spl0_1,
inference(avatar_split_clause,[],[f32,f15]) ).
thf(f36,plain,
( ( $true != $true )
| ( ( cQ @ cB @ cB )
= $true ) ),
inference(constrained_superposition,[],[f10,f30]) ).
thf(f37,plain,
( ( cQ @ cB @ cB )
= $true ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f38,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f37,f21]) ).
thf(f39,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f38]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f22]) ).
cnf(s3,plain,
spl0_1,
inference(sat_conversion,[],[f35]) ).
cnf(s4,plain,
spl0_2,
inference(sat_conversion,[],[f39]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s4,s3]) ).
thf(f40,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN356^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.16 % Computer : n001.cluster.edu
% 0.07/0.16 % Model : x86_64 x86_64
% 0.07/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.16 % Memory : 8046.5625MB
% 0.07/0.16 % OS : Linux 6.8.0-71-generic
% 0.07/0.16 % CPULimit : 300
% 0.07/0.16 % WCLimit : 300
% 0.07/0.16 % DateTime : Tue Sep 29 16:20:51 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20 Running first-order model finding
% 0.07/0.20 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.24 % (1442814)Will run a generic schedule for satisfiability detection.
% 0.07/0.24 % (1442821)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=754044476_3000 on theBenchmark for (3000ds/0Mi)
% 0.07/0.24 % Exception at run slice level
% 0.07/0.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.07/0.24 % (1442822)% WARNING: option uhcvi not known.
% 0.07/0.24 % (1442822)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1139475217:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.07/0.24 % (1442823)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3187893723:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.07/0.24 % (1442824)dis+10_1_sil=32000:sp=arity:random_seed=523265848:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.07/0.24 % (1442825)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=453170174:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.07/0.24 % (1442826)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2483108457:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.07/0.24 % (1442822)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.24 % (1442827)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1593773999:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.07/0.24 % (1442822)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.07/0.24 % (1442825)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.24 % (1442824) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1442814-1442824"...
% 0.07/0.24 % (1442826) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1442814-1442826"...
% 0.07/0.24 % (1442827) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1442814-1442827"...
% 0.07/0.24 % (1442823) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1442814-1442823"...
% 0.07/0.24 % (1442825) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1442814-1442825"...
% 0.07/0.24 % (1442822) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1442814-1442822"...
% 0.07/0.24 % (1442824)...printing done.
% 0.07/0.24 % (1442826)...printing done.
% 0.07/0.24 % (1442827)...printing done.
% 0.07/0.24 % (1442823)...printing done.
% 0.07/0.24 % (1442822)...printing done.
% 0.07/0.24 % (1442825)...printing done.
% 0.07/0.24 % (1442824)Refutation found. Thanks to Tanya!
% 0.07/0.24 % SZS status Theorem for theBenchmark
% 0.07/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.24 % (1442824)------------------------------
% 0.07/0.24 % (1442824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24 % (1442824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24 % (1442824)CaDiCaL version: 2.1.3
% 0.07/0.24 % (1442824)Termination reason: Refutation
% 0.07/0.24 % (1442824)Time elapsed: 0.003 s
% 0.07/0.24 % (1442824)Peak memory usage: 12 MB
% 0.07/0.24 % (1442824)Instructions burned: 3 (million)
% 0.07/0.24 % (1442814)Success in time 0.026 s
% 0.07/0.24 % Vampire exiting
%------------------------------------------------------------------------------