%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC339+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 : n005.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 : Theorem 0.20s 0.31s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 16 unt; 2 def)
% Number of atoms : 188 ( 42 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 237 ( 87 ~; 74 |; 58 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 42 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ totalorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& leq(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& leq(X12,X10) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( segmentP(X1,X0)
& totalorderedP(X0) ) ) ) ) ) ),
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
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ totalorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& leq(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& leq(X12,X10) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( segmentP(X1,X0)
& totalorderedP(X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& totalorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ leq(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ leq(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& totalorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ leq(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ leq(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f413,plain,
ssList(sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
totalorderedP(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
sK50 = app(app(sK51,sK49),sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
ssList(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( ~ totalorderedP(sK47)
| ~ segmentP(sK48,sK47) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f427,plain,
( ~ totalorderedP(sK49)
| ~ segmentP(sK50,sK49) ),
inference(definition_unfolding,[],[f418,f420,f421,f420]) ).
fof(f433,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f241]) ).
fof(f467,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(app(app(X2,X1),X3),X1) ),
inference(consistent_polarity_flipping,[],[f433]) ).
fof(f576,plain,
( totalorderedP(sK49)
| segmentP(sK50,sK49) ),
inference(consistent_polarity_flipping,[],[f427]) ).
fof(f577,plain,
~ totalorderedP(sK49),
inference(consistent_polarity_flipping,[],[f414]) ).
fof(f597,definition,
( spl53_3
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f599,plain,
( segmentP(sK50,sK49)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f601,definition,
( spl53_4
<=> totalorderedP(sK49) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f604,plain,
( spl53_3
| spl53_4 ),
inference(avatar_split_clause,[],[f576,f601,f597]) ).
fof(f640,plain,
~ spl53_4,
inference(avatar_split_clause,[],[f577,f601]) ).
fof(f1970,plain,
( ~ ssList(sK50)
| ~ ssList(sK49)
| ~ ssList(sK52)
| ~ ssList(sK51)
| ~ segmentP(sK50,sK49) ),
inference(superposition,[],[f467,f415]) ).
fof(f1973,plain,
( ~ ssList(sK49)
| ~ ssList(sK52)
| ~ ssList(sK51)
| ~ segmentP(sK50,sK49) ),
inference(forward_subsumption_resolution,[],[f1970,f419]) ).
fof(f1980,plain,
( ~ ssList(sK52)
| ~ ssList(sK51)
| ~ segmentP(sK50,sK49) ),
inference(forward_subsumption_resolution,[],[f1973,f422]) ).
fof(f1986,plain,
( ~ ssList(sK51)
| ~ segmentP(sK50,sK49) ),
inference(forward_subsumption_resolution,[],[f1980,f413]) ).
fof(f1987,plain,
~ segmentP(sK50,sK49),
inference(forward_subsumption_resolution,[],[f1986,f416]) ).
fof(f1988,plain,
( $false
| ~ spl53_3 ),
inference(forward_subsumption_resolution,[],[f1987,f599]) ).
fof(f1989,plain,
~ spl53_3,
inference(avatar_contradiction_clause,[],[f1988]) ).
cnf(s2,plain,
( spl53_3
| spl53_4 ),
inference(sat_conversion,[],[f604]) ).
cnf(s12,plain,
~ spl53_4,
inference(sat_conversion,[],[f640]) ).
cnf(s76,plain,
~ spl53_3,
inference(sat_conversion,[],[f1989]) ).
cnf(s83,plain,
$false,
inference(rat,[],[s2,s12,s76]) ).
fof(f1990,plain,
$false,
inference(avatar_sat_refutation,[],[s83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC339+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n005.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 09:11:02 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.31 % (655439)Will run a generic schedule for satisfiability detection.
% 0.20/0.31 % (655449)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=496162007:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.31 % (655445)% WARNING: option uhcvi not known.
% 0.20/0.31 % (655446)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3421536619:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.31 % (655444)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=659692945_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.31 % (655445)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1367898050:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.31 % (655447)dis+10_1_sil=32000:sp=arity:random_seed=2005167962:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.31 % (655448)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3288966878:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.31 % (655450)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2919333069:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.31 % TRYING [1]
% 0.20/0.31 % TRYING [2]
% 0.20/0.31 % TRYING [3]
% 0.20/0.31 % (655449)Instruction limit reached!
% 0.20/0.31 % (655449)------------------------------
% 0.20/0.31 % (655449)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (655449)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (655449)CaDiCaL version: 2.1.3
% 0.20/0.31 % (655449)Termination reason: Instruction limit
% 0.20/0.31 % (655449)Termination phase: Saturation
% 0.20/0.31 % (655449)Time elapsed: 0.041 s
% 0.20/0.31 % (655449)Peak memory usage: 14 MB
% 0.20/0.31 % (655449)Instructions burned: 132 (million)
% 0.20/0.31 % (655445) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-655439-655445"...
% 0.20/0.31 % (655445)...printing done.
% 0.20/0.31 % TRYING [4]
% 0.20/0.31 % (655445)Refutation found. Thanks to Tanya!
% 0.20/0.31 % SZS status Theorem for theBenchmark
% 0.20/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.31 % (655445)------------------------------
% 0.20/0.31 % (655445)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (655445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (655445)CaDiCaL version: 2.1.3
% 0.20/0.31 % (655445)Termination reason: Refutation
% 0.20/0.31 % (655445)Time elapsed: 0.037 s
% 0.20/0.31 % (655445)Peak memory usage: 13 MB
% 0.20/0.31 % (655445)Instructions burned: 59 (million)
% 0.20/0.31 % (655439)Success in time 0.077 s
% 0.20/0.31 % Vampire exiting
%------------------------------------------------------------------------------