%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC275+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 : n017.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:21 PM UTC 2026
% Result : Theorem 0.21s 0.30s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 22 unt; 7 def)
% Number of atoms : 180 ( 32 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 193 ( 84 ~; 77 |; 14 &)
% ( 9 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 24 !; 5 ?)
% 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(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)
| ( 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
| totalorderedP(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(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)
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) )
| ~ neq(X3,nil) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f302,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f305,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f367,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f180]) ).
fof(f368,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f411,plain,
( ~ neq(sK50,nil)
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f221]) ).
fof(f413,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f221]) ).
fof(f414,plain,
~ totalorderedP(sK47),
inference(cnf_transformation,[],[f221]) ).
fof(f415,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
ssList(sK50),
inference(cnf_transformation,[],[f221]) ).
fof(f423,plain,
~ totalorderedP(sK49),
inference(definition_unfolding,[],[f414,f415]) ).
fof(f513,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f302]) ).
fof(f569,plain,
! [X0] :
( ssItem(X0)
| ~ totalorderedP(cons(X0,nil)) ),
inference(consistent_polarity_flipping,[],[f367]) ).
fof(f570,plain,
~ totalorderedP(nil),
inference(consistent_polarity_flipping,[],[f368]) ).
fof(f597,plain,
totalorderedP(sK49),
inference(consistent_polarity_flipping,[],[f423]) ).
fof(f598,plain,
( neq(sK50,nil)
| ~ ssItem(sK51) ),
inference(consistent_polarity_flipping,[],[f412]) ).
fof(f599,plain,
( neq(sK50,nil)
| sK49 = cons(sK51,nil) ),
inference(consistent_polarity_flipping,[],[f411]) ).
fof(f613,definition,
( spl52_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f615,plain,
( neq(sK50,nil)
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f613]) ).
fof(f618,definition,
( spl52_3
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f620,plain,
( sK49 = cons(sK51,nil)
| ~ spl52_3 ),
inference(avatar_component_clause,[],[f618]) ).
fof(f621,plain,
( spl52_3
| spl52_2 ),
inference(avatar_split_clause,[],[f599,f613,f618]) ).
fof(f623,definition,
( spl52_4
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f625,plain,
( ~ ssItem(sK51)
| spl52_4 ),
inference(avatar_component_clause,[],[f623]) ).
fof(f626,plain,
( ~ spl52_4
| spl52_2 ),
inference(avatar_split_clause,[],[f598,f613,f623]) ).
fof(f628,definition,
( spl52_5
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f630,plain,
( nil = sK49
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f628]) ).
fof(f632,definition,
( spl52_6
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f634,plain,
( nil != sK50
| spl52_6 ),
inference(avatar_component_clause,[],[f632]) ).
fof(f635,plain,
( spl52_5
| ~ spl52_6 ),
inference(avatar_split_clause,[],[f413,f632,f628]) ).
fof(f641,definition,
( spl52_8
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl52_8])],[avatar_definition]) ).
fof(f642,plain,
( ssList(nil)
| ~ spl52_8 ),
inference(avatar_component_clause,[],[f641]) ).
fof(f651,definition,
( spl52_10
<=> ! [X0] :
( ssItem(X0)
| ~ totalorderedP(cons(X0,nil)) ) ),
introduced(definition,[new_symbols(definition,[spl52_10])],[avatar_definition]) ).
fof(f652,plain,
( ! [X0] :
( ~ totalorderedP(cons(X0,nil))
| ssItem(X0) )
| ~ spl52_10 ),
inference(avatar_component_clause,[],[f651]) ).
fof(f654,plain,
spl52_10,
inference(avatar_split_clause,[],[f569,f651]) ).
fof(f670,plain,
spl52_8,
inference(avatar_split_clause,[],[f305,f641]) ).
fof(f796,plain,
( totalorderedP(nil)
| ~ spl52_5 ),
inference(superposition,[],[f597,f630]) ).
fof(f808,plain,
( $false
| ~ spl52_5 ),
inference(forward_subsumption_resolution,[],[f796,f570]) ).
fof(f809,plain,
~ spl52_5,
inference(avatar_contradiction_clause,[],[f808]) ).
fof(f868,plain,
( ~ ssList(nil)
| nil = sK50
| ~ ssList(sK50)
| ~ spl52_2 ),
inference(resolution,[],[f513,f615]) ).
fof(f873,plain,
( nil = sK50
| ~ ssList(sK50)
| ~ spl52_2
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f868,f642]) ).
fof(f874,plain,
( ~ ssList(sK50)
| ~ spl52_2
| spl52_6
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f873,f634]) ).
fof(f875,plain,
( $false
| ~ spl52_2
| spl52_6
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f874,f417]) ).
fof(f876,plain,
( ~ spl52_2
| spl52_6
| ~ spl52_8 ),
inference(avatar_contradiction_clause,[],[f875]) ).
fof(f884,plain,
( ~ totalorderedP(sK49)
| ssItem(sK51)
| ~ spl52_3
| ~ spl52_10 ),
inference(superposition,[],[f652,f620]) ).
fof(f890,plain,
( ssItem(sK51)
| ~ spl52_3
| ~ spl52_10 ),
inference(forward_subsumption_resolution,[],[f884,f597]) ).
fof(f899,plain,
( $false
| ~ spl52_3
| spl52_4
| ~ spl52_10 ),
inference(forward_subsumption_resolution,[],[f890,f625]) ).
fof(f900,plain,
( ~ spl52_3
| spl52_4
| ~ spl52_10 ),
inference(avatar_contradiction_clause,[],[f899]) ).
cnf(s2,plain,
( spl52_2
| spl52_3 ),
inference(sat_conversion,[],[f621]) ).
cnf(s3,plain,
( spl52_2
| ~ spl52_4 ),
inference(sat_conversion,[],[f626]) ).
cnf(s4,plain,
( spl52_5
| ~ spl52_6 ),
inference(sat_conversion,[],[f635]) ).
cnf(s9,plain,
spl52_10,
inference(sat_conversion,[],[f654]) ).
cnf(s13,plain,
spl52_8,
inference(sat_conversion,[],[f670]) ).
cnf(s18,plain,
~ spl52_5,
inference(sat_conversion,[],[f809]) ).
cnf(s23,plain,
( ~ spl52_2
| spl52_6
| ~ spl52_8 ),
inference(sat_conversion,[],[f876]) ).
cnf(s24,plain,
( ~ spl52_3
| spl52_4
| ~ spl52_10 ),
inference(sat_conversion,[],[f900]) ).
cnf(s30,plain,
~ spl52_6,
inference(rat,[],[s4,s18]) ).
cnf(s31,plain,
~ spl52_2,
inference(rat,[],[s23,s13,s30]) ).
cnf(s32,plain,
~ spl52_4,
inference(rat,[],[s3,s31]) ).
cnf(s33,plain,
~ spl52_3,
inference(rat,[],[s24,s9,s32]) ).
cnf(s34,plain,
$false,
inference(rat,[],[s2,s33,s31]) ).
fof(f902,plain,
$false,
inference(avatar_sat_refutation,[],[s34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC275+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 : n017.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:44:36 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.21/0.30 % (3405412)Will run a generic schedule for satisfiability detection.
% 0.21/0.30 % (3405417)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=441725263_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.30 % (3405418)% WARNING: option uhcvi not known.
% 0.21/0.30 % (3405420)dis+10_1_sil=32000:sp=arity:random_seed=418044900:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.30 % (3405418)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=975031695:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.30 % (3405419)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1036593294:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.30 % TRYING [1]
% 0.21/0.30 % (3405421)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=243128574:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.30 % (3405422)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2694660447:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.30 % TRYING [2]
% 0.21/0.30 % (3405423)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2603386686:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.30 % TRYING [3]
% 0.21/0.30 % TRYING [4]
% 0.21/0.30 % (3405418) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3405412-3405418"...
% 0.21/0.30 % (3405420) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3405412-3405420"...
% 0.21/0.30 % (3405418)...printing done.
% 0.21/0.30 % (3405418)Refutation found. Thanks to Tanya!
% 0.21/0.30 % SZS status Theorem for theBenchmark
% 0.21/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.30 % (3405418)------------------------------
% 0.21/0.30 % (3405418)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30 % (3405418)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30 % (3405418)CaDiCaL version: 2.1.3
% 0.21/0.30 % (3405418)Termination reason: Refutation
% 0.21/0.30 % (3405418)Time elapsed: 0.014 s
% 0.21/0.30 % (3405418)Peak memory usage: 13 MB
% 0.21/0.30 % (3405418)Instructions burned: 20 (million)
% 0.21/0.30 % (3405412)Success in time 0.052 s
% 0.21/0.30 % Vampire exiting
%------------------------------------------------------------------------------