%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC182-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 : n014.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:00 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.51s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 73 ( 20 unt; 5 def)
% Number of atoms : 173 ( 33 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 198 ( 98 ~; 95 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f11,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause11) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f119,axiom,
! [X0,X1] :
( cons(X0,nil) != X1
| ~ ssItem(X0)
| ~ ssList(X1)
| singletonP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
fof(f121,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
fof(f122,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
inference(reorient_equations,[],[f121]) ).
fof(f123,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
fof(f124,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X1 ),
inference(reorient_equations,[],[f123]) ).
fof(f204,negated_conjecture,
nil = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f206,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,plain,
sk1 = app(app(sk6,cons(sk5,nil)),sk7),
inference(reorient_equations,[],[f210]) ).
fof(f220,plain,
ssList(sk3),
inference(definition_unfolding,[],[f8,f204]) ).
fof(f221,plain,
~ singletonP(sk3),
inference(definition_unfolding,[],[f11,f204]) ).
fof(f251,plain,
! [X0,X1] :
( cons(X0,sk3) != X1
| ~ ssItem(X0)
| ~ ssList(X1)
| singletonP(X1) ),
inference(definition_unfolding,[],[f119,f204]) ).
fof(f252,plain,
! [X0,X1] :
( app(X0,X1) != sk3
| ~ ssList(X1)
| ~ ssList(X0)
| sk3 = X0 ),
inference(definition_unfolding,[],[f122,f204,f204]) ).
fof(f253,plain,
! [X0,X1] :
( app(X0,X1) != sk3
| ~ ssList(X1)
| ~ ssList(X0)
| sk3 = X1 ),
inference(definition_unfolding,[],[f124,f204,f204]) ).
fof(f267,plain,
sk3 = app(app(sk6,cons(sk5,sk3)),sk7),
inference(definition_unfolding,[],[f211,f206,f204]) ).
fof(f275,plain,
! [X0] :
( ~ ssList(cons(X0,sk3))
| ~ ssItem(X0)
| singletonP(cons(X0,sk3)) ),
inference(equality_resolution,[],[f251]) ).
fof(f312,definition,
( spl0_4
<=> ssList(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f313,plain,
( ssList(sk3)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f312]) ).
fof(f348,plain,
spl0_4,
inference(avatar_split_clause,[],[f220,f312]) ).
fof(f428,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(app(sk6,cons(sk5,sk3)))
| sk3 = app(sk6,cons(sk5,sk3)) ),
inference(superposition,[],[f252,f267]) ).
fof(f429,plain,
( ~ ssList(sk7)
| ~ ssList(app(sk6,cons(sk5,sk3)))
| sk3 = app(sk6,cons(sk5,sk3)) ),
inference(trivial_inequality_removal,[],[f428]) ).
fof(f430,plain,
( ~ ssList(app(sk6,cons(sk5,sk3)))
| sk3 = app(sk6,cons(sk5,sk3)) ),
inference(forward_subsumption_resolution,[],[f429,f209]) ).
fof(f454,definition,
( spl0_22
<=> sk3 = app(sk6,cons(sk5,sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
fof(f456,plain,
( sk3 = app(sk6,cons(sk5,sk3))
| ~ spl0_22 ),
inference(avatar_component_clause,[],[f454]) ).
fof(f458,definition,
( spl0_23
<=> ssList(app(sk6,cons(sk5,sk3))) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f460,plain,
( ~ ssList(app(sk6,cons(sk5,sk3)))
| spl0_23 ),
inference(avatar_component_clause,[],[f458]) ).
fof(f461,plain,
( spl0_22
| ~ spl0_23 ),
inference(avatar_split_clause,[],[f430,f458,f454]) ).
fof(f985,plain,
( ~ ssList(sk6)
| ~ ssList(cons(sk5,sk3))
| spl0_23 ),
inference(resolution,[],[f85,f460]) ).
fof(f1038,plain,
( ~ ssList(cons(sk5,sk3))
| spl0_23 ),
inference(forward_subsumption_resolution,[],[f985,f208]) ).
fof(f1252,plain,
( ~ ssList(sk3)
| ~ ssItem(sk5)
| spl0_23 ),
inference(resolution,[],[f86,f1038]) ).
fof(f1270,plain,
( ~ ssItem(sk5)
| ~ spl0_4
| spl0_23 ),
inference(forward_subsumption_resolution,[],[f1252,f313]) ).
fof(f1272,plain,
( $false
| ~ spl0_4
| spl0_23 ),
inference(forward_subsumption_resolution,[],[f1270,f207]) ).
fof(f1273,plain,
( ~ spl0_4
| spl0_23 ),
inference(avatar_contradiction_clause,[],[f1272]) ).
fof(f2228,definition,
( spl0_98
<=> ssList(cons(sk5,sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_98])],[avatar_definition]) ).
fof(f2229,plain,
( ssList(cons(sk5,sk3))
| ~ spl0_98 ),
inference(avatar_component_clause,[],[f2228]) ).
fof(f2230,plain,
( ~ ssList(cons(sk5,sk3))
| spl0_98 ),
inference(avatar_component_clause,[],[f2228]) ).
fof(f2237,definition,
( spl0_100
<=> sk3 = cons(sk5,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_100])],[avatar_definition]) ).
fof(f2238,plain,
( sk3 != cons(sk5,sk3)
| spl0_100 ),
inference(avatar_component_clause,[],[f2237]) ).
fof(f2239,plain,
( sk3 = cons(sk5,sk3)
| ~ spl0_100 ),
inference(avatar_component_clause,[],[f2237]) ).
fof(f2252,plain,
( ~ ssList(sk3)
| ~ ssItem(sk5)
| spl0_98 ),
inference(resolution,[],[f2230,f86]) ).
fof(f2253,plain,
( ~ ssItem(sk5)
| ~ spl0_4
| spl0_98 ),
inference(forward_subsumption_resolution,[],[f2252,f313]) ).
fof(f2254,plain,
( $false
| ~ spl0_4
| spl0_98 ),
inference(forward_subsumption_resolution,[],[f2253,f207]) ).
fof(f2255,plain,
( ~ spl0_4
| spl0_98 ),
inference(avatar_contradiction_clause,[],[f2254]) ).
fof(f2326,plain,
( ~ ssList(sk3)
| ~ ssItem(sk5)
| singletonP(sk3)
| ~ spl0_100 ),
inference(superposition,[],[f275,f2239]) ).
fof(f2341,plain,
( ~ ssItem(sk5)
| singletonP(sk3)
| ~ spl0_4
| ~ spl0_100 ),
inference(forward_subsumption_resolution,[],[f2326,f313]) ).
fof(f2354,plain,
( singletonP(sk3)
| ~ spl0_4
| ~ spl0_100 ),
inference(forward_subsumption_resolution,[],[f2341,f207]) ).
fof(f2358,plain,
( $false
| ~ spl0_4
| ~ spl0_100 ),
inference(forward_subsumption_resolution,[],[f2354,f221]) ).
fof(f2359,plain,
( ~ spl0_4
| ~ spl0_100 ),
inference(avatar_contradiction_clause,[],[f2358]) ).
fof(f2693,plain,
( sk3 != sk3
| ~ ssList(cons(sk5,sk3))
| ~ ssList(sk6)
| sk3 = cons(sk5,sk3)
| ~ spl0_22 ),
inference(superposition,[],[f253,f456]) ).
fof(f2696,plain,
( ~ ssList(cons(sk5,sk3))
| ~ ssList(sk6)
| sk3 = cons(sk5,sk3)
| ~ spl0_22 ),
inference(trivial_inequality_removal,[],[f2693]) ).
fof(f2700,plain,
( ~ ssList(sk6)
| sk3 = cons(sk5,sk3)
| ~ spl0_22
| ~ spl0_98 ),
inference(forward_subsumption_resolution,[],[f2696,f2229]) ).
fof(f2711,plain,
( sk3 = cons(sk5,sk3)
| ~ spl0_22
| ~ spl0_98 ),
inference(forward_subsumption_resolution,[],[f2700,f208]) ).
fof(f2720,plain,
( $false
| ~ spl0_22
| ~ spl0_98
| spl0_100 ),
inference(forward_subsumption_resolution,[],[f2711,f2238]) ).
fof(f2721,plain,
( ~ spl0_22
| ~ spl0_98
| spl0_100 ),
inference(avatar_contradiction_clause,[],[f2720]) ).
cnf(s11,plain,
spl0_4,
inference(sat_conversion,[],[f348]) ).
cnf(s21,plain,
( spl0_22
| ~ spl0_23 ),
inference(sat_conversion,[],[f461]) ).
cnf(s73,plain,
( ~ spl0_4
| spl0_23 ),
inference(sat_conversion,[],[f1273]) ).
cnf(s122,plain,
( ~ spl0_4
| spl0_98 ),
inference(sat_conversion,[],[f2255]) ).
cnf(s131,plain,
( ~ spl0_4
| ~ spl0_100 ),
inference(sat_conversion,[],[f2359]) ).
cnf(s133,plain,
( ~ spl0_22
| ~ spl0_98
| spl0_100 ),
inference(sat_conversion,[],[f2721]) ).
cnf(s142,plain,
~ spl0_100,
inference(rat,[],[s131,s11]) ).
cnf(s143,plain,
spl0_98,
inference(rat,[],[s122,s11]) ).
cnf(s145,plain,
spl0_23,
inference(rat,[],[s73,s11]) ).
cnf(s146,plain,
~ spl0_22,
inference(rat,[],[s133,s142,s143]) ).
cnf(s152,plain,
$false,
inference(rat,[],[s21,s145,s146]) ).
fof(f2728,plain,
$false,
inference(avatar_sat_refutation,[],[s152]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC182-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.13/0.40 % Computer : n014.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Mon Sep 28 08:21:16 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.44 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.17/0.51 % (1628692)Will run a generic schedule for satisfiability detection.
% 0.17/0.51 % (1628700)dis+10_1_sil=32000:sp=arity:random_seed=1728623352:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.51 % (1628698)% WARNING: option uhcvi not known.
% 0.17/0.51 % (1628697)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1190703922_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.51 % (1628698)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2427218029:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.51 % (1628699)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=348216380:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.51 % (1628701)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3157168256:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.51 % (1628702)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2595365687:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.51 % (1628703)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3098670848:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.51 % TRYING [1]
% 0.17/0.51 % TRYING [2]
% 0.17/0.51 % TRYING [3]
% 0.17/0.51 % (1628700) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1628692-1628700"...
% 0.17/0.51 % (1628700)...printing done.
% 0.17/0.51 % (1628700)Refutation found. Thanks to Tanya!
% 0.17/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.51 % (1628700)------------------------------
% 0.17/0.51 % (1628700)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.51 % (1628700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.51 % (1628700)CaDiCaL version: 2.1.3
% 0.17/0.51 % (1628700)Termination reason: Refutation
% 0.17/0.51 % (1628700)Time elapsed: 0.026 s
% 0.17/0.51 % (1628700)Peak memory usage: 13 MB
% 0.17/0.51 % (1628700)Instructions burned: 75 (million)
% 0.17/0.51 % (1628692)Success in time 0.06 s
% 0.17/0.51 % Vampire exiting
%------------------------------------------------------------------------------