%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV196^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:39:08 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 24 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 186 ( 105 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 445 ( 50 ~; 48 |; 40 &; 297 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 11 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 123 ( 0 ^; 92 !; 31 ?; 123 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
y: a ).
thf(func_def_1,type,
x: a ).
thf(func_def_2,type,
cP: a > a > a ).
thf(func_def_3,type,
c0: a ).
thf(func_def_7,type,
sK0: a > a > a > $o ).
thf(func_def_8,type,
vNOT: $o > $o ).
thf(f1,conjecture,
! [X0: a > a > a > $o] :
( ( ! [X1: a,X2: a,X3: a] :
( ( ? [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( X0 @ X5 @ X7 @ X9 )
& ( X0 @ X4 @ X6 @ X8 )
& ( X3
= ( cP @ X8 @ X9 ) )
& ( X2
= ( cP @ X6 @ X7 ) )
& ( X1
= ( cP @ X4 @ X5 ) ) )
| ( ( X1 = X3 )
& ( X2 = c0 ) )
| ( ( X2 = X3 )
& ( X1 = c0 ) ) )
=> ( X0 @ X1 @ X2 @ X3 ) )
& $true )
=> ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cS_JOIN_LEM2_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a > a > $o] :
( ( ! [X1: a,X2: a,X3: a] :
( ( ? [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( X0 @ X5 @ X7 @ X9 )
& ( X0 @ X4 @ X6 @ X8 )
& ( X3
= ( cP @ X8 @ X9 ) )
& ( X2
= ( cP @ X6 @ X7 ) )
& ( X1
= ( cP @ X4 @ X5 ) ) )
| ( ( X1 = X3 )
& ( X2 = c0 ) )
| ( ( X2 = X3 )
& ( X1 = c0 ) ) )
=> ( X0 @ X1 @ X2 @ X3 ) )
& $true )
=> ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > a > a > $o] :
( ( ! [X1: a,X2: a,X3: a] :
( ( ? [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( X0 @ X5 @ X7 @ X9 )
& ( X0 @ X4 @ X6 @ X8 )
& ( X3
= ( cP @ X8 @ X9 ) )
& ( X2
= ( cP @ X6 @ X7 ) )
& ( X1
= ( cP @ X4 @ X5 ) ) )
| ( ( X1 = X3 )
& ( X2 = c0 ) )
| ( ( X2 = X3 )
& ( X1 = c0 ) ) )
=> ( X0 @ X1 @ X2 @ X3 ) )
& $true )
=> ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > a > a > $o] :
( ( ! [X1: a,X2: a,X3: a] :
( ( ? [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( ( X0 @ X5 @ X7 @ X9 )
= $true )
& ( ( X0 @ X4 @ X6 @ X8 )
= $true )
& ( ( cP @ X8 @ X9 )
= X3 )
& ( ( cP @ X6 @ X7 )
= X2 )
& ( ( cP @ X4 @ X5 )
= X1 ) )
| ( ( X1 = X3 )
& ( c0 = X2 ) )
| ( ( X2 = X3 )
& ( c0 = X1 ) ) )
=> ( ( X0 @ X1 @ X2 @ X3 )
= $true ) )
& $true )
=> ( ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) )
= $true ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X0: a > a > a > $o] :
( ! [X1: a,X2: a,X3: a] :
( ( ? [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( ( X0 @ X5 @ X7 @ X9 )
= $true )
& ( ( X0 @ X4 @ X6 @ X8 )
= $true )
& ( ( cP @ X8 @ X9 )
= X3 )
& ( ( cP @ X6 @ X7 )
= X2 )
& ( ( cP @ X4 @ X5 )
= X1 ) )
| ( ( X1 = X3 )
& ( c0 = X2 ) )
| ( ( X2 = X3 )
& ( c0 = X1 ) ) )
=> ( ( X0 @ X1 @ X2 @ X3 )
= $true ) )
=> ( ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) )
= $true ) ),
inference(true_and_false_elimination,[],[f4]) ).
thf(f6,plain,
? [X0: a > a > a > $o] :
( ( ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) )
!= $true )
& ! [X1: a,X2: a,X3: a] :
( ( ( X0 @ X1 @ X2 @ X3 )
= $true )
| ( ! [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( ( X0 @ X5 @ X7 @ X9 )
!= $true )
| ( ( X0 @ X4 @ X6 @ X8 )
!= $true )
| ( ( cP @ X8 @ X9 )
!= X3 )
| ( ( cP @ X6 @ X7 )
!= X2 )
| ( ( cP @ X4 @ X5 )
!= X1 ) )
& ( ( X1 != X3 )
| ( c0 != X2 ) )
& ( ( X2 != X3 )
| ( c0 != X1 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
( ( $true
!= ( sK0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) )
& ! [X1: a,X2: a,X3: a] :
( ( $true
= ( sK0 @ X1 @ X2 @ X3 ) )
| ( ! [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( $true
!= ( sK0 @ X5 @ X7 @ X9 ) )
| ( $true
!= ( sK0 @ X4 @ X6 @ X8 ) )
| ( ( cP @ X8 @ X9 )
!= X3 )
| ( ( cP @ X6 @ X7 )
!= X2 )
| ( ( cP @ X4 @ X5 )
!= X1 ) )
& ( ( X1 != X3 )
| ( c0 != X2 ) )
& ( ( X2 != X3 )
| ( c0 != X1 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f6]) ).
thf(f8,plain,
! [X2: a,X3: a,X1: a] :
( ( $true
= ( sK0 @ X1 @ X2 @ X3 ) )
| ( X2 != X3 )
| ( c0 != X1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
! [X2: a,X3: a,X1: a] :
( ( $true
= ( sK0 @ X1 @ X2 @ X3 ) )
| ( X1 != X3 )
| ( c0 != X2 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
! [X2: a,X3: a,X1: a,X8: a,X6: a,X9: a,X7: a,X4: a,X5: a] :
( ( $true
= ( sK0 @ X1 @ X2 @ X3 ) )
| ( $true
!= ( sK0 @ X5 @ X7 @ X9 ) )
| ( $true
!= ( sK0 @ X4 @ X6 @ X8 ) )
| ( ( cP @ X8 @ X9 )
!= X3 )
| ( ( cP @ X6 @ X7 )
!= X2 )
| ( ( cP @ X4 @ X5 )
!= X1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( $true
!= ( sK0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f14,plain,
! [X2: a,X1: a,X8: a,X6: a,X9: a,X7: a,X4: a,X5: a] :
( ( $true
= ( sK0 @ X1 @ X2 @ ( cP @ X8 @ X9 ) ) )
| ( $true
!= ( sK0 @ X5 @ X7 @ X9 ) )
| ( $true
!= ( sK0 @ X4 @ X6 @ X8 ) )
| ( ( cP @ X6 @ X7 )
!= X2 )
| ( ( cP @ X4 @ X5 )
!= X1 ) ),
inference(equality_resolution,[],[f10]) ).
thf(f15,plain,
! [X1: a,X8: a,X6: a,X9: a,X7: a,X4: a,X5: a] :
( ( $true
= ( sK0 @ X1 @ ( cP @ X6 @ X7 ) @ ( cP @ X8 @ X9 ) ) )
| ( $true
!= ( sK0 @ X5 @ X7 @ X9 ) )
| ( $true
!= ( sK0 @ X4 @ X6 @ X8 ) )
| ( ( cP @ X4 @ X5 )
!= X1 ) ),
inference(equality_resolution,[],[f14]) ).
thf(f16,plain,
! [X8: a,X6: a,X9: a,X7: a,X4: a,X5: a] :
( ( $true
!= ( sK0 @ X5 @ X7 @ X9 ) )
| ( $true
= ( sK0 @ ( cP @ X4 @ X5 ) @ ( cP @ X6 @ X7 ) @ ( cP @ X8 @ X9 ) ) )
| ( $true
!= ( sK0 @ X4 @ X6 @ X8 ) ) ),
inference(equality_resolution,[],[f15]) ).
thf(f17,plain,
! [X2: a,X3: a] :
( ( $true
= ( sK0 @ X3 @ X2 @ X3 ) )
| ( c0 != X2 ) ),
inference(equality_resolution,[],[f9]) ).
thf(f18,plain,
! [X3: a] :
( $true
= ( sK0 @ X3 @ c0 @ X3 ) ),
inference(equality_resolution,[],[f17]) ).
thf(f19,plain,
! [X3: a,X1: a] :
( ( $true
= ( sK0 @ X1 @ X3 @ X3 ) )
| ( c0 != X1 ) ),
inference(equality_resolution,[],[f8]) ).
thf(f20,plain,
! [X3: a] :
( $true
= ( sK0 @ c0 @ X3 @ X3 ) ),
inference(equality_resolution,[],[f19]) ).
thf(f31,plain,
! [X2: a,X3: a,X0: a,X1: a] :
( ( $true != $true )
| ( $true
= ( sK0 @ ( cP @ X1 @ c0 ) @ ( cP @ X2 @ X0 ) @ ( cP @ X3 @ X0 ) ) )
| ( $true
!= ( sK0 @ X1 @ X2 @ X3 ) ) ),
inference(constrained_superposition,[],[f16,f20]) ).
thf(f34,plain,
! [X2: a,X3: a,X0: a,X1: a] :
( ( $true
!= ( sK0 @ X1 @ X2 @ X3 ) )
| ( $true
= ( sK0 @ ( cP @ X1 @ c0 ) @ ( cP @ X2 @ X0 ) @ ( cP @ X3 @ X0 ) ) ) ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f40,plain,
! [X0: a,X1: a] :
( ( $true != $true )
| ( $true
= ( sK0 @ ( cP @ X0 @ c0 ) @ ( cP @ c0 @ X1 ) @ ( cP @ X0 @ X1 ) ) ) ),
inference(constrained_superposition,[],[f34,f18]) ).
thf(f46,plain,
! [X0: a,X1: a] :
( $true
= ( sK0 @ ( cP @ X0 @ c0 ) @ ( cP @ c0 @ X1 ) @ ( cP @ X0 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f40]) ).
thf(f62,plain,
$true != $true,
inference(constrained_superposition,[],[f11,f46]) ).
thf(f69,plain,
$false,
inference(trivial_inequality_removal,[],[f62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV196^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18 % Computer : n018.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 15:22:26 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/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.10/0.25 % (216013)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (216029)dis+10_1_sil=32000:sp=arity:random_seed=3320086348:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.25 % (216029) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-216013-216029"...
% 0.10/0.25 % (216027)% WARNING: option uhcvi not known.
% 0.10/0.25 % (216029)...printing done.
% 0.10/0.25 % (216029)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25 % (216029)------------------------------
% 0.10/0.25 % (216029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (216029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (216029)CaDiCaL version: 2.1.3
% 0.10/0.25 % (216029)Termination reason: Refutation
% 0.10/0.25 % (216029)Time elapsed: 0.003 s
% 0.10/0.25 % (216029)Peak memory usage: 12 MB
% 0.10/0.25 % (216029)Instructions burned: 8 (million)
% 0.10/0.25 % (216013)Success in time 0.031 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------