%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC336-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 : n019.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:36 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.30s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 30
% Syntax : Number of formulae : 106 ( 19 unt; 12 def)
% Number of atoms : 244 ( 30 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 243 ( 105 ~; 126 |; 0 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 13 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause4) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f67,axiom,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause67) ).
fof(f79,axiom,
! [X0] :
( nil != X0
| ~ ssList(X0)
| segmentP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
fof(f187,axiom,
! [X2,X3,X0,X1] :
( app(app(X0,X1),X2) != X3
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X3)
| segmentP(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f207,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( ssList(sk6)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( ssList(sk7)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f212,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f213,plain,
( sk4 = app(app(sk6,sk3),sk7)
| nil = sk4 ),
inference(reorient_equations,[],[f212]) ).
fof(f216,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f217,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f218,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f219,plain,
( sk3 = cons(sk5,nil)
| nil = sk3 ),
inference(reorient_equations,[],[f218]) ).
fof(f220,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f221,plain,
( sk4 = app(app(sk6,sk3),sk7)
| nil = sk3 ),
inference(reorient_equations,[],[f220]) ).
fof(f224,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ totalorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
fof(f227,plain,
( ~ segmentP(sk4,sk3)
| ~ totalorderedP(sk3) ),
inference(definition_unfolding,[],[f224,f204,f205,f205]) ).
fof(f228,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f79]) ).
fof(f242,plain,
! [X2,X0,X1] :
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f254,plain,
~ totalorderedP(nil),
inference(consistent_polarity_flipping,[],[f4]) ).
fof(f282,plain,
! [X0] :
( ssItem(X0)
| ~ totalorderedP(cons(X0,nil)) ),
inference(consistent_polarity_flipping,[],[f67]) ).
fof(f368,plain,
( ~ ssItem(sk5)
| nil = sk3 ),
inference(consistent_polarity_flipping,[],[f207]) ).
fof(f373,plain,
( ~ segmentP(sk4,sk3)
| totalorderedP(sk3) ),
inference(consistent_polarity_flipping,[],[f227]) ).
fof(f381,definition,
( spl0_1
<=> totalorderedP(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f383,plain,
( totalorderedP(sk3)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f381]) ).
fof(f385,definition,
( spl0_2
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f387,plain,
( ~ segmentP(sk4,sk3)
| spl0_2 ),
inference(avatar_component_clause,[],[f385]) ).
fof(f388,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f373,f385,f381]) ).
fof(f390,definition,
( spl0_3
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f392,plain,
( nil = sk3
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f390]) ).
fof(f402,definition,
( spl0_6
<=> sk4 = app(app(sk6,sk3),sk7) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f404,plain,
( sk4 = app(app(sk6,sk3),sk7)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f402]) ).
fof(f405,plain,
( spl0_3
| spl0_6 ),
inference(avatar_split_clause,[],[f221,f402,f390]) ).
fof(f407,definition,
( spl0_7
<=> sk3 = cons(sk5,nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f409,plain,
( sk3 = cons(sk5,nil)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f407]) ).
fof(f410,plain,
( spl0_3
| spl0_7 ),
inference(avatar_split_clause,[],[f219,f407,f390]) ).
fof(f412,definition,
( spl0_8
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f414,plain,
( ssList(sk7)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f412]) ).
fof(f415,plain,
( spl0_3
| spl0_8 ),
inference(avatar_split_clause,[],[f217,f412,f390]) ).
fof(f417,definition,
( spl0_9
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f419,plain,
( ssList(sk6)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f417]) ).
fof(f420,plain,
( spl0_3
| spl0_9 ),
inference(avatar_split_clause,[],[f216,f417,f390]) ).
fof(f422,definition,
( spl0_10
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f424,plain,
( nil = sk4
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f422]) ).
fof(f427,plain,
( spl0_10
| spl0_6 ),
inference(avatar_split_clause,[],[f213,f402,f422]) ).
fof(f429,plain,
( spl0_10
| spl0_8 ),
inference(avatar_split_clause,[],[f209,f412,f422]) ).
fof(f430,plain,
( spl0_10
| spl0_9 ),
inference(avatar_split_clause,[],[f208,f417,f422]) ).
fof(f432,definition,
( spl0_11
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f434,plain,
( ~ ssItem(sk5)
| spl0_11 ),
inference(avatar_component_clause,[],[f432]) ).
fof(f435,plain,
( spl0_3
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f368,f432,f390]) ).
fof(f442,definition,
( spl0_13
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f447,definition,
( spl0_14
<=> ! [X1] :
( ssItem(X1)
| ~ totalorderedP(cons(X1,nil)) ) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f448,plain,
( ! [X1] :
( ~ totalorderedP(cons(X1,nil))
| ssItem(X1) )
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f447]) ).
fof(f465,definition,
( spl0_18
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).
fof(f467,plain,
( segmentP(nil,nil)
| ~ spl0_18 ),
inference(avatar_component_clause,[],[f465]) ).
fof(f468,plain,
( spl0_18
| ~ spl0_13 ),
inference(avatar_split_clause,[],[f228,f442,f465]) ).
fof(f476,plain,
spl0_14,
inference(avatar_split_clause,[],[f282,f447]) ).
fof(f478,plain,
spl0_13,
inference(avatar_split_clause,[],[f8,f442]) ).
fof(f791,plain,
( ~ segmentP(nil,sk3)
| spl0_2
| ~ spl0_10 ),
inference(superposition,[],[f387,f424]) ).
fof(f793,plain,
( ~ segmentP(nil,nil)
| spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(forward_demodulation,[],[f791,f392]) ).
fof(f794,plain,
( $false
| spl0_2
| ~ spl0_3
| ~ spl0_10
| ~ spl0_18 ),
inference(forward_subsumption_resolution,[],[f793,f467]) ).
fof(f795,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_10
| ~ spl0_18 ),
inference(avatar_contradiction_clause,[],[f794]) ).
fof(f1752,plain,
( ~ ssList(sk4)
| ~ ssList(sk6)
| ~ ssList(sk3)
| ~ ssList(sk7)
| segmentP(sk4,sk3)
| ~ spl0_6 ),
inference(superposition,[],[f242,f404]) ).
fof(f1755,plain,
( ~ ssList(sk6)
| ~ ssList(sk3)
| ~ ssList(sk7)
| segmentP(sk4,sk3)
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f1752,f203]) ).
fof(f1761,plain,
( ~ ssList(sk3)
| ~ ssList(sk7)
| segmentP(sk4,sk3)
| ~ spl0_6
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1755,f419]) ).
fof(f1766,plain,
( ~ ssList(sk7)
| segmentP(sk4,sk3)
| ~ spl0_6
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1761,f202]) ).
fof(f1768,plain,
( segmentP(sk4,sk3)
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1766,f414]) ).
fof(f1816,plain,
( spl0_2
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f1768,f417,f412,f402,f385]) ).
fof(f1856,plain,
( totalorderedP(nil)
| ~ spl0_1
| ~ spl0_3 ),
inference(superposition,[],[f383,f392]) ).
fof(f1870,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f1856,f254]) ).
fof(f1871,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f1870]) ).
fof(f1974,plain,
( ~ totalorderedP(sk3)
| ssItem(sk5)
| ~ spl0_7
| ~ spl0_14 ),
inference(superposition,[],[f448,f409]) ).
fof(f1975,plain,
( ssItem(sk5)
| ~ spl0_1
| ~ spl0_7
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f1974,f383]) ).
fof(f1976,plain,
( $false
| ~ spl0_1
| ~ spl0_7
| spl0_11
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f1975,f434]) ).
fof(f1977,plain,
( ~ spl0_1
| ~ spl0_7
| spl0_11
| ~ spl0_14 ),
inference(avatar_contradiction_clause,[],[f1976]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f388]) ).
cnf(s4,plain,
( spl0_3
| spl0_6 ),
inference(sat_conversion,[],[f405]) ).
cnf(s5,plain,
( spl0_3
| spl0_7 ),
inference(sat_conversion,[],[f410]) ).
cnf(s6,plain,
( spl0_3
| spl0_8 ),
inference(sat_conversion,[],[f415]) ).
cnf(s7,plain,
( spl0_3
| spl0_9 ),
inference(sat_conversion,[],[f420]) ).
cnf(s10,plain,
( spl0_6
| spl0_10 ),
inference(sat_conversion,[],[f427]) ).
cnf(s12,plain,
( spl0_8
| spl0_10 ),
inference(sat_conversion,[],[f429]) ).
cnf(s13,plain,
( spl0_9
| spl0_10 ),
inference(sat_conversion,[],[f430]) ).
cnf(s14,plain,
( spl0_3
| ~ spl0_11 ),
inference(sat_conversion,[],[f435]) ).
cnf(s21,plain,
( ~ spl0_13
| spl0_18 ),
inference(sat_conversion,[],[f468]) ).
cnf(s23,plain,
spl0_14,
inference(sat_conversion,[],[f476]) ).
cnf(s25,plain,
spl0_13,
inference(sat_conversion,[],[f478]) ).
cnf(s32,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_10
| ~ spl0_18 ),
inference(sat_conversion,[],[f795]) ).
cnf(s71,plain,
( spl0_2
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(sat_conversion,[],[f1816]) ).
cnf(s80,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(sat_conversion,[],[f1871]) ).
cnf(s94,plain,
( ~ spl0_1
| ~ spl0_7
| spl0_11
| ~ spl0_14 ),
inference(sat_conversion,[],[f1977]) ).
cnf(s95,plain,
spl0_18,
inference(rat,[],[s21,s25]) ).
cnf(s99,plain,
( spl0_3
| spl0_2 ),
inference(rat,[],[s71,s4,s6,s7]) ).
cnf(s100,plain,
( ~ spl0_3
| spl0_2 ),
inference(rat,[],[s71,s10,s12,s13,s32,s95]) ).
cnf(s101,plain,
spl0_2,
inference(rat,[],[s100,s99]) ).
cnf(s102,plain,
spl0_1,
inference(rat,[],[s1,s101]) ).
cnf(s103,plain,
~ spl0_3,
inference(rat,[],[s80,s102]) ).
cnf(s108,plain,
~ spl0_11,
inference(rat,[],[s14,s103]) ).
cnf(s111,plain,
spl0_7,
inference(rat,[],[s5,s103]) ).
cnf(s115,plain,
$false,
inference(rat,[],[s94,s23,s102,s108,s111]) ).
fof(f1978,plain,
$false,
inference(avatar_sat_refutation,[],[s115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC336-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.19 % Computer : n019.cluster.edu
% 0.06/0.19 % Model : x86_64 x86_64
% 0.06/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.19 % Memory : 8046.5625MB
% 0.06/0.19 % OS : Linux 6.8.0-71-generic
% 0.06/0.19 % CPULimit : 300
% 0.06/0.19 % WCLimit : 300
% 0.06/0.19 % DateTime : Mon Sep 28 09:09:49 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.22 Running first-order model finding
% 0.06/0.22 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.18/0.30 % (3865805)Will run a generic schedule for satisfiability detection.
% 0.18/0.30 % (3865813)dis+10_1_sil=32000:sp=arity:random_seed=695947341:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.30 % (3865811)% WARNING: option uhcvi not known.
% 0.18/0.30 % (3865810)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=175539147_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.30 % (3865811)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3843880806:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.30 % (3865812)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3618246964:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.30 % (3865814)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=969260175:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.30 % (3865816)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2401015023:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.30 % (3865815)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2146239545:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.30 % TRYING [1]
% 0.18/0.30 % TRYING [2]
% 0.18/0.30 % TRYING [3]
% 0.18/0.30 % (3865813)Instruction limit reached!
% 0.18/0.30 % (3865813)------------------------------
% 0.18/0.30 % (3865813)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.30 % (3865813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.30 % (3865813)CaDiCaL version: 2.1.3
% 0.18/0.30 % (3865813)Termination reason: Instruction limit
% 0.18/0.30 % (3865813)Termination phase: Saturation
% 0.18/0.30 % (3865813)Time elapsed: 0.033 s
% 0.18/0.30 % (3865813)Peak memory usage: 13 MB
% 0.18/0.30 % (3865813)Instructions burned: 105 (million)
% 0.18/0.30 % (3865824)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2341969937:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.30 % (3865811) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3865805-3865811"...
% 0.18/0.30 % TRYING [4]
% 0.18/0.30 % (3865811)...printing done.
% 0.18/0.30 % (3865811)Refutation found. Thanks to Tanya!
% 0.18/0.30 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.31 % (3865811)------------------------------
% 0.18/0.31 % (3865811)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.31 % (3865811)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.31 % (3865811)CaDiCaL version: 2.1.3
% 0.18/0.31 % (3865811)Termination reason: Refutation
% 0.18/0.31 % (3865811)Time elapsed: 0.039 s
% 0.18/0.31 % (3865811)Peak memory usage: 13 MB
% 0.18/0.31 % (3865811)Instructions burned: 61 (million)
% 0.18/0.31 % (3865805)Success in time 0.077 s
% 0.18/0.31 % Vampire exiting
%------------------------------------------------------------------------------