%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO149^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 : n018.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:03 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 131 ( 32 equ; 0 cnn)
% Maximal formula atoms : 8 ( 8 avg)
% Number of connectives : 118 ( 18 ~; 10 |; 14 &; 64 @)
% ( 0 <=>; 12 =>; 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 : 16 ( 0 ^; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
f: $i > $i ).
thf(func_def_2,type,
cP: $i > $o ).
thf(func_def_3,type,
cQ: $i > $o ).
thf(f1,conjecture,
( ( ( cP @ a )
& ! [X1: $i] :
( ( cQ @ X1 )
=> ( cP @ X1 ) )
& ! [X0: $i] :
( ( cP @ X0 )
=> ( cQ @ ( f @ X0 ) ) ) )
=> ( cP @ ( f @ a ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSIMPLEPQ) ).
thf(f2,negated_conjecture,
~ ( ( ( cP @ a )
& ! [X1: $i] :
( ( cQ @ X1 )
=> ( cP @ X1 ) )
& ! [X0: $i] :
( ( cP @ X0 )
=> ( cQ @ ( f @ X0 ) ) ) )
=> ( cP @ ( f @ a ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ( cP @ a )
& ! [X0: $i] :
( ( cQ @ X0 )
=> ( cP @ X0 ) )
& ! [X1: $i] :
( ( cP @ X1 )
=> ( cQ @ ( f @ X1 ) ) ) )
=> ( cP @ ( f @ a ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ( ( cP @ a )
= $true )
& ! [X0: $i] :
( ( ( cQ @ X0 )
= $true )
=> ( ( cP @ X0 )
= $true ) )
& ! [X1: $i] :
( ( ( cP @ X1 )
= $true )
=> ( ( cQ @ ( f @ X1 ) )
= $true ) ) )
=> ( ( cP @ ( f @ a ) )
= $true ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ( cP @ ( f @ a ) )
!= $true )
& ( ( cP @ a )
= $true )
& ! [X0: $i] :
( ( ( cP @ X0 )
= $true )
| ( ( cQ @ X0 )
!= $true ) )
& ! [X1: $i] :
( ( ( cQ @ ( f @ X1 ) )
= $true )
| ( ( cP @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ( cP @ ( f @ a ) )
!= $true )
& ( ( cP @ a )
= $true )
& ! [X0: $i] :
( ( ( cP @ X0 )
= $true )
| ( ( cQ @ X0 )
!= $true ) )
& ! [X1: $i] :
( ( ( cQ @ ( f @ X1 ) )
= $true )
| ( ( cP @ X1 )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
! [X1: $i] :
( ( ( cQ @ ( f @ X1 ) )
= $true )
| ( ( cP @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f8,plain,
! [X0: $i] :
( ( ( cQ @ X0 )
!= $true )
| ( ( cP @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f9,plain,
( ( cP @ a )
= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f10,plain,
( ( cP @ ( f @ a ) )
!= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f13,plain,
! [X0: $i] :
( ( $true != $true )
| ( $true
= ( cP @ ( f @ X0 ) ) )
| ( ( cP @ X0 )
!= $true ) ),
inference(constrained_superposition,[],[f8,f7]) ).
thf(f14,plain,
! [X0: $i] :
( ( $true
= ( cP @ ( f @ X0 ) ) )
| ( ( cP @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f13]) ).
thf(f15,plain,
( ( $true != $true )
| ( ( cP @ a )
!= $true ) ),
inference(constrained_superposition,[],[f10,f14]) ).
thf(f16,plain,
( ( cP @ a )
!= $true ),
inference(trivial_inequality_removal,[],[f15]) ).
thf(f17,plain,
$false,
inference(forward_subsumption_resolution,[],[f16,f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO149^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.08/0.19 % Computer : n018.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 16:37:42 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.19/0.27 % (306860)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (306869)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2635835380:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27 % (306869)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27 % (306869) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-306860-306869"...
% 0.19/0.27 % (306869)...printing done.
% 0.19/0.27 % (306869)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (306869)------------------------------
% 0.19/0.27 % (306869)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (306869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (306869)CaDiCaL version: 2.1.3
% 0.19/0.27 % (306869)Termination reason: Refutation
% 0.19/0.27 % (306869)Time elapsed: 0.001 s
% 0.19/0.27 % (306869)Peak memory usage: 12 MB
% 0.19/0.27 % (306869)Instructions burned: 1 (million)
% 0.19/0.27 % (306860)Success in time 0.034 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------