%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC007+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 : n010.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:04:15 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 39 ( 10 unt; 0 def)
% Number of atoms : 158 ( 81 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 201 ( 82 ~; 70 |; 35 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 47 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X2
| X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X1
& app(X4,X6) = X0 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X2
| X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X1
& app(X4,X6) = X0 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X2
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X1
| app(X4,X6) != X0 ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X2
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X1
| app(X4,X6) != X0 ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f292,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f200]) ).
fof(f293,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f292]) ).
fof(f296,plain,
( nil = sK55
& sK54 = sK56
& sK53 = sK55
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != sK54
| app(X4,X6) != sK53 ) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f403,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f481,plain,
! [X0,X1] :
( nil = app(X0,X1)
| nil != X1
| nil != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f293]) ).
fof(f482,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
! [X6,X4,X5] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK54
| app(X4,X6) != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
nil = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f513,plain,
! [X0] :
( ~ ssList(X0)
| app(sK55,X0) = X0 ),
inference(definition_unfolding,[],[f403,f503]) ).
fof(f556,plain,
! [X0,X1] :
( app(X0,X1) = sK55
| sK55 != X1
| sK55 != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f481,f503,f503,f503]) ).
fof(f559,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,sK55) = X0 ),
inference(definition_unfolding,[],[f482,f503]) ).
fof(f562,plain,
! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK56
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssList(X4)
| app(X4,X6) != sK55 ),
inference(definition_unfolding,[],[f500,f502,f501]) ).
fof(f589,plain,
! [X0] :
( sK55 = app(X0,sK55)
| sK55 != X0
| ~ ssList(sK55)
| ~ ssList(X0) ),
inference(equality_resolution,[],[f556]) ).
fof(f590,plain,
( sK55 = app(sK55,sK55)
| ~ ssList(sK55)
| ~ ssList(sK55) ),
inference(equality_resolution,[],[f589]) ).
fof(f593,plain,
( sK55 = app(sK55,sK55)
| ~ ssList(sK55) ),
inference(duplicate_literal_removal,[],[f590]) ).
fof(f599,plain,
sK55 = app(sK55,sK55),
inference(global_subsumption,[],[f593,f498]) ).
fof(f645,plain,
sK56 = app(sK55,sK56),
inference(resolution,[],[f513,f499]) ).
fof(f693,plain,
! [X0] :
( sK56 != app(sK56,X0)
| ~ ssList(sK56)
| ~ ssList(X0)
| ~ ssList(sK55)
| sK55 != app(sK55,X0) ),
inference(superposition,[],[f562,f645]) ).
fof(f695,plain,
! [X0] :
( sK56 != app(sK56,X0)
| ~ ssList(X0)
| ~ ssList(sK55)
| sK55 != app(sK55,X0) ),
inference(forward_subsumption_resolution,[],[f693,f499]) ).
fof(f696,plain,
! [X0] :
( sK56 != app(sK56,X0)
| ~ ssList(X0)
| sK55 != app(sK55,X0) ),
inference(forward_subsumption_resolution,[],[f695,f498]) ).
fof(f704,plain,
sK56 = app(sK56,sK55),
inference(resolution,[],[f559,f499]) ).
fof(f719,plain,
( sK56 != sK56
| ~ ssList(sK55)
| sK55 != app(sK55,sK55) ),
inference(superposition,[],[f696,f704]) ).
fof(f721,plain,
( ~ ssList(sK55)
| sK55 != app(sK55,sK55) ),
inference(trivial_inequality_removal,[],[f719]) ).
fof(f723,plain,
sK55 != app(sK55,sK55),
inference(forward_subsumption_resolution,[],[f721,f498]) ).
fof(f725,plain,
$false,
inference(forward_subsumption_resolution,[],[f723,f599]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC007+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:25:34 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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.10/0.45 % (1738926)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (1738932)% WARNING: option uhcvi not known.
% 0.10/0.45 % (1738932)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1532269076:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45 % (1738931)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3159544936_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (1738933)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3398457535:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (1738934)dis+10_1_sil=32000:sp=arity:random_seed=1076987439:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (1738935)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2622666692:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (1738936)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=374391102:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45 % (1738937)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4187801254:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % (1738933) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1738926-1738933"...
% 0.10/0.45 % (1738933)...printing done.
% 0.10/0.45 % (1738933)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (1738933)------------------------------
% 0.10/0.45 % (1738933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (1738933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (1738933)CaDiCaL version: 2.1.3
% 0.10/0.45 % (1738933)Termination reason: Refutation
% 0.10/0.45 % (1738933)Time elapsed: 0.011 s
% 0.10/0.45 % (1738933)Peak memory usage: 12 MB
% 0.10/0.45 % (1738933)Instructions burned: 15 (million)
% 0.10/0.45 % (1738926)Success in time 0.052 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------