%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC257+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:05:17 PM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 10 unt; 2 def)
% Number of atoms : 116 ( 32 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 127 ( 45 ~; 43 |; 30 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 15 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| totalorderedP(X0)
| ( ! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X3,X5)
& leq(X4,X5) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ),
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
| totalorderedP(X0)
| ( ! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X3,X5)
& leq(X4,X5) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f180,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ~ totalorderedP(X0)
& ( ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ memberP(X3,X5)
| ~ leq(X4,X5) ) )
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f295,plain,
( ssList(sK56)
& sK54 = sK56
& sK53 = sK55
& ~ totalorderedP(sK53)
& ( ( ssItem(sK57)
& sK55 = cons(sK57,nil)
& memberP(sK56,sK57)
& ! [X5] :
( ~ ssItem(X5)
| sK57 = X5
| ~ memberP(sK56,X5)
| ~ leq(sK57,X5) ) )
| ( nil = sK56
& nil = sK55 ) )
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57)],[f221]) ).
fof(f450,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f180]) ).
fof(f451,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f502,plain,
( sK55 = cons(sK57,nil)
| nil = sK55 ),
inference(cnf_transformation,[],[f295]) ).
fof(f504,plain,
( ssItem(sK57)
| nil = sK55 ),
inference(cnf_transformation,[],[f295]) ).
fof(f506,plain,
~ totalorderedP(sK53),
inference(cnf_transformation,[],[f295]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f295]) ).
fof(f510,plain,
~ totalorderedP(sK55),
inference(definition_unfolding,[],[f506,f507]) ).
fof(f596,definition,
( spl58_14
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl58_14])],[avatar_definition]) ).
fof(f597,plain,
( nil != sK55
| spl58_14 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f598,plain,
( nil = sK55
| ~ spl58_14 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f600,definition,
( spl58_15
<=> ssItem(sK57) ),
introduced(definition,[new_symbols(definition,[spl58_15])],[avatar_definition]) ).
fof(f602,plain,
( ssItem(sK57)
| ~ spl58_15 ),
inference(avatar_component_clause,[],[f600]) ).
fof(f603,plain,
( spl58_14
| spl58_15 ),
inference(avatar_split_clause,[],[f504,f600,f596]) ).
fof(f605,plain,
( ~ totalorderedP(nil)
| ~ spl58_14 ),
inference(superposition,[],[f510,f598]) ).
fof(f608,plain,
( $false
| ~ spl58_14 ),
inference(global_subsumption,[],[f605,f451]) ).
fof(f609,plain,
~ spl58_14,
inference(avatar_contradiction_clause,[],[f608]) ).
fof(f611,plain,
( sK55 = cons(sK57,nil)
| spl58_14 ),
inference(forward_subsumption_resolution,[],[f502,f597]) ).
fof(f1088,plain,
( totalorderedP(sK55)
| ~ ssItem(sK57)
| spl58_14 ),
inference(superposition,[],[f450,f611]) ).
fof(f1089,plain,
( ~ ssItem(sK57)
| spl58_14 ),
inference(forward_subsumption_resolution,[],[f1088,f510]) ).
fof(f1090,plain,
( $false
| spl58_14
| ~ spl58_15 ),
inference(forward_subsumption_resolution,[],[f1089,f602]) ).
fof(f1091,plain,
( spl58_14
| ~ spl58_15 ),
inference(avatar_contradiction_clause,[],[f1090]) ).
cnf(s269,plain,
( spl58_14
| spl58_15 ),
inference(sat_conversion,[],[f603]) ).
cnf(s275,plain,
~ spl58_14,
inference(sat_conversion,[],[f609]) ).
cnf(s655,plain,
( spl58_14
| ~ spl58_15 ),
inference(sat_conversion,[],[f1091]) ).
cnf(s656,plain,
~ spl58_15,
inference(rat,[],[s655,s275]) ).
cnf(s658,plain,
$false,
inference(rat,[],[s269,s656,s275]) ).
fof(f1092,plain,
$false,
inference(avatar_sat_refutation,[],[s658]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC257+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n011.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 08:44:37 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.21/0.29 % (3255656)Will run a generic schedule for satisfiability detection.
% 0.21/0.29 % (3255663)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2269650702:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29 % (3255662)% WARNING: option uhcvi not known.
% 0.21/0.29 % (3255661)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1832315236_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29 % (3255662)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2250700051:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29 % (3255666)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4264416907:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29 % (3255664)dis+10_1_sil=32000:sp=arity:random_seed=1006432913:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29 % (3255665)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3353810798:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29 % (3255667)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3721371100:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.29 % (3255663) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3255656-3255663"...
% 0.21/0.29 % (3255663)...printing done.
% 0.21/0.29 % (3255663)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (3255663)------------------------------
% 0.21/0.29 % (3255663)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (3255663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (3255663)CaDiCaL version: 2.1.3
% 0.21/0.29 % (3255663)Termination reason: Refutation
% 0.21/0.29 % (3255663)Time elapsed: 0.013 s
% 0.21/0.29 % (3255663)Peak memory usage: 13 MB
% 0.21/0.29 % (3255663)Instructions burned: 33 (million)
% 0.21/0.29 % (3255656)Success in time 0.047 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------