%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC292+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 : n008.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:25 PM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 66 ( 20 unt; 7 def)
% Number of atoms : 193 ( 42 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 207 ( 80 ~; 70 |; 35 &)
% ( 9 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 23 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/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)
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4) ) )
& neq(X3,nil) ) ) ) ) ) ),
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
| strictorderedP(X0)
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4) ) )
& neq(X3,nil) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f182,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ~ strictorderedP(X0)
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ~ strictorderedP(X0)
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ssItem(X4) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ~ strictorderedP(sK53)
& ( nil = sK55
| nil != sK56 )
& ( ( sK55 = cons(sK57,nil)
& memberP(sK56,sK57)
& ssItem(sK57) )
| ~ neq(sK56,nil) )
& ssList(sK56)
& 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)],[f222]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f458,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f459,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ssItem(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( sK55 = cons(sK57,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( nil = sK55
| nil != sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
~ strictorderedP(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
~ strictorderedP(sK55),
inference(definition_unfolding,[],[f504,f505]) ).
fof(f545,definition,
( spl58_1
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl58_1])],[avatar_definition]) ).
fof(f547,plain,
( ~ neq(sK56,nil)
| spl58_1 ),
inference(avatar_component_clause,[],[f545]) ).
fof(f549,definition,
( spl58_2
<=> ssItem(sK57) ),
introduced(definition,[new_symbols(definition,[spl58_2])],[avatar_definition]) ).
fof(f551,plain,
( ssItem(sK57)
| ~ spl58_2 ),
inference(avatar_component_clause,[],[f549]) ).
fof(f552,plain,
( ~ spl58_1
| spl58_2 ),
inference(avatar_split_clause,[],[f500,f549,f545]) ).
fof(f559,definition,
( spl58_4
<=> sK55 = cons(sK57,nil) ),
introduced(definition,[new_symbols(definition,[spl58_4])],[avatar_definition]) ).
fof(f561,plain,
( sK55 = cons(sK57,nil)
| ~ spl58_4 ),
inference(avatar_component_clause,[],[f559]) ).
fof(f562,plain,
( ~ spl58_1
| spl58_4 ),
inference(avatar_split_clause,[],[f502,f559,f545]) ).
fof(f564,definition,
( spl58_5
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl58_5])],[avatar_definition]) ).
fof(f568,definition,
( spl58_6
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl58_6])],[avatar_definition]) ).
fof(f570,plain,
( nil = sK55
| ~ spl58_6 ),
inference(avatar_component_clause,[],[f568]) ).
fof(f571,plain,
( ~ spl58_5
| spl58_6 ),
inference(avatar_split_clause,[],[f503,f568,f564]) ).
fof(f573,definition,
( spl58_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl58_7])],[avatar_definition]) ).
fof(f574,plain,
( ssList(nil)
| ~ spl58_7 ),
inference(avatar_component_clause,[],[f573]) ).
fof(f582,definition,
( spl58_9
<=> ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl58_9])],[avatar_definition]) ).
fof(f583,plain,
( ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl58_9 ),
inference(avatar_component_clause,[],[f582]) ).
fof(f585,plain,
spl58_9,
inference(avatar_split_clause,[],[f458,f582]) ).
fof(f606,plain,
spl58_7,
inference(avatar_split_clause,[],[f389,f573]) ).
fof(f989,plain,
( nil = sK56
| ~ ssList(nil)
| ~ ssList(sK56)
| spl58_1 ),
inference(resolution,[],[f387,f547]) ).
fof(f998,plain,
( nil = sK56
| ~ ssList(sK56)
| spl58_1
| ~ spl58_7 ),
inference(forward_subsumption_resolution,[],[f989,f574]) ).
fof(f999,plain,
( nil = sK56
| spl58_1
| ~ spl58_7 ),
inference(forward_subsumption_resolution,[],[f998,f499]) ).
fof(f1000,plain,
( spl58_5
| spl58_1
| ~ spl58_7 ),
inference(avatar_split_clause,[],[f999,f573,f545,f564]) ).
fof(f1030,plain,
( ~ strictorderedP(nil)
| ~ spl58_6 ),
inference(superposition,[],[f507,f570]) ).
fof(f1055,plain,
( $false
| ~ spl58_6 ),
inference(forward_subsumption_resolution,[],[f1030,f459]) ).
fof(f1056,plain,
~ spl58_6,
inference(avatar_contradiction_clause,[],[f1055]) ).
fof(f1062,plain,
( strictorderedP(sK55)
| ~ ssItem(sK57)
| ~ spl58_4
| ~ spl58_9 ),
inference(superposition,[],[f583,f561]) ).
fof(f1070,plain,
( ~ ssItem(sK57)
| ~ spl58_4
| ~ spl58_9 ),
inference(forward_subsumption_resolution,[],[f1062,f507]) ).
fof(f1076,plain,
( $false
| ~ spl58_2
| ~ spl58_4
| ~ spl58_9 ),
inference(forward_subsumption_resolution,[],[f1070,f551]) ).
fof(f1077,plain,
( ~ spl58_2
| ~ spl58_4
| ~ spl58_9 ),
inference(avatar_contradiction_clause,[],[f1076]) ).
cnf(s1,plain,
( ~ spl58_1
| spl58_2 ),
inference(sat_conversion,[],[f552]) ).
cnf(s3,plain,
( ~ spl58_1
| spl58_4 ),
inference(sat_conversion,[],[f562]) ).
cnf(s4,plain,
( ~ spl58_5
| spl58_6 ),
inference(sat_conversion,[],[f571]) ).
cnf(s7,plain,
spl58_9,
inference(sat_conversion,[],[f585]) ).
cnf(s13,plain,
spl58_7,
inference(sat_conversion,[],[f606]) ).
cnf(s30,plain,
( spl58_1
| spl58_5
| ~ spl58_7 ),
inference(sat_conversion,[],[f1000]) ).
cnf(s44,plain,
~ spl58_6,
inference(sat_conversion,[],[f1056]) ).
cnf(s45,plain,
( ~ spl58_2
| ~ spl58_4
| ~ spl58_9 ),
inference(sat_conversion,[],[f1077]) ).
cnf(s53,plain,
~ spl58_5,
inference(rat,[],[s4,s44]) ).
cnf(s54,plain,
spl58_1,
inference(rat,[],[s30,s13,s53]) ).
cnf(s55,plain,
spl58_4,
inference(rat,[],[s3,s54]) ).
cnf(s56,plain,
~ spl58_2,
inference(rat,[],[s45,s7,s55]) ).
cnf(s58,plain,
$false,
inference(rat,[],[s1,s56,s54]) ).
fof(f1084,plain,
$false,
inference(avatar_sat_refutation,[],[s58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC292+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n008.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 08:55:47 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.24 Running first-order model finding
% 0.08/0.24 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.20/0.30 % (2109860)Will run a generic schedule for satisfiability detection.
% 0.20/0.30 % (2109868)dis+10_1_sil=32000:sp=arity:random_seed=3302280988:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.30 % (2109866)% WARNING: option uhcvi not known.
% 0.20/0.30 % (2109865)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1670855808_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.30 % (2109866)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3812112595:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.30 % (2109867)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2356365807:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.30 % (2109869)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2660284840:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.30 % (2109870)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=415775860:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.30 % (2109871)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3754523971:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.30 % (2109868) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2109860-2109868"...
% 0.20/0.30 % (2109868)...printing done.
% 0.20/0.30 % (2109868)Refutation found. Thanks to Tanya!
% 0.20/0.30 % SZS status Theorem for theBenchmark
% 0.20/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (2109868)------------------------------
% 0.20/0.30 % (2109868)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (2109868)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (2109868)CaDiCaL version: 2.1.3
% 0.20/0.30 % (2109868)Termination reason: Refutation
% 0.20/0.30 % (2109868)Time elapsed: 0.009 s
% 0.20/0.30 % (2109868)Peak memory usage: 13 MB
% 0.20/0.30 % (2109868)Instructions burned: 24 (million)
% 0.20/0.30 % (2109860)Success in time 0.054 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------