%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC095+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:38 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 81 ( 29 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 106 ( 43 ~; 34 |; 19 &)
% ( 0 <=>; 10 =>; 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 : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 36 ( 23 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X0
& app(X4,X6) = X1 ) ) )
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(X7,X8),X9) != X2
| app(X7,X9) != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/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] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X4,X5),X6) = X0
& app(X4,X6) = X1 ) ) )
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(X7,X8),X9) != X2
| app(X7,X9) != X3 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X0
| app(X4,X6) != X1 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( ssList(X9)
& app(app(X7,X8),X9) = X2
& app(X7,X9) = X3 )
& ssList(X8) )
& ssList(X7) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f410,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK48
| app(app(X4,X5),X6) != sK47
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f221]) ).
fof(f411,plain,
sK50 = app(sK51,sK53),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
sK49 = app(app(sK51,sK52),sK53),
inference(cnf_transformation,[],[f221]) ).
fof(f413,plain,
ssList(sK53),
inference(cnf_transformation,[],[f221]) ).
fof(f414,plain,
ssList(sK52),
inference(cnf_transformation,[],[f221]) ).
fof(f415,plain,
ssList(sK51),
inference(cnf_transformation,[],[f221]) ).
fof(f416,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f221]) ).
fof(f424,plain,
! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK49
| app(X4,X6) != sK50
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f410,f417,f416]) ).
fof(f642,plain,
( sK49 != sK49
| sK50 != app(sK51,sK53)
| ~ ssList(sK53)
| ~ ssList(sK52)
| ~ ssList(sK51) ),
inference(superposition,[],[f424,f412]) ).
fof(f643,plain,
( sK50 != app(sK51,sK53)
| ~ ssList(sK53)
| ~ ssList(sK52)
| ~ ssList(sK51) ),
inference(trivial_inequality_removal,[],[f642]) ).
fof(f644,plain,
( ~ ssList(sK53)
| ~ ssList(sK52)
| ~ ssList(sK51) ),
inference(forward_subsumption_resolution,[],[f643,f411]) ).
fof(f647,plain,
( ~ ssList(sK52)
| ~ ssList(sK51) ),
inference(forward_subsumption_resolution,[],[f644,f413]) ).
fof(f657,plain,
~ ssList(sK51),
inference(forward_subsumption_resolution,[],[f647,f414]) ).
fof(f658,plain,
$false,
inference(forward_subsumption_resolution,[],[f657,f415]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC095+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 07:50:50 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.16/0.47 % (3235822)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (3235827)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2638553985_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % (3235828)% WARNING: option uhcvi not known.
% 0.16/0.47 % (3235828)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1703870502:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % (3235829)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1340253797:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (3235830)dis+10_1_sil=32000:sp=arity:random_seed=1060464764:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (3235831)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2912004958:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (3235832)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1535413310:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % TRYING [2]
% 0.16/0.47 % (3235833)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2634348883:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % TRYING [3]
% 0.16/0.47 % (3235828) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3235822-3235828"...
% 0.16/0.47 % (3235830) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3235822-3235830"...
% 0.16/0.47 % (3235828)...printing done.
% 0.16/0.47 % (3235830)...printing done.
% 0.16/0.47 % (3235829) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3235822-3235829"...
% 0.16/0.47 % (3235828)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (3235828)------------------------------
% 0.16/0.47 % (3235828)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (3235828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (3235828)CaDiCaL version: 2.1.3
% 0.16/0.47 % (3235828)Termination reason: Refutation
% 0.16/0.47 % (3235828)Time elapsed: 0.007 s
% 0.16/0.47 % (3235828)Peak memory usage: 12 MB
% 0.16/0.47 % (3235828)Instructions burned: 10 (million)
% 0.16/0.47 % (3235822)Success in time 0.044 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------