%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWX204+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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 : Tue Sep 29 01:46:43 PM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 37 unt; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 36 ( 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : proj1S(s(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_001) ).
fof(f2,axiom,
! [X0] : z != s(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).
fof(f3,axiom,
! [X0] : x2(z,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
fof(f4,axiom,
! [X0,X1] : x2(s(X1),X0) = s(x2(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_004) ).
fof(f5,axiom,
! [X0] : x22(z,X0) = z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_005) ).
fof(f6,axiom,
! [X0,X1] : x22(s(X1),X0) = x2(X0,x22(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).
fof(f7,conjecture,
? [X0] : x22(X0,X0) != X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_007) ).
fof(f8,negated_conjecture,
~ ? [X0] : x22(X0,X0) != X0,
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,plain,
! [X0] : x22(X0,X0) = X0,
inference(ennf_transformation,[],[f8]) ).
fof(f10,plain,
! [X0] : proj1S(s(X0)) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0] : s(X0) != z,
inference(cnf_transformation,[],[f2]) ).
fof(f12,plain,
! [X0] : x2(z,X0) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] : x2(s(X1),X0) = s(x2(X1,X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0] : z = x22(z,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f15,plain,
! [X0,X1] : x22(s(X1),X0) = x2(X0,x22(X1,X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f16,plain,
! [X0] : x22(X0,X0) = X0,
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
! [X0] : s(X0) = x2(s(z),X0),
inference(superposition,[],[f13,f12]) ).
fof(f18,plain,
! [X0,X1] : x2(X0,X1) = proj1S(x2(s(X0),X1)),
inference(superposition,[],[f10,f13]) ).
fof(f19,plain,
! [X0,X1] : z != x2(s(X0),X1),
inference(superposition,[],[f11,f13]) ).
fof(f21,plain,
! [X2,X0,X1] : x2(X2,x22(x2(X0,X1),X2)) = x22(x2(s(X0),X1),X2),
inference(superposition,[],[f15,f13]) ).
fof(f23,plain,
! [X0] : s(X0) = x2(s(X0),x22(X0,s(X0))),
inference(superposition,[],[f16,f15]) ).
fof(f30,plain,
! [X0] : x2(s(z),X0) = x2(x2(s(z),X0),x22(X0,x2(s(z),X0))),
inference(superposition,[],[f23,f17]) ).
fof(f55,plain,
! [X0] : proj1S(s(X0)) = x2(X0,x22(X0,s(X0))),
inference(superposition,[],[f18,f23]) ).
fof(f60,plain,
! [X0] : x2(X0,x22(X0,s(X0))) = X0,
inference(forward_demodulation,[],[f55,f10]) ).
fof(f62,plain,
! [X0] : x2(X0,x22(X0,x2(s(z),X0))) = X0,
inference(superposition,[],[f60,f17]) ).
fof(f73,plain,
! [X2,X0,X1] : x2(X1,x22(x2(X0,X2),X1)) = x22(x2(x2(s(z),X0),X2),X1),
inference(superposition,[],[f21,f17]) ).
fof(f129,plain,
s(z) = x2(s(z),x22(x22(s(z),x2(s(z),s(z))),s(z))),
inference(superposition,[],[f30,f62]) ).
fof(f136,plain,
s(z) = x2(s(z),x22(x2(x2(s(z),s(z)),x22(z,x2(s(z),s(z)))),s(z))),
inference(forward_demodulation,[],[f129,f15]) ).
fof(f140,plain,
s(z) = x2(s(z),x2(s(z),x22(x2(s(z),x22(z,x2(s(z),s(z)))),s(z)))),
inference(forward_demodulation,[],[f136,f73]) ).
fof(f142,plain,
s(z) = x2(s(z),x2(s(z),x2(s(z),x22(x2(z,x22(z,x2(s(z),s(z)))),s(z))))),
inference(forward_demodulation,[],[f140,f21]) ).
fof(f144,plain,
s(z) = x2(s(z),x2(s(z),x2(s(z),x22(x22(z,x2(s(z),s(z))),s(z))))),
inference(forward_demodulation,[],[f142,f12]) ).
fof(f146,plain,
s(z) = x2(s(z),x2(s(z),x2(s(z),x22(z,s(z))))),
inference(forward_demodulation,[],[f144,f14]) ).
fof(f148,plain,
s(z) = x2(s(z),x2(s(z),s(z))),
inference(forward_demodulation,[],[f146,f23]) ).
fof(f153,plain,
x2(z,x2(s(z),s(z))) = proj1S(s(z)),
inference(superposition,[],[f18,f148]) ).
fof(f157,plain,
z = x2(z,x2(s(z),s(z))),
inference(forward_demodulation,[],[f153,f10]) ).
fof(f162,plain,
z = x2(s(z),s(z)),
inference(forward_demodulation,[],[f157,f12]) ).
fof(f166,plain,
$false,
inference(forward_subsumption_resolution,[],[f162,f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX204+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n008.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 15:10:38 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.25 % (2323369)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (2323374)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=320057271_3000 on theBenchmark for (3000ds/0Mi)
% 0.08/0.25 % TRYING [1]
% 0.08/0.25 % TRYING [2]
% 0.08/0.25 % TRYING [3]
% 0.08/0.25 % TRYING [4]
% 0.08/0.25 % TRYING [5]
% 0.08/0.25 % (2323375)% WARNING: option uhcvi not known.
% 0.08/0.25 % TRYING [6]
% 0.08/0.25 % (2323375)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1453061022:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.08/0.25 % (2323376)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=403878211:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.08/0.25 % (2323377)dis+10_1_sil=32000:sp=arity:random_seed=762994579:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.08/0.25 % (2323378)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2498733171:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.08/0.25 % (2323379)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2274967298:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.08/0.25 % (2323380)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4003870889:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.08/0.25 % TRYING [7]
% 0.08/0.25 % (2323379) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2323369-2323379"...
% 0.08/0.25 % (2323379)...printing done.
% 0.08/0.25 % (2323379)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (2323379)------------------------------
% 0.08/0.25 % (2323379)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (2323379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (2323379)CaDiCaL version: 2.1.3
% 0.08/0.25 % (2323379)Termination reason: Refutation
% 0.08/0.25 % (2323379)Time elapsed: 0.006 s
% 0.08/0.25 % (2323379)Peak memory usage: 11 MB
% 0.08/0.25 % (2323379)Instructions burned: 8 (million)
% 0.08/0.25 % (2323369)Success in time 0.03 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------