%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO160^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 : n005.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:49:04 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 56 ( 7 unt; 0 typ; 5 def)
% Number of atoms : 296 ( 54 equ; 0 cnn)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 241 ( 60 ~; 66 |; 22 &; 76 @)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 15 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 35 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
cR: $i > $o ).
thf(func_def_4,type,
cQ: $i > $o ).
thf(func_def_5,type,
cP: $i > $o ).
thf(f1,conjecture,
( ( ! [X0: $i] :
( ( cQ @ X0 )
=> ( cR @ X0 ) )
& ! [X0: $i] :
( ( cP @ X0 )
=> ( cR @ X0 ) )
& ( ! [X0: $i] : ( cQ @ X0 )
| ! [X0: $i] : ( cP @ X0 ) ) )
=> ( ( cR @ c )
& ( cR @ b )
& ( cR @ a ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cDISJ_THIRD) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: $i] :
( ( cQ @ X0 )
=> ( cR @ X0 ) )
& ! [X0: $i] :
( ( cP @ X0 )
=> ( cR @ X0 ) )
& ( ! [X0: $i] : ( cQ @ X0 )
| ! [X0: $i] : ( cP @ X0 ) ) )
=> ( ( cR @ c )
& ( cR @ b )
& ( cR @ a ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: $i] :
( ( cQ @ X0 )
=> ( cR @ X0 ) )
& ! [X1: $i] :
( ( cP @ X1 )
=> ( cR @ X1 ) )
& ( ! [X2: $i] : ( cQ @ X2 )
| ! [X3: $i] : ( cP @ X3 ) ) )
=> ( ( cR @ c )
& ( cR @ b )
& ( cR @ a ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ! [X0: $i] :
( ( ( cQ @ X0 )
= $true )
=> ( ( cR @ X0 )
= $true ) )
& ! [X1: $i] :
( ( ( cP @ X1 )
= $true )
=> ( ( cR @ X1 )
= $true ) )
& ( ! [X2: $i] :
( ( cQ @ X2 )
= $true )
| ! [X3: $i] :
( ( cP @ X3 )
= $true ) ) )
=> ( ( ( cR @ c )
= $true )
& ( ( cR @ b )
= $true )
& ( ( cR @ a )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ( ( cR @ c )
!= $true )
| ( ( cR @ b )
!= $true )
| ( ( cR @ a )
!= $true ) )
& ! [X0: $i] :
( ( ( cR @ X0 )
= $true )
| ( ( cQ @ X0 )
!= $true ) )
& ! [X1: $i] :
( ( ( cR @ X1 )
= $true )
| ( ( cP @ X1 )
!= $true ) )
& ( ! [X2: $i] :
( ( cQ @ X2 )
= $true )
| ! [X3: $i] :
( ( cP @ X3 )
= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ( ( cR @ c )
!= $true )
| ( ( cR @ b )
!= $true )
| ( ( cR @ a )
!= $true ) )
& ! [X0: $i] :
( ( ( cR @ X0 )
= $true )
| ( ( cQ @ X0 )
!= $true ) )
& ! [X1: $i] :
( ( ( cR @ X1 )
= $true )
| ( ( cP @ X1 )
!= $true ) )
& ( ! [X2: $i] :
( ( cQ @ X2 )
= $true )
| ! [X3: $i] :
( ( cP @ X3 )
= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
! [X2: $i,X3: $i] :
( ( ( cQ @ X2 )
= $true )
| ( ( cP @ X3 )
= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f8,plain,
! [X1: $i] :
( ( ( cP @ X1 )
!= $true )
| ( ( cR @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f9,plain,
! [X0: $i] :
( ( ( cQ @ X0 )
!= $true )
| ( ( cR @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f10,plain,
( ( ( cR @ c )
!= $true )
| ( ( cR @ b )
!= $true )
| ( ( cR @ a )
!= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f14,definition,
( spl0_1
<=> ! [X3: $i] :
( ( cP @ X3 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f15,plain,
( ! [X3: $i] :
( ( cP @ X3 )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f14]) ).
thf(f17,definition,
( spl0_2
<=> ! [X2: $i] :
( ( cQ @ X2 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f18,plain,
( ! [X2: $i] :
( ( cQ @ X2 )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f19,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f7,f17,f14]) ).
thf(f21,definition,
( spl0_3
<=> ( ( cR @ a )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f23,plain,
( ( ( cR @ a )
!= $true )
| spl0_3 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f25,definition,
( spl0_4
<=> ( ( cR @ b )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
thf(f27,plain,
( ( ( cR @ b )
!= $true )
| spl0_4 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f29,definition,
( spl0_5
<=> ( ( cR @ c )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
thf(f31,plain,
( ( ( cR @ c )
!= $true )
| spl0_5 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f32,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f10,f29,f25,f21]) ).
thf(f33,plain,
( ! [X0: $i] :
( ( cR @ X0 )
= $true )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f9,f18]) ).
thf(f34,plain,
( ( $true != $true )
| ~ spl0_2
| spl0_5 ),
inference(constrained_superposition,[],[f31,f33]) ).
thf(f35,plain,
( $false
| ~ spl0_2
| spl0_5 ),
inference(trivial_inequality_removal,[],[f34]) ).
thf(f36,plain,
( ~ spl0_2
| spl0_5 ),
inference(avatar_contradiction_clause,[],[f35]) ).
thf(f37,plain,
( $false
| ~ spl0_2
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f23,f33]) ).
thf(f38,plain,
( ~ spl0_2
| spl0_3 ),
inference(avatar_contradiction_clause,[],[f37]) ).
thf(f39,plain,
( ! [X0: $i] :
( ( $true != $true )
| ( ( cR @ X0 )
= $true ) )
| ~ spl0_1 ),
inference(constrained_superposition,[],[f8,f15]) ).
thf(f40,plain,
( ! [X0: $i] :
( ( cR @ X0 )
= $true )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f41,plain,
( ( $true != $true )
| ~ spl0_1
| spl0_3 ),
inference(constrained_superposition,[],[f23,f40]) ).
thf(f42,plain,
( $false
| ~ spl0_1
| spl0_3 ),
inference(trivial_inequality_removal,[],[f41]) ).
thf(f43,plain,
( ~ spl0_1
| spl0_3 ),
inference(avatar_contradiction_clause,[],[f42]) ).
thf(f44,plain,
( ( $true != $true )
| ~ spl0_2
| spl0_4 ),
inference(constrained_superposition,[],[f27,f33]) ).
thf(f45,plain,
( $false
| ~ spl0_2
| spl0_4 ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f46,plain,
( ~ spl0_2
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f45]) ).
thf(f49,plain,
( ( $true != $true )
| ~ spl0_1
| spl0_5 ),
inference(constrained_superposition,[],[f31,f40]) ).
thf(f50,plain,
( $false
| ~ spl0_1
| spl0_5 ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f51,plain,
( ~ spl0_1
| spl0_5 ),
inference(avatar_contradiction_clause,[],[f50]) ).
thf(f52,plain,
( $false
| ~ spl0_1
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f27,f40]) ).
thf(f53,plain,
( ~ spl0_1
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f52]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f19]) ).
cnf(s2,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f32]) ).
cnf(s3,plain,
( ~ spl0_2
| spl0_5 ),
inference(sat_conversion,[],[f36]) ).
cnf(s4,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f38]) ).
cnf(s5,plain,
( ~ spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f43]) ).
cnf(s6,plain,
( ~ spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f46]) ).
cnf(s7,plain,
( ~ spl0_1
| spl0_5 ),
inference(sat_conversion,[],[f51]) ).
cnf(s8,plain,
( ~ spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f53]) ).
cnf(s9,plain,
~ spl0_2,
inference(rat,[],[s2,s3,s4,s6]) ).
cnf(s10,plain,
spl0_1,
inference(rat,[],[s1,s9]) ).
cnf(s11,plain,
spl0_4,
inference(rat,[],[s8,s10]) ).
cnf(s12,plain,
spl0_5,
inference(rat,[],[s7,s10]) ).
cnf(s13,plain,
spl0_3,
inference(rat,[],[s5,s10]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s2,s11,s12,s13]) ).
thf(f54,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO160^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.09/0.18 % Computer : n005.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 16:35:46 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.09/0.25 % (1887443)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (1887451)dis+10_1_sil=32000:sp=arity:random_seed=4278784409:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.25 % (1887451) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1887443-1887451"...
% 0.09/0.25 % (1887451)...printing done.
% 0.09/0.25 % (1887449)% WARNING: option uhcvi not known.
% 0.09/0.25 % (1887451)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (1887451)------------------------------
% 0.09/0.25 % (1887451)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (1887451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (1887451)CaDiCaL version: 2.1.3
% 0.09/0.25 % (1887451)Termination reason: Refutation
% 0.09/0.25 % (1887451)Time elapsed: 0.002 s
% 0.09/0.25 % (1887451)Peak memory usage: 12 MB
% 0.09/0.25 % (1887451)Instructions burned: 4 (million)
% 0.09/0.25 % (1887443)Success in time 0.025 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------