%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN355^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 : n012.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.10s 0.17s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 178 ( 51 equ; 0 cnn)
% Maximal formula atoms : 6 ( 9 avg)
% Number of connectives : 144 ( 27 ~; 19 |; 17 &; 66 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 ^; 27 !; 3 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cQ: $i > $o ).
thf(func_def_1,type,
cP: $i > $o ).
thf(func_def_2,type,
cR: $i > $o ).
thf(f1,conjecture,
( ( ! [X0: $i] :
( ~ ( cQ @ X0 )
=> ( cR @ X0 ) )
& ! [X0: $i] :
( ( cR @ X0 )
=> ( cP @ X0 ) ) )
=> ! [X0: $i] :
( ( cQ @ X0 )
| ( cP @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2106) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: $i] :
( ~ ( cQ @ X0 )
=> ( cR @ X0 ) )
& ! [X0: $i] :
( ( cR @ X0 )
=> ( cP @ X0 ) ) )
=> ! [X0: $i] :
( ( cQ @ X0 )
| ( cP @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: $i] :
( ~ ( cQ @ X0 )
=> ( cR @ X0 ) )
& ! [X1: $i] :
( ( cR @ X1 )
=> ( cP @ X1 ) ) )
=> ! [X2: $i] :
( ( cQ @ X2 )
| ( cP @ X2 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ! [X0: $i] :
( ( ( cQ @ X0 )
!= $true )
=> ( ( cR @ X0 )
= $true ) )
& ! [X1: $i] :
( ( ( cR @ X1 )
= $true )
=> ( ( cP @ X1 )
= $true ) ) )
=> ! [X2: $i] :
( ( ( cQ @ X2 )
= $true )
| ( ( cP @ X2 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ( ( ! [X0: $i] :
( ( ( cQ @ X0 )
!= $true )
=> ( ( cR @ X0 )
= $true ) )
& ! [X1: $i] :
( ( ( cR @ X1 )
= $true )
=> ( ( cP @ X1 )
= $true ) ) )
=> ! [X2: $i] :
( ( ( cQ @ X2 )
= $true )
| ( ( cP @ X2 )
= $true ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ? [X2: $i] :
( ( ( cQ @ X2 )
!= $true )
& ( ( cP @ X2 )
!= $true ) )
& ! [X0: $i] :
( ( ( cR @ X0 )
= $true )
| ( ( cQ @ X0 )
= $true ) )
& ! [X1: $i] :
( ( ( cP @ X1 )
= $true )
| ( ( cR @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
( ? [X2: $i] :
( ( ( cQ @ X2 )
!= $true )
& ( ( cP @ X2 )
!= $true ) )
& ! [X0: $i] :
( ( ( cR @ X0 )
= $true )
| ( ( cQ @ X0 )
= $true ) )
& ! [X1: $i] :
( ( ( cP @ X1 )
= $true )
| ( ( cR @ X1 )
!= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
( ? [X0: $i] :
( ( ( cQ @ X0 )
!= $true )
& ( ( cP @ X0 )
!= $true ) )
& ! [X1: $i] :
( ( ( cR @ X1 )
= $true )
| ( $true
= ( cQ @ X1 ) ) )
& ! [X2: $i] :
( ( ( cP @ X2 )
= $true )
| ( $true
!= ( cR @ X2 ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f9,plain,
( ( $true
!= ( cQ @ sK0 ) )
& ( $true
!= ( cP @ sK0 ) )
& ! [X1: $i] :
( ( ( cR @ X1 )
= $true )
| ( $true
= ( cQ @ X1 ) ) )
& ! [X2: $i] :
( ( ( cP @ X2 )
= $true )
| ( $true
!= ( cR @ X2 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f8]) ).
thf(f10,plain,
! [X2: $i] :
( ( $true
!= ( cR @ X2 ) )
| ( ( cP @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f11,plain,
! [X1: $i] :
( ( ( cR @ X1 )
= $true )
| ( $true
= ( cQ @ X1 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f12,plain,
( $true
!= ( cP @ sK0 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f13,plain,
( $true
!= ( cQ @ sK0 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f16,plain,
! [X0: $i] :
( ( $true != $true )
| ( ( cP @ X0 )
= $true )
| ( ( cQ @ X0 )
= $true ) ),
inference(constrained_superposition,[],[f10,f11]) ).
thf(f17,plain,
! [X0: $i] :
( ( ( cP @ X0 )
= $true )
| ( ( cQ @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f16]) ).
thf(f18,plain,
( ( $true != $true )
| ( $true
= ( cQ @ sK0 ) ) ),
inference(constrained_superposition,[],[f12,f17]) ).
thf(f19,plain,
( $true
= ( cQ @ sK0 ) ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f20,plain,
$true != $true,
inference(constrained_superposition,[],[f13,f19]) ).
thf(f21,plain,
$false,
inference(trivial_inequality_removal,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN355^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 16:14:34 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.13 Running first-order model finding
% 0.10/0.13 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.10/0.17 % (306004)Will run a generic schedule for satisfiability detection.
% 0.10/0.17 % (306016)% WARNING: option uhcvi not known.
% 0.10/0.17 % (306015)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=262845716_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.17 % (306019)dis+10_1_sil=32000:sp=arity:random_seed=2741510761:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.17 % (306022)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4218911345:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.17 % (306016)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1148548605:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.17 % (306017)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1922018610:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.17 % (306021)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=157850782:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.17 % Exception at run slice level
% 0.10/0.17 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.10/0.17 % (306020)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=929802253:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.17 % (306016)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.17 % (306016)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.10/0.17 % (306020)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.17 % (306019) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-306004-306019"...
% 0.10/0.17 % (306022) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-306004-306022"...
% 0.10/0.17 % (306021) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-306004-306021"...
% 0.10/0.17 % (306020) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-306004-306020"...
% 0.10/0.17 % (306016) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-306004-306016"...
% 0.10/0.17 % (306017) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-306004-306017"...
% 0.10/0.17 % (306022)...printing done.
% 0.10/0.17 % (306019)...printing done.
% 0.10/0.17 % (306021)...printing done.
% 0.10/0.17 % (306020)...printing done.
% 0.10/0.17 % (306016)...printing done.
% 0.10/0.17 % (306017)...printing done.
% 0.10/0.17 % (306022)Refutation found. Thanks to Tanya!
% 0.10/0.17 % SZS status Theorem for theBenchmark
% 0.10/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.17 % (306022)------------------------------
% 0.10/0.17 % (306022)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.17 % (306022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.17 % (306022)CaDiCaL version: 2.1.3
% 0.10/0.17 % (306022)Termination reason: Refutation
% 0.10/0.17 % (306022)Time elapsed: 0.001 s
% 0.10/0.17 % (306022)Peak memory usage: 12 MB
% 0.10/0.17 % (306022)Instructions burned: 1 (million)
% 0.10/0.17 % (306004)Success in time 0.037 s
% 0.10/0.17 % Vampire exiting
%------------------------------------------------------------------------------