%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC259+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 : n016.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:18 PM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 13 unt; 4 def)
% Number of atoms : 130 ( 26 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 145 ( 55 ~; 51 |; 24 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 21 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/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)
=> ! [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/sandbox/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)
=> ! [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(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] :
( ? [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(f367,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f180]) ).
fof(f368,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f418,plain,
( nil = sK49
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f221]) ).
fof(f423,plain,
( nil = sK49
| ssItem(sK51) ),
inference(cnf_transformation,[],[f221]) ).
fof(f424,plain,
~ totalorderedP(sK47),
inference(cnf_transformation,[],[f221]) ).
fof(f425,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f433,plain,
~ totalorderedP(sK49),
inference(definition_unfolding,[],[f424,f425]) ).
fof(f468,definition,
( spl54_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl54_2])],[avatar_definition]) ).
fof(f470,plain,
( nil = sK49
| ~ spl54_2 ),
inference(avatar_component_clause,[],[f468]) ).
fof(f488,definition,
( spl54_6
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl54_6])],[avatar_definition]) ).
fof(f490,plain,
( sK49 = cons(sK51,nil)
| ~ spl54_6 ),
inference(avatar_component_clause,[],[f488]) ).
fof(f498,plain,
( spl54_6
| spl54_2 ),
inference(avatar_split_clause,[],[f418,f468,f488]) ).
fof(f507,definition,
( spl54_9
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl54_9])],[avatar_definition]) ).
fof(f509,plain,
( ssItem(sK51)
| ~ spl54_9 ),
inference(avatar_component_clause,[],[f507]) ).
fof(f511,plain,
( spl54_9
| spl54_2 ),
inference(avatar_split_clause,[],[f423,f468,f507]) ).
fof(f522,definition,
( spl54_12
<=> ! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ) ),
introduced(definition,[new_symbols(definition,[spl54_12])],[avatar_definition]) ).
fof(f523,plain,
( ! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl54_12 ),
inference(avatar_component_clause,[],[f522]) ).
fof(f525,plain,
spl54_12,
inference(avatar_split_clause,[],[f367,f522]) ).
fof(f544,plain,
( ~ totalorderedP(nil)
| ~ spl54_2 ),
inference(superposition,[],[f433,f470]) ).
fof(f546,plain,
( $false
| ~ spl54_2 ),
inference(forward_subsumption_resolution,[],[f544,f368]) ).
fof(f547,plain,
~ spl54_2,
inference(avatar_contradiction_clause,[],[f546]) ).
fof(f562,plain,
( totalorderedP(sK49)
| ~ ssItem(sK51)
| ~ spl54_6
| ~ spl54_12 ),
inference(superposition,[],[f523,f490]) ).
fof(f563,plain,
( ~ ssItem(sK51)
| ~ spl54_6
| ~ spl54_12 ),
inference(forward_subsumption_resolution,[],[f562,f433]) ).
fof(f564,plain,
( $false
| ~ spl54_6
| ~ spl54_9
| ~ spl54_12 ),
inference(forward_subsumption_resolution,[],[f563,f509]) ).
fof(f565,plain,
( ~ spl54_6
| ~ spl54_9
| ~ spl54_12 ),
inference(avatar_contradiction_clause,[],[f564]) ).
cnf(s9,plain,
( spl54_2
| spl54_6 ),
inference(sat_conversion,[],[f498]) ).
cnf(s14,plain,
( spl54_2
| spl54_9 ),
inference(sat_conversion,[],[f511]) ).
cnf(s18,plain,
spl54_12,
inference(sat_conversion,[],[f525]) ).
cnf(s23,plain,
~ spl54_2,
inference(sat_conversion,[],[f547]) ).
cnf(s24,plain,
( ~ spl54_6
| ~ spl54_9
| ~ spl54_12 ),
inference(sat_conversion,[],[f565]) ).
cnf(s28,plain,
spl54_9,
inference(rat,[],[s14,s23]) ).
cnf(s29,plain,
~ spl54_6,
inference(rat,[],[s24,s18,s28]) ).
cnf(s32,plain,
$false,
inference(rat,[],[s9,s29,s23]) ).
fof(f566,plain,
$false,
inference(avatar_sat_refutation,[],[s32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC259+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.08/0.18 % Computer : n016.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 08:50:11 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.08/0.25 % (3485644)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (3485653)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1608706474:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.25 % (3485653) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3485644-3485653"...
% 0.08/0.25 % (3485649)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1089229996_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.25 % (3485653)...printing done.
% 0.08/0.25 % (3485651)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=711260011:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.25 % (3485652)dis+10_1_sil=32000:sp=arity:random_seed=2134247989:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25 % (3485654)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4236886325:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.25 % (3485655)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1126558320:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.25 % (3485653)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (3485653)------------------------------
% 0.08/0.25 % (3485653)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (3485653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (3485653)CaDiCaL version: 2.1.3
% 0.08/0.25 % (3485653)Termination reason: Refutation
% 0.08/0.25 % (3485653)Time elapsed: 0.007 s
% 0.08/0.25 % (3485653)Peak memory usage: 13 MB
% 0.08/0.25 % (3485653)Instructions burned: 21 (million)
% 0.08/0.25 % (3485644)Success in time 0.031 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------