%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC189+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:05:02 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 126 ( 42 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 154 ( 49 ~; 43 |; 46 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 56 ( 32 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X2 ) ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X0
| X8 = X9 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X2 ) ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X0
| X8 = X9 ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X2 ) ) ) )
& ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = X0
& X8 != X9
& ssList(X11) )
& ssList(X10) )
& ssItem(X9) )
& ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X2 ) ) ) )
& ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = X0
& X8 != X9
& ssList(X11) )
& ssList(X10) )
& ssItem(X9) )
& ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != sK55 ) ) ) )
& sK53 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60)
& sK57 != sK58
& ssList(sK60)
& ssList(sK59)
& ssItem(sK58)
& ssItem(sK57)
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59,sK60]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X8,sK57),skolemize(X9,sK58),skolemize(X10,sK59),skolemize(X11,sK60)],[f222]) ).
fof(f500,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
ssItem(sK58),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
ssList(sK59),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
ssList(sK60),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK57 != sK58,
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK53 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
! [X6,X7,X4,X5] :
( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != sK55
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| X4 = X5
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK55 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60),
inference(definition_unfolding,[],[f505,f507]) ).
fof(f581,plain,
( sK55 != sK55
| ~ ssItem(sK58)
| ~ ssList(sK59)
| ~ ssList(sK60)
| sK57 = sK58
| ~ ssItem(sK57) ),
inference(superposition,[],[f506,f509]) ).
fof(f582,plain,
( ~ ssItem(sK58)
| ~ ssList(sK59)
| ~ ssList(sK60)
| sK57 = sK58
| ~ ssItem(sK57) ),
inference(trivial_inequality_removal,[],[f581]) ).
fof(f583,plain,
( ~ ssList(sK59)
| ~ ssList(sK60)
| sK57 = sK58
| ~ ssItem(sK57) ),
inference(forward_subsumption_resolution,[],[f582,f501]) ).
fof(f584,plain,
( ~ ssList(sK60)
| sK57 = sK58
| ~ ssItem(sK57) ),
inference(forward_subsumption_resolution,[],[f583,f502]) ).
fof(f585,plain,
( sK57 = sK58
| ~ ssItem(sK57) ),
inference(forward_subsumption_resolution,[],[f584,f503]) ).
fof(f586,plain,
~ ssItem(sK57),
inference(forward_subsumption_resolution,[],[f585,f504]) ).
fof(f587,plain,
$false,
inference(forward_subsumption_resolution,[],[f586,f500]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC189+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n013.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 08:21:07 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 Running first-order model finding
% 0.12/0.40 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.12/0.46 % (1021112)Will run a generic schedule for satisfiability detection.
% 0.12/0.46 % (1021122)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3889502591:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.46 % (1021118)% WARNING: option uhcvi not known.
% 0.12/0.46 % (1021117)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3867295365_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.46 % (1021119)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3654864637:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.46 % (1021120)dis+10_1_sil=32000:sp=arity:random_seed=492229242:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.46 % (1021121)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3748542223:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.46 % (1021123)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4054211265:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.46 % (1021118)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2071181561:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.46 % (1021120) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1021112-1021120"...
% 0.12/0.46 % (1021118) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1021112-1021118"...
% 0.12/0.46 % (1021120)...printing done.
% 0.12/0.46 % (1021119) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1021112-1021119"...
% 0.12/0.46 % (1021120)Refutation found. Thanks to Tanya!
% 0.12/0.46 % SZS status Theorem for theBenchmark
% 0.12/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46 % (1021120)------------------------------
% 0.12/0.46 % (1021120)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46 % (1021120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46 % (1021120)CaDiCaL version: 2.1.3
% 0.12/0.46 % (1021120)Termination reason: Refutation
% 0.12/0.46 % (1021120)Time elapsed: 0.006 s
% 0.12/0.46 % (1021120)Peak memory usage: 12 MB
% 0.12/0.46 % (1021120)Instructions burned: 10 (million)
% 0.12/0.46 % (1021112)Success in time 0.044 s
% 0.12/0.46 % Vampire exiting
%------------------------------------------------------------------------------