%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC422-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 : n012.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:59 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.15s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 65 ( 13 unt; 7 def)
% Number of atoms : 175 ( 27 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 197 ( 87 ~; 103 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f217,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk2
| app(app(X2,cons(X0,nil)),X1) != sk1
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f218,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk2 != app(app(X1,cons(X0,nil)),X2)
| sk1 != app(app(X2,cons(X0,nil)),X1)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f217]) ).
fof(f219,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f220,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f221,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
fof(f222,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
fof(f223,plain,
( sk4 = app(app(sk6,cons(sk5,nil)),sk7)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f222]) ).
fof(f224,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),sk6) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
fof(f225,plain,
( sk3 = app(app(sk7,cons(sk5,nil)),sk6)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f224]) ).
fof(f228,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f236,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| sk3 != app(app(X2,cons(X0,nil)),X1)
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f218,f204,f205]) ).
fof(f418,plain,
( ~ neq(sk4,nil)
| ~ neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f228]) ).
fof(f426,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ssList(X1)
| ssList(X2)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| sk3 != app(app(X2,cons(X0,nil)),X1)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f236]) ).
fof(f427,plain,
( ssItem(sk5)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f219]) ).
fof(f428,plain,
( ~ ssList(sk6)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f220]) ).
fof(f429,plain,
( ~ ssList(sk7)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f221]) ).
fof(f430,plain,
( sk4 = app(app(sk6,cons(sk5,nil)),sk7)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f223]) ).
fof(f431,plain,
( sk3 = app(app(sk7,cons(sk5,nil)),sk6)
| neq(sk4,nil) ),
inference(consistent_polarity_flipping,[],[f225]) ).
fof(f432,plain,
~ neq(sk4,nil),
inference(duplicate_literal_removal,[],[f418]) ).
fof(f440,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f444,definition,
( spl0_2
<=> sk3 = app(app(sk7,cons(sk5,nil)),sk6) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f446,plain,
( sk3 = app(app(sk7,cons(sk5,nil)),sk6)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f444]) ).
fof(f447,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f431,f444,f440]) ).
fof(f449,definition,
( spl0_3
<=> sk4 = app(app(sk6,cons(sk5,nil)),sk7) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f451,plain,
( sk4 = app(app(sk6,cons(sk5,nil)),sk7)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f449]) ).
fof(f452,plain,
( spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f430,f449,f440]) ).
fof(f454,definition,
( spl0_4
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f456,plain,
( ~ ssList(sk7)
| spl0_4 ),
inference(avatar_component_clause,[],[f454]) ).
fof(f457,plain,
( spl0_1
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f429,f454,f440]) ).
fof(f459,definition,
( spl0_5
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f461,plain,
( ~ ssList(sk6)
| spl0_5 ),
inference(avatar_component_clause,[],[f459]) ).
fof(f462,plain,
( spl0_1
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f428,f459,f440]) ).
fof(f464,definition,
( spl0_6
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f466,plain,
( ssItem(sk5)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f467,plain,
( spl0_1
| spl0_6 ),
inference(avatar_split_clause,[],[f427,f464,f440]) ).
fof(f469,definition,
( spl0_7
<=> ! [X2,X0,X1] :
( ~ ssItem(X0)
| sk3 != app(app(X2,cons(X0,nil)),X1)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| ssList(X2)
| ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f470,plain,
( ! [X2,X0,X1] :
( sk4 != app(app(X1,cons(X0,nil)),X2)
| sk3 != app(app(X2,cons(X0,nil)),X1)
| ~ ssItem(X0)
| ssList(X2)
| ssList(X1) )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f469]) ).
fof(f471,plain,
( spl0_1
| spl0_7 ),
inference(avatar_split_clause,[],[f426,f469,f440]) ).
fof(f478,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f432,f440]) ).
fof(f522,plain,
( sk4 != sk4
| sk3 != app(app(sk7,cons(sk5,nil)),sk6)
| ~ ssItem(sk5)
| ssList(sk7)
| ssList(sk6)
| ~ spl0_3
| ~ spl0_7 ),
inference(superposition,[],[f470,f451]) ).
fof(f523,plain,
( sk3 != app(app(sk7,cons(sk5,nil)),sk6)
| ~ ssItem(sk5)
| ssList(sk7)
| ssList(sk6)
| ~ spl0_3
| ~ spl0_7 ),
inference(trivial_inequality_removal,[],[f522]) ).
fof(f524,plain,
( ~ ssItem(sk5)
| ssList(sk7)
| ssList(sk6)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f523,f446]) ).
fof(f526,plain,
( ssList(sk7)
| ssList(sk6)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f524,f466]) ).
fof(f528,plain,
( ssList(sk6)
| ~ spl0_2
| ~ spl0_3
| spl0_4
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f526,f456]) ).
fof(f530,plain,
( $false
| ~ spl0_2
| ~ spl0_3
| spl0_4
| spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f528,f461]) ).
fof(f531,plain,
( ~ spl0_2
| ~ spl0_3
| spl0_4
| spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f530]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f447]) ).
cnf(s2,plain,
( spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f452]) ).
cnf(s3,plain,
( spl0_1
| ~ spl0_4 ),
inference(sat_conversion,[],[f457]) ).
cnf(s4,plain,
( spl0_1
| ~ spl0_5 ),
inference(sat_conversion,[],[f462]) ).
cnf(s5,plain,
( spl0_1
| spl0_6 ),
inference(sat_conversion,[],[f467]) ).
cnf(s6,plain,
( spl0_1
| spl0_7 ),
inference(sat_conversion,[],[f471]) ).
cnf(s13,plain,
~ spl0_1,
inference(sat_conversion,[],[f478]) ).
cnf(s24,plain,
( ~ spl0_2
| ~ spl0_3
| spl0_4
| spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(sat_conversion,[],[f531]) ).
cnf(s29,plain,
spl0_7,
inference(rat,[],[s6,s13]) ).
cnf(s30,plain,
spl0_6,
inference(rat,[],[s5,s13]) ).
cnf(s31,plain,
~ spl0_5,
inference(rat,[],[s4,s13]) ).
cnf(s32,plain,
~ spl0_4,
inference(rat,[],[s3,s13]) ).
cnf(s33,plain,
spl0_3,
inference(rat,[],[s2,s13]) ).
cnf(s34,plain,
~ spl0_2,
inference(rat,[],[s24,s29,s30,s31,s32,s33]) ).
cnf(s35,plain,
$false,
inference(rat,[],[s1,s34,s13]) ).
fof(f534,plain,
$false,
inference(avatar_sat_refutation,[],[s35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC422-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Mon Sep 28 09:36:04 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12 Running first-order model finding
% 0.08/0.12 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.15 % (3259631)Will run a generic schedule for satisfiability detection.
% 0.08/0.15 % (3259637)% WARNING: option uhcvi not known.
% 0.08/0.15 % (3259636)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1242693113_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.15 % (3259637)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1629182352:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.15 % (3259638)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=36346058:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.15 % (3259639)dis+10_1_sil=32000:sp=arity:random_seed=3036337982:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.15 % (3259640)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1991852881:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.15 % (3259641)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=564559695:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.15 % (3259642)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=272911488:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.15 % (3259639) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3259631-3259639"...
% 0.08/0.15 % (3259637) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3259631-3259637"...
% 0.08/0.15 % (3259639)...printing done.
% 0.08/0.15 % (3259637)...printing done.
% 0.08/0.15 % (3259638) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3259631-3259638"...
% 0.08/0.15 % (3259642) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3259631-3259642"...
% 0.08/0.15 % (3259637)Refutation found. Thanks to Tanya!
% 0.08/0.15 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.15 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.15 % (3259637)------------------------------
% 0.08/0.15 % (3259637)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.15 % (3259637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.15 % (3259637)CaDiCaL version: 2.1.3
% 0.08/0.15 % (3259637)Termination reason: Refutation
% 0.08/0.15 % (3259637)Time elapsed: 0.002 s
% 0.08/0.15 % (3259637)Peak memory usage: 12 MB
% 0.08/0.15 % (3259637)Instructions burned: 6 (million)
% 0.08/0.15 % (3259631)Success in time 0.027 s
% 0.08/0.15 % Vampire exiting
%------------------------------------------------------------------------------