%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : HWC001-1 : TPTP v9.3.1. Bugfixed v1.1.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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 10:19:22 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 36 unt; 0 def)
% Number of atoms : 52 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : nand(X0,X1) = not(and(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nand_definition) ).
fof(f2,axiom,
! [X0] : and(X0,n0) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_definition1) ).
fof(f3,plain,
! [X0] : n0 = and(X0,n0),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X0] : and(X0,n1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_definition2) ).
fof(f5,axiom,
not(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_definition1) ).
fof(f6,plain,
n1 = not(n0),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
not(n1) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_definition2) ).
fof(f8,plain,
n0 = not(n1),
inference(reorient_equations,[],[f7]) ).
fof(f9,negated_conjecture,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ output(X0,X1,X2,X3)
| ~ output(X4,X5,X6,X7)
| output(nand(X0,X4),nand(X1,X5),nand(X2,X6),nand(X3,X7)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nand_table_definition) ).
fof(f10,negated_conjecture,
output(n0,n0,n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',input1) ).
fof(f11,negated_conjecture,
output(n0,n1,n0,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',input2) ).
fof(f12,negated_conjecture,
~ output(n0,n1,n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cannot_make_or) ).
fof(f13,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ output(X0,X1,X2,X3)
| ~ output(X4,X5,X6,X7)
| output(not(and(X0,X4)),not(and(X1,X5)),not(and(X2,X6)),not(and(X3,X7))) ),
inference(definition_unfolding,[],[f9,f1,f1,f1,f1]) ).
fof(f14,plain,
! [X0] : and(X0,not(n0)) = X0,
inference(forward_demodulation,[],[f4,f6]) ).
fof(f15,plain,
! [X2,X3,X0,X1] :
( ~ output(X0,X1,X2,X3)
| output(not(and(n0,X0)),not(and(n0,X1)),not(and(n1,X2)),not(and(n1,X3))) ),
inference(resolution,[],[f13,f10]) ).
fof(f16,plain,
! [X2,X3,X0,X1] :
( ~ output(X0,X1,X2,X3)
| output(not(and(n0,X0)),not(and(n1,X1)),not(and(n0,X2)),not(and(n1,X3))) ),
inference(resolution,[],[f13,f11]) ).
fof(f17,plain,
! [X2,X3,X0,X1] :
( ~ output(X0,X1,X2,X3)
| output(not(and(n0,X0)),not(and(not(n0),X1)),not(and(n0,X2)),not(and(not(n0),X3))) ),
inference(forward_demodulation,[],[f16,f6]) ).
fof(f18,plain,
! [X2,X3,X0,X1] :
( ~ output(X0,X1,X2,X3)
| output(not(and(n0,X0)),not(and(n0,X1)),not(and(not(n0),X2)),not(and(not(n0),X3))) ),
inference(forward_demodulation,[],[f15,f6]) ).
fof(f29,plain,
~ output(n0,not(n0),not(n0),not(n0)),
inference(superposition,[],[f12,f6]) ).
fof(f31,plain,
output(n0,n0,not(n0),not(n0)),
inference(superposition,[],[f10,f6]) ).
fof(f36,plain,
n0 = not(not(n0)),
inference(superposition,[],[f8,f6]) ).
fof(f37,plain,
output(not(and(n0,n0)),not(and(not(n0),n0)),not(and(n0,not(n0))),not(and(not(n0),not(n0)))),
inference(resolution,[],[f31,f17]) ).
fof(f39,plain,
output(not(and(n0,n0)),not(and(not(n0),n0)),not(and(n0,not(n0))),not(not(n0))),
inference(forward_demodulation,[],[f37,f14]) ).
fof(f40,plain,
output(not(and(n0,n0)),not(and(not(n0),n0)),not(and(n0,not(n0))),n0),
inference(forward_demodulation,[],[f39,f36]) ).
fof(f41,plain,
output(not(and(n0,n0)),not(and(not(n0),n0)),not(n0),n0),
inference(forward_demodulation,[],[f40,f14]) ).
fof(f42,plain,
output(not(and(n0,n0)),not(n0),not(n0),n0),
inference(forward_demodulation,[],[f41,f3]) ).
fof(f43,plain,
output(not(n0),not(n0),not(n0),n0),
inference(forward_demodulation,[],[f42,f3]) ).
fof(f44,plain,
output(not(and(n0,not(n0))),not(and(not(n0),not(n0))),not(and(n0,not(n0))),not(and(not(n0),n0))),
inference(resolution,[],[f43,f17]) ).
fof(f46,plain,
output(not(and(n0,not(n0))),not(and(not(n0),not(n0))),not(and(n0,not(n0))),not(n0)),
inference(forward_demodulation,[],[f44,f3]) ).
fof(f47,plain,
output(not(n0),not(and(not(n0),not(n0))),not(n0),not(n0)),
inference(forward_demodulation,[],[f46,f14]) ).
fof(f48,plain,
output(not(n0),not(not(n0)),not(n0),not(n0)),
inference(forward_demodulation,[],[f47,f14]) ).
fof(f49,plain,
output(not(n0),n0,not(n0),not(n0)),
inference(forward_demodulation,[],[f48,f36]) ).
fof(f53,plain,
output(not(and(n0,n0)),not(and(n0,n0)),not(and(not(n0),not(n0))),not(and(not(n0),not(n0)))),
inference(resolution,[],[f18,f31]) ).
fof(f56,plain,
output(not(and(n0,n0)),not(and(n0,n0)),not(not(n0)),not(not(n0))),
inference(forward_demodulation,[],[f53,f14]) ).
fof(f61,plain,
output(not(and(n0,n0)),not(and(n0,n0)),n0,n0),
inference(forward_demodulation,[],[f56,f36]) ).
fof(f66,plain,
output(not(n0),not(n0),n0,n0),
inference(forward_demodulation,[],[f61,f3]) ).
fof(f79,plain,
! [X2,X3,X0,X1] :
( ~ output(X0,X1,X2,X3)
| output(not(and(not(n0),X0)),not(and(not(n0),X1)),not(and(n0,X2)),not(and(n0,X3))) ),
inference(resolution,[],[f66,f13]) ).
fof(f167,plain,
output(not(and(not(n0),not(n0))),not(and(not(n0),n0)),not(and(n0,not(n0))),not(and(n0,not(n0)))),
inference(resolution,[],[f79,f49]) ).
fof(f170,plain,
output(not(and(not(n0),not(n0))),not(and(not(n0),n0)),not(n0),not(n0)),
inference(forward_demodulation,[],[f167,f14]) ).
fof(f182,plain,
output(not(and(not(n0),not(n0))),not(n0),not(n0),not(n0)),
inference(forward_demodulation,[],[f170,f3]) ).
fof(f194,plain,
output(not(not(n0)),not(n0),not(n0),not(n0)),
inference(forward_demodulation,[],[f182,f14]) ).
fof(f205,plain,
output(n0,not(n0),not(n0),not(n0)),
inference(forward_demodulation,[],[f194,f36]) ).
fof(f213,plain,
$false,
inference(forward_subsumption_resolution,[],[f205,f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWC001-1 : TPTP v9.3.1. Bugfixed v1.1.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n001.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 10:57:16 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.17/0.47 % (3383227)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (3383232)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2703816797_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % TRYING [1]
% 0.17/0.47 % TRYING [2]
% 0.17/0.47 % TRYING [3]
% 0.17/0.47 % (3383233)% WARNING: option uhcvi not known.
% 0.17/0.47 % (3383233)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3197766831:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (3383234)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2121322501:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (3383235)dis+10_1_sil=32000:sp=arity:random_seed=4023295851:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (3383237)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4201881457:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (3383236)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1523314930:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (3383238)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=319145456:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % TRYING [4]
% 0.17/0.47 % (3383237) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3383227-3383237"...
% 0.17/0.47 % (3383233) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3383227-3383233"...
% 0.17/0.47 % (3383235) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3383227-3383235"...
% 0.17/0.47 % (3383237)...printing done.
% 0.17/0.47 % (3383237)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (3383237)------------------------------
% 0.17/0.47 % (3383237)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (3383237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (3383237)CaDiCaL version: 2.1.3
% 0.17/0.47 % (3383237)Termination reason: Refutation
% 0.17/0.47 % (3383237)Time elapsed: 0.004 s
% 0.17/0.47 % (3383237)Peak memory usage: 11 MB
% 0.17/0.47 % (3383237)Instructions burned: 5 (million)
% 0.17/0.47 % (3383227)Success in time 0.043 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------