%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV017^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 : n026.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:38:52 AM UTC 2026
% Result : Theorem 0.08s 0.27s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 142 ( 59 equ; 0 cnn)
% Maximal formula atoms : 9 ( 8 avg)
% Number of connectives : 264 ( 26 ~; 18 |; 32 &; 168 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 81 ( 0 ^; 69 !; 12 ?; 81 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
sK0: a > a > $o ).
thf(func_def_4,type,
sK1: a ).
thf(func_def_5,type,
sK2: a ).
thf(func_def_6,type,
sK3: a ).
thf(f1,conjecture,
! [X0: a > a > $o] :
( ( ! [X1: a,X2: a,X3: a] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) )
& ! [X1: a,X2: a] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) )
& ! [X1: a] : ( X0 @ X1 @ X1 ) )
=> ! [X1: a,X2: a,X3: a] :
( ( X0 @ X1 @ X2 )
=> ( ( X0 @ X2 @ X3 )
=> ( X0 @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM514_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a > $o] :
( ( ! [X1: a,X2: a,X3: a] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) )
& ! [X1: a,X2: a] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) )
& ! [X1: a] : ( X0 @ X1 @ X1 ) )
=> ! [X1: a,X2: a,X3: a] :
( ( X0 @ X1 @ X2 )
=> ( ( X0 @ X2 @ X3 )
=> ( X0 @ X1 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > a > $o] :
( ( ! [X1: a,X2: a,X3: a] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) )
& ! [X4: a,X5: a] :
( ( X0 @ X4 @ X5 )
=> ( X0 @ X5 @ X4 ) )
& ! [X6: a] : ( X0 @ X6 @ X6 ) )
=> ! [X7: a,X8: a,X9: a] :
( ( X0 @ X7 @ X8 )
=> ( ( X0 @ X8 @ X9 )
=> ( X0 @ X7 @ X9 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > a > $o] :
( ( ! [X1: a,X2: a,X3: a] :
( ( ( ( X0 @ X2 @ X3 )
= $true )
& ( ( X0 @ X1 @ X2 )
= $true ) )
=> ( ( X0 @ X1 @ X3 )
= $true ) )
& ! [X4: a,X5: a] :
( ( ( X0 @ X4 @ X5 )
= $true )
=> ( ( X0 @ X5 @ X4 )
= $true ) )
& ! [X6: a] :
( ( X0 @ X6 @ X6 )
= $true ) )
=> ! [X7: a,X8: a,X9: a] :
( ( ( X0 @ X7 @ X8 )
= $true )
=> ( ( ( X0 @ X8 @ X9 )
= $true )
=> ( ( X0 @ X7 @ X9 )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a > a > $o] :
( ? [X7: a,X8: a,X9: a] :
( ( ( X0 @ X7 @ X9 )
!= $true )
& ( ( X0 @ X8 @ X9 )
= $true )
& ( ( X0 @ X7 @ X8 )
= $true ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( X0 @ X1 @ X3 )
= $true )
| ( ( X0 @ X2 @ X3 )
!= $true )
| ( ( X0 @ X1 @ X2 )
!= $true ) )
& ! [X4: a,X5: a] :
( ( ( X0 @ X5 @ X4 )
= $true )
| ( ( X0 @ X4 @ X5 )
!= $true ) )
& ! [X6: a] :
( ( X0 @ X6 @ X6 )
= $true ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a > a > $o] :
( ? [X7: a,X8: a,X9: a] :
( ( ( X0 @ X7 @ X9 )
!= $true )
& ( ( X0 @ X8 @ X9 )
= $true )
& ( ( X0 @ X7 @ X8 )
= $true ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( X0 @ X1 @ X3 )
= $true )
| ( ( X0 @ X2 @ X3 )
!= $true )
| ( ( X0 @ X1 @ X2 )
!= $true ) )
& ! [X4: a,X5: a] :
( ( ( X0 @ X5 @ X4 )
= $true )
| ( ( X0 @ X4 @ X5 )
!= $true ) )
& ! [X6: a] :
( ( X0 @ X6 @ X6 )
= $true ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
? [X0: a > a > $o] :
( ? [X1: a,X2: a,X3: a] :
( ( ( X0 @ X1 @ X3 )
!= $true )
& ( ( X0 @ X2 @ X3 )
= $true )
& ( ( X0 @ X1 @ X2 )
= $true ) )
& ! [X4: a,X5: a,X6: a] :
( ( $true
= ( X0 @ X4 @ X6 ) )
| ( $true
!= ( X0 @ X5 @ X6 ) )
| ( ( X0 @ X4 @ X5 )
!= $true ) )
& ! [X7: a,X8: a] :
( ( $true
= ( X0 @ X8 @ X7 ) )
| ( ( X0 @ X7 @ X8 )
!= $true ) )
& ! [X9: a] :
( $true
= ( X0 @ X9 @ X9 ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( $true
!= ( sK0 @ sK1 @ sK3 ) )
& ( $true
= ( sK0 @ sK2 @ sK3 ) )
& ( $true
= ( sK0 @ sK1 @ sK2 ) )
& ! [X4: a,X5: a,X6: a] :
( ( $true
= ( sK0 @ X4 @ X6 ) )
| ( $true
!= ( sK0 @ X5 @ X6 ) )
| ( $true
!= ( sK0 @ X4 @ X5 ) ) )
& ! [X7: a,X8: a] :
( ( $true
= ( sK0 @ X8 @ X7 ) )
| ( $true
!= ( sK0 @ X7 @ X8 ) ) )
& ! [X9: a] :
( $true
= ( sK0 @ X9 @ X9 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f7]) ).
thf(f11,plain,
! [X6: a,X4: a,X5: a] :
( ( $true
!= ( sK0 @ X5 @ X6 ) )
| ( $true
= ( sK0 @ X4 @ X6 ) )
| ( $true
!= ( sK0 @ X4 @ X5 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f12,plain,
( $true
= ( sK0 @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f13,plain,
( $true
= ( sK0 @ sK2 @ sK3 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f14,plain,
( $true
!= ( sK0 @ sK1 @ sK3 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f47,plain,
! [X0: a] :
( ( $true != $true )
| ( $true
= ( sK0 @ X0 @ sK3 ) )
| ( $true
!= ( sK0 @ X0 @ sK2 ) ) ),
inference(constrained_superposition,[],[f11,f13]) ).
thf(f52,plain,
! [X0: a] :
( ( $true
!= ( sK0 @ X0 @ sK2 ) )
| ( $true
= ( sK0 @ X0 @ sK3 ) ) ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f61,plain,
( ( $true != $true )
| ( $true
= ( sK0 @ sK1 @ sK3 ) ) ),
inference(constrained_superposition,[],[f52,f12]) ).
thf(f64,plain,
( $true
= ( sK0 @ sK1 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f66,plain,
$false,
inference(forward_subsumption_resolution,[],[f64,f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV017^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.08/0.19 % Computer : n026.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 15:03:28 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.08/0.27 % (710723)Will run a generic schedule for satisfiability detection.
% 0.08/0.27 % (710730)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=753372160:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.27 % (710730) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-710723-710730"...
% 0.08/0.27 % (710729)% WARNING: option uhcvi not known.
% 0.08/0.27 % (710730)...printing done.
% 0.08/0.27 % (710730)Refutation found. Thanks to Tanya!
% 0.08/0.27 % SZS status Theorem for theBenchmark
% 0.08/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.27 % (710730)------------------------------
% 0.08/0.27 % (710730)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.27 % (710730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.27 % (710730)CaDiCaL version: 2.1.3
% 0.08/0.27 % (710730)Termination reason: Refutation
% 0.08/0.27 % (710730)Time elapsed: 0.002 s
% 0.08/0.27 % (710730)Peak memory usage: 12 MB
% 0.08/0.27 % (710730)Instructions burned: 4 (million)
% 0.08/0.27 % (710723)Success in time 0.032 s
% 0.08/0.27 % Vampire exiting
%------------------------------------------------------------------------------