%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM684^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:19:18 AM UTC 2026
% Result : Theorem 0.08s 0.19s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 20 ( 19 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 50 ( 6 ~; 3 |; 0 &; 40 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x: nat ).
thf(func_def_1,type,
y: nat ).
thf(func_def_2,type,
z: nat ).
thf(func_def_3,type,
pl: nat > nat > nat ).
thf(f1,axiom,
( ( pl @ z @ x )
= ( pl @ z @ y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i) ).
thf(f2,axiom,
! [X0: nat,X1: nat,X2: nat] :
( ( ( pl @ X0 @ X2 )
= ( pl @ X1 @ X2 ) )
=> ( X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20b) ).
thf(f3,axiom,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz6) ).
thf(f4,conjecture,
x = y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20e) ).
thf(f5,negated_conjecture,
x != y,
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
x != y,
inference(flattening,[],[f5]) ).
thf(f7,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( X0 = X1 )
| ( ( pl @ X0 @ X2 )
!= ( pl @ X1 @ X2 ) ) ),
inference(ennf_transformation,[],[f2]) ).
thf(f8,plain,
( ( pl @ z @ x )
= ( pl @ z @ y ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f9,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( pl @ X0 @ X2 )
!= ( pl @ X1 @ X2 ) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f3]) ).
thf(f11,plain,
x != y,
inference(cnf_transformation,[],[f6]) ).
thf(f15,plain,
( ( pl @ z @ x )
= ( pl @ y @ z ) ),
inference(constrained_superposition,[],[f8,f10]) ).
thf(f16,plain,
( ( pl @ y @ z )
= ( pl @ x @ z ) ),
inference(forward_demodulation,[],[f15,f10]) ).
thf(f29,plain,
! [X0: nat] :
( ( ( pl @ x @ z )
!= ( pl @ X0 @ z ) )
| ( y = X0 ) ),
inference(constrained_superposition,[],[f9,f16]) ).
thf(f142,plain,
x = y,
inference(equality_resolution,[],[f29]) ).
thf(f143,plain,
$false,
inference(forward_subsumption_resolution,[],[f142,f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM684^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.14 % Computer : n012.cluster.edu
% 0.08/0.14 % Model : x86_64 x86_64
% 0.08/0.14 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.14 % Memory : 8046.5625MB
% 0.08/0.14 % OS : Linux 6.8.0-71-generic
% 0.08/0.14 % CPULimit : 300
% 0.08/0.14 % WCLimit : 300
% 0.08/0.14 % DateTime : Tue Sep 29 12:37:19 UTC 2026
% 0.08/0.14 % CPUTime :
% 0.08/0.14 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 Running first-order model finding
% 0.08/0.17 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.19 % (43434)Will run a generic schedule for satisfiability detection.
% 0.08/0.19 % (43442)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2861382972:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.08/0.19 % (43441)% WARNING: option uhcvi not known.
% 0.08/0.19 % (43442) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-43434-43442"...
% 0.08/0.19 % (43442)...printing done.
% 0.08/0.19 % (43442)Refutation found. Thanks to Tanya!
% 0.08/0.19 % SZS status Theorem for theBenchmark
% 0.08/0.19 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.19 % (43442)------------------------------
% 0.08/0.19 % (43442)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.19 % (43442)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.19 % (43442)CaDiCaL version: 2.1.3
% 0.08/0.19 % (43442)Termination reason: Refutation
% 0.08/0.19 % (43442)Time elapsed: 0.003 s
% 0.08/0.19 % (43442)Peak memory usage: 12 MB
% 0.08/0.19 % (43442)Instructions burned: 7 (million)
% 0.08/0.19 % (43434)Success in time 0.017 s
% 0.08/0.19 % Vampire exiting
%------------------------------------------------------------------------------