%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC288+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 : n001.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:24 PM UTC 2026
% Result : Theorem 0.19s 0.29s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 13 unt; 5 def)
% Number of atoms : 203 ( 40 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 242 ( 88 ~; 75 |; 64 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 41 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax69) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| strictorderedP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) )
& ( 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
| strictorderedP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f182,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ~ strictorderedP(X0)
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f231,definition,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP6(X2,X3) ),
introduced(definition,[new_symbols(definition,[sP6])],[predicate_definition_introduction]) ).
fof(f232,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ~ strictorderedP(X0)
& ( sP6(X2,X3)
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f221,f231]) ).
fof(f297,plain,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP6(X2,X3) ),
inference(nnf_transformation,[],[f231]) ).
fof(f298,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& cons(X2,nil) = X0
& app(app(X3,X0),X4) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ lt(X2,X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(X4,X6)
| ~ lt(X6,X2) ) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP6(X0,X1) ),
inference(rectify,[],[f297]) ).
fof(f299,plain,
! [X0,X1] :
( ( ssList(sK56(X0,X1))
& cons(sK54(X0,X1),nil) = X0
& app(app(sK55(X0,X1),X0),sK56(X0,X1)) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(sK55(X0,X1),X5)
| ~ lt(sK54(X0,X1),X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(sK56(X0,X1),X6)
| ~ lt(X6,sK54(X0,X1)) )
& ssList(sK55(X0,X1))
& ssItem(sK54(X0,X1)) )
| ~ sP6(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK54,sK55,sK56]),skolemize(X2,sK54(X0,X1)),skolemize(X3,sK55(X0,X1)),skolemize(X4,sK56(X0,X1))],[f298]) ).
fof(f300,plain,
( ssList(sK60)
& sK58 = sK60
& sK57 = sK59
& ~ strictorderedP(sK57)
& ( sP6(sK59,sK60)
| ( nil = sK60
& nil = sK59 ) )
& ssList(sK59)
& ssList(sK58)
& ssList(sK57) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK57,sK58,sK59,sK60]),skolemize(X0,sK57),skolemize(X1,sK58),skolemize(X2,sK59),skolemize(X3,sK60)],[f232]) ).
fof(f462,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f463,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f500,plain,
! [X0,X1] :
( ssItem(sK54(X0,X1))
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f299]) ).
fof(f505,plain,
! [X0,X1] :
( ~ sP6(X0,X1)
| cons(sK54(X0,X1),nil) = X0 ),
inference(cnf_transformation,[],[f299]) ).
fof(f510,plain,
( sP6(sK59,sK60)
| nil = sK59 ),
inference(cnf_transformation,[],[f300]) ).
fof(f512,plain,
~ strictorderedP(sK57),
inference(cnf_transformation,[],[f300]) ).
fof(f513,plain,
sK57 = sK59,
inference(cnf_transformation,[],[f300]) ).
fof(f516,plain,
~ strictorderedP(sK59),
inference(definition_unfolding,[],[f512,f513]) ).
fof(f554,definition,
( spl61_1
<=> nil = sK59 ),
introduced(definition,[new_symbols(definition,[spl61_1])],[avatar_definition]) ).
fof(f556,plain,
( nil = sK59
| ~ spl61_1 ),
inference(avatar_component_clause,[],[f554]) ).
fof(f558,definition,
( spl61_2
<=> sP6(sK59,sK60) ),
introduced(definition,[new_symbols(definition,[spl61_2])],[avatar_definition]) ).
fof(f560,plain,
( sP6(sK59,sK60)
| ~ spl61_2 ),
inference(avatar_component_clause,[],[f558]) ).
fof(f561,plain,
( spl61_1
| spl61_2 ),
inference(avatar_split_clause,[],[f510,f558,f554]) ).
fof(f577,definition,
( spl61_6
<=> ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl61_6])],[avatar_definition]) ).
fof(f578,plain,
( ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl61_6 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f580,plain,
spl61_6,
inference(avatar_split_clause,[],[f462,f577]) ).
fof(f1180,plain,
( ~ strictorderedP(nil)
| ~ spl61_1 ),
inference(superposition,[],[f516,f556]) ).
fof(f1208,plain,
( $false
| ~ spl61_1 ),
inference(forward_subsumption_resolution,[],[f1180,f463]) ).
fof(f1209,plain,
~ spl61_1,
inference(avatar_contradiction_clause,[],[f1208]) ).
fof(f1275,plain,
( sK59 = cons(sK54(sK59,sK60),nil)
| ~ spl61_2 ),
inference(resolution,[],[f505,f560]) ).
fof(f1297,plain,
( strictorderedP(sK59)
| ~ ssItem(sK54(sK59,sK60))
| ~ spl61_2
| ~ spl61_6 ),
inference(superposition,[],[f578,f1275]) ).
fof(f1305,definition,
( spl61_29
<=> ssItem(sK54(sK59,sK60)) ),
introduced(definition,[new_symbols(definition,[spl61_29])],[avatar_definition]) ).
fof(f1307,plain,
( ~ ssItem(sK54(sK59,sK60))
| spl61_29 ),
inference(avatar_component_clause,[],[f1305]) ).
fof(f1313,plain,
( ~ ssItem(sK54(sK59,sK60))
| ~ spl61_2
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f1297,f516]) ).
fof(f1328,plain,
( ~ spl61_29
| ~ spl61_2
| ~ spl61_6 ),
inference(avatar_split_clause,[],[f1313,f577,f558,f1305]) ).
fof(f1347,plain,
( ~ sP6(sK59,sK60)
| spl61_29 ),
inference(resolution,[],[f1307,f500]) ).
fof(f1348,plain,
( $false
| ~ spl61_2
| spl61_29 ),
inference(forward_subsumption_resolution,[],[f1347,f560]) ).
fof(f1349,plain,
( ~ spl61_2
| spl61_29 ),
inference(avatar_contradiction_clause,[],[f1348]) ).
cnf(s1,plain,
( spl61_1
| spl61_2 ),
inference(sat_conversion,[],[f561]) ).
cnf(s5,plain,
spl61_6,
inference(sat_conversion,[],[f580]) ).
cnf(s34,plain,
~ spl61_1,
inference(sat_conversion,[],[f1209]) ).
cnf(s44,plain,
( ~ spl61_2
| ~ spl61_6
| ~ spl61_29 ),
inference(sat_conversion,[],[f1328]) ).
cnf(s49,plain,
( ~ spl61_2
| spl61_29 ),
inference(sat_conversion,[],[f1349]) ).
cnf(s55,plain,
spl61_2,
inference(rat,[],[s1,s34]) ).
cnf(s56,plain,
spl61_29,
inference(rat,[],[s49,s55]) ).
cnf(s60,plain,
$false,
inference(rat,[],[s44,s5,s56,s55]) ).
fof(f1350,plain,
$false,
inference(avatar_sat_refutation,[],[s60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC288+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.10/0.20 % Computer : n001.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 08:59:03 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.24 Running first-order model finding
% 0.10/0.24 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.19/0.29 % (227657)Will run a generic schedule for satisfiability detection.
% 0.19/0.29 % (227665)dis+10_1_sil=32000:sp=arity:random_seed=4188729437:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.29 % (227663)% WARNING: option uhcvi not known.
% 0.19/0.29 % (227663)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3141422131:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.29 % (227662)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3783917318_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.29 % (227666)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2648211342:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.29 % (227664)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1206327268:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.29 % (227667)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1357944832:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.29 % (227668)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2562487901:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.29 % (227665) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-227657-227665"...
% 0.19/0.29 % (227665)...printing done.
% 0.19/0.29 % (227665)Refutation found. Thanks to Tanya!
% 0.19/0.29 % SZS status Theorem for theBenchmark
% 0.19/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.29 % (227665)------------------------------
% 0.19/0.29 % (227665)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.29 % (227665)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.29 % (227665)CaDiCaL version: 2.1.3
% 0.19/0.29 % (227665)Termination reason: Refutation
% 0.19/0.29 % (227665)Time elapsed: 0.012 s
% 0.19/0.29 % (227665)Peak memory usage: 13 MB
% 0.19/0.29 % (227665)Instructions burned: 36 (million)
% 0.19/0.29 % (227657)Success in time 0.04 s
% 0.19/0.29 % Vampire exiting
%------------------------------------------------------------------------------