%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC220-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 : 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:05:09 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 58 ( 13 unt; 0 def)
% Number of atoms : 188 ( 32 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 264 ( 134 ~; 130 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 47 ( 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| ssItem(sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ssItem(sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f207]) ).
fof(f209,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| memberP(X1,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f210,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| memberP(X1,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f209]) ).
fof(f211,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| memberP(X2,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f212,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| memberP(X2,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f211]) ).
fof(f213,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| leq(X0,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f214,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| leq(X0,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f213]) ).
fof(f215,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ leq(sk5(X2,X1,X0),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f216,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ leq(sk5(X2,X1,X0),X0) ),
inference(reorient_equations,[],[f215]) ).
fof(f217,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f218,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f219,negated_conjecture,
( nil = sk3
| ssList(sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f220,negated_conjecture,
( nil = sk3
| app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f221,plain,
( nil = sk3
| sk3 = app(app(sk7,cons(sk6,nil)),sk8) ),
inference(reorient_equations,[],[f220]) ).
fof(f222,negated_conjecture,
! [X0] :
( nil = sk3
| ~ ssItem(X0)
| leq(X0,sk6)
| ~ memberP(sk7,X0)
| ~ memberP(sk8,X0)
| ~ leq(sk6,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f225,plain,
nil != sk3,
inference(definition_unfolding,[],[f206,f205]) ).
fof(f226,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| ssItem(sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f208,f205]) ).
fof(f227,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| memberP(X1,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f210,f205]) ).
fof(f228,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| memberP(X2,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f212,f205]) ).
fof(f229,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| leq(X0,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f214,f205]) ).
fof(f230,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ leq(sk5(X2,X1,X0),X0) ),
inference(definition_unfolding,[],[f216,f205]) ).
fof(f278,plain,
ssItem(sk6),
inference(forward_subsumption_resolution,[],[f217,f225]) ).
fof(f314,plain,
ssList(sk7),
inference(forward_subsumption_resolution,[],[f218,f225]) ).
fof(f315,plain,
ssList(sk8),
inference(forward_subsumption_resolution,[],[f219,f225]) ).
fof(f316,plain,
sk3 = app(app(sk7,cons(sk6,nil)),sk8),
inference(forward_subsumption_resolution,[],[f221,f225]) ).
fof(f319,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ leq(sk5(sk8,sk7,sk6),sk6) ),
inference(superposition,[],[f230,f316]) ).
fof(f320,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ leq(sk5(sk8,sk7,sk6),sk6) ),
inference(trivial_inequality_removal,[],[f319]) ).
fof(f324,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6)) ),
inference(superposition,[],[f226,f316]) ).
fof(f325,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6)) ),
inference(trivial_inequality_removal,[],[f324]) ).
fof(f326,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f325,f314]) ).
fof(f327,plain,
( ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f326,f315]) ).
fof(f328,plain,
ssItem(sk5(sk8,sk7,sk6)),
inference(forward_subsumption_resolution,[],[f327,f278]) ).
fof(f332,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk7,sk5(sk8,sk7,sk6)) ),
inference(superposition,[],[f227,f316]) ).
fof(f333,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk7,sk5(sk8,sk7,sk6)) ),
inference(trivial_inequality_removal,[],[f332]) ).
fof(f334,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk7,sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f333,f314]) ).
fof(f335,plain,
( ~ ssItem(sk6)
| memberP(sk7,sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f334,f315]) ).
fof(f336,plain,
memberP(sk7,sk5(sk8,sk7,sk6)),
inference(forward_subsumption_resolution,[],[f335,f278]) ).
fof(f345,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk8,sk5(sk8,sk7,sk6)) ),
inference(superposition,[],[f228,f316]) ).
fof(f346,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk8,sk5(sk8,sk7,sk6)) ),
inference(trivial_inequality_removal,[],[f345]) ).
fof(f347,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk8,sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f346,f314]) ).
fof(f348,plain,
( ~ ssItem(sk6)
| memberP(sk8,sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f347,f315]) ).
fof(f349,plain,
memberP(sk8,sk5(sk8,sk7,sk6)),
inference(forward_subsumption_resolution,[],[f348,f278]) ).
fof(f362,plain,
! [X0] :
( ~ memberP(sk8,X0)
| leq(X0,sk6)
| ~ memberP(sk7,X0)
| ~ ssItem(X0)
| ~ leq(sk6,X0) ),
inference(forward_subsumption_resolution,[],[f222,f225]) ).
fof(f388,plain,
( leq(sk5(sk8,sk7,sk6),sk6)
| ~ memberP(sk7,sk5(sk8,sk7,sk6))
| ~ ssItem(sk5(sk8,sk7,sk6))
| ~ leq(sk6,sk5(sk8,sk7,sk6)) ),
inference(resolution,[],[f349,f362]) ).
fof(f392,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| leq(sk6,sk5(sk8,sk7,sk6)) ),
inference(superposition,[],[f229,f316]) ).
fof(f393,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| leq(sk6,sk5(sk8,sk7,sk6)) ),
inference(trivial_inequality_removal,[],[f392]) ).
fof(f394,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| leq(sk6,sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f393,f314]) ).
fof(f395,plain,
( ~ ssItem(sk6)
| leq(sk6,sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f394,f315]) ).
fof(f396,plain,
leq(sk6,sk5(sk8,sk7,sk6)),
inference(forward_subsumption_resolution,[],[f395,f278]) ).
fof(f404,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ leq(sk5(sk8,sk7,sk6),sk6) ),
inference(forward_subsumption_resolution,[],[f320,f314]) ).
fof(f405,plain,
( leq(sk5(sk8,sk7,sk6),sk6)
| ~ ssItem(sk5(sk8,sk7,sk6))
| ~ leq(sk6,sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f388,f336]) ).
fof(f406,plain,
( ~ ssItem(sk6)
| ~ leq(sk5(sk8,sk7,sk6),sk6) ),
inference(forward_subsumption_resolution,[],[f404,f315]) ).
fof(f407,plain,
( leq(sk5(sk8,sk7,sk6),sk6)
| ~ leq(sk6,sk5(sk8,sk7,sk6)) ),
inference(forward_subsumption_resolution,[],[f405,f328]) ).
fof(f408,plain,
~ leq(sk5(sk8,sk7,sk6),sk6),
inference(forward_subsumption_resolution,[],[f406,f278]) ).
fof(f410,plain,
$false,
inference(global_subsumption,[],[f408,f407,f396]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC220-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.07/0.17 % Computer : n006.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Mon Sep 28 08:32:10 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20 Running first-order model finding
% 0.07/0.20 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.07/0.25 % (3819862)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (3819869)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3082881070:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.25 % (3819868)% WARNING: option uhcvi not known.
% 0.07/0.25 % (3819869) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3819862-3819869"...
% 0.07/0.25 % (3819869)...printing done.
% 0.07/0.25 % (3819869)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Unsatisfiable for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.25 % (3819869)------------------------------
% 0.07/0.25 % (3819869)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (3819869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (3819869)CaDiCaL version: 2.1.3
% 0.07/0.25 % (3819869)Termination reason: Refutation
% 0.07/0.25 % (3819869)Time elapsed: 0.005 s
% 0.07/0.25 % (3819869)Peak memory usage: 12 MB
% 0.07/0.25 % (3819869)Instructions burned: 14 (million)
% 0.07/0.25 % (3819862)Success in time 0.039 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------