%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWX190+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:40 PM UTC 2026
% Result : Theorem 0.21s 0.34s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 26 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 36 ( 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1,X2] : n(X0) != x(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_008) ).
fof(f39,axiom,
! [X0] : d(n(X0)) = n(z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_039) ).
fof(f40,axiom,
! [X0,X1] : d(x(X0,X1)) = x(d(X0),d(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_040) ).
fof(f41,axiom,
! [X0,X1] : d(y(X0,X1)) = x(y(d(X0),X1),y(X0,d(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_041) ).
fof(f50,axiom,
! [X0] : opt(x(n(z),X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_050) ).
fof(f53,axiom,
! [X0] : opt(y(n(z),X0)) = n(z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_053) ).
fof(f54,conjecture,
? [X0] : opt(d(X0)) != opt(d(opt(X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_054) ).
fof(f55,negated_conjecture,
~ ? [X0] : opt(d(X0)) != opt(d(opt(X0))),
inference(negated_conjecture,[status(cth)],[f54]) ).
fof(f73,plain,
! [X0] : opt(d(X0)) = opt(d(opt(X0))),
inference(ennf_transformation,[],[f55]) ).
fof(f81,plain,
! [X2,X0,X1] : n(X0) != x(X1,X2),
inference(cnf_transformation,[],[f8]) ).
fof(f112,plain,
! [X0] : n(z) = d(n(X0)),
inference(cnf_transformation,[],[f39]) ).
fof(f113,plain,
! [X0,X1] : d(x(X0,X1)) = x(d(X0),d(X1)),
inference(cnf_transformation,[],[f40]) ).
fof(f114,plain,
! [X0,X1] : d(y(X0,X1)) = x(y(d(X0),X1),y(X0,d(X1))),
inference(cnf_transformation,[],[f41]) ).
fof(f123,plain,
! [X0] : opt(x(n(z),X0)) = X0,
inference(cnf_transformation,[],[f50]) ).
fof(f126,plain,
! [X0] : n(z) = opt(y(n(z),X0)),
inference(cnf_transformation,[],[f53]) ).
fof(f127,plain,
! [X0] : opt(d(X0)) = opt(d(opt(X0))),
inference(cnf_transformation,[],[f73]) ).
fof(f646,plain,
! [X2,X0,X1] : x(X1,X2) != d(n(X0)),
inference(superposition,[],[f81,f112]) ).
fof(f1105,plain,
! [X0,X1] : opt(x(d(n(X0)),X1)) = X1,
inference(superposition,[],[f123,f112]) ).
fof(f1106,plain,
! [X0] : opt(d(X0)) = opt(d(x(n(z),X0))),
inference(superposition,[],[f127,f123]) ).
fof(f1149,plain,
! [X0] : opt(d(X0)) = opt(x(d(n(z)),d(X0))),
inference(forward_demodulation,[],[f1106,f113]) ).
fof(f1171,plain,
! [X0] : d(X0) = opt(d(X0)),
inference(forward_demodulation,[],[f1149,f1105]) ).
fof(f1763,plain,
! [X0] : opt(d(y(n(z),X0))) = opt(d(n(z))),
inference(superposition,[],[f127,f126]) ).
fof(f1806,plain,
! [X0] : d(n(z)) = opt(d(y(n(z),X0))),
inference(forward_demodulation,[],[f1763,f1171]) ).
fof(f1828,plain,
! [X0] : d(n(z)) = d(y(n(z),X0)),
inference(forward_demodulation,[],[f1806,f1171]) ).
fof(f1850,plain,
! [X0] : d(n(z)) = x(y(d(n(z)),X0),y(n(z),d(X0))),
inference(forward_demodulation,[],[f1828,f114]) ).
fof(f1872,plain,
$false,
inference(forward_subsumption_resolution,[],[f1850,f646]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX190+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n006.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 15:06:25 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/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.21/0.34 % (4038201)Will run a generic schedule for satisfiability detection.
% 0.21/0.34 % (4038209)dis+10_1_sil=32000:sp=arity:random_seed=3893823642:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.34 % (4038207)% WARNING: option uhcvi not known.
% 0.21/0.34 % (4038206)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=568401516_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.34 % (4038212)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1900925764:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.34 % (4038207)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4227436990:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.34 % (4038210)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1283813417:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.34 % (4038211)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2272644274:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.34 % TRYING [1]
% 0.21/0.34 % TRYING [2]
% 0.21/0.34 % TRYING [3]
% 0.21/0.34 % (4038208)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2275430219:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.34 % TRYING [4]
% 0.21/0.34 % (4038209)Instruction limit reached!
% 0.21/0.34 % (4038209)------------------------------
% 0.21/0.34 % (4038209)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4038209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4038209)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4038209)Termination reason: Instruction limit
% 0.21/0.34 % (4038209)Termination phase: Saturation
% 0.21/0.34 % (4038209)Time elapsed: 0.029 s
% 0.21/0.34 % (4038209)Peak memory usage: 12 MB
% 0.21/0.34 % (4038209)Instructions burned: 105 (million)
% 0.21/0.34 % (4038220)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=832579421:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.21/0.34 % TRYING [1]
% 0.21/0.34 % TRYING [2]
% 0.21/0.34 % TRYING [3]
% 0.21/0.34 % TRYING [4]
% 0.21/0.34 % TRYING [5]
% 0.21/0.34 % (4038211) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4038201-4038211"...
% 0.21/0.34 % (4038211)...printing done.
% 0.21/0.34 % (4038211)Refutation found. Thanks to Tanya!
% 0.21/0.34 % SZS status Theorem for theBenchmark
% 0.21/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.34 % (4038211)------------------------------
% 0.21/0.34 % (4038211)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4038211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4038211)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4038211)Termination reason: Refutation
% 0.21/0.34 % (4038211)Time elapsed: 0.048 s
% 0.21/0.34 % (4038211)Peak memory usage: 12 MB
% 0.21/0.34 % (4038211)Instructions burned: 103 (million)
% 0.21/0.34 % (4038201)Success in time 0.097 s
% 0.21/0.34 % Vampire exiting
%------------------------------------------------------------------------------