%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC104+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 : n004.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:04:41 PM UTC 2026
% Result : Theorem 0.16s 0.49s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 66 ( 18 unt; 5 def)
% Number of atoms : 228 ( 46 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 258 ( 96 ~; 95 |; 42 &)
% ( 9 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 41 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& leq(X7,X5) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( neq(X0,nil)
& frontsegP(X1,X0) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& leq(X7,X5) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( neq(X0,nil)
& frontsegP(X1,X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ? [X4] :
( app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5) ) ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ? [X4] :
( app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5) ) ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f237,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f318,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f412,plain,
ssList(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
sK50 = app(sK49,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( nil != sK49
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( ~ frontsegP(sK48,sK47)
| ~ neq(sK47,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f418,f420]) ).
fof(f427,plain,
( ~ frontsegP(sK50,sK49)
| ~ neq(sK49,nil) ),
inference(definition_unfolding,[],[f416,f420,f419,f419]) ).
fof(f431,plain,
! [X2,X1] :
( ~ ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(equality_resolution,[],[f237]) ).
fof(f461,definition,
( spl52_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f463,plain,
( nil = sK50
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f465,definition,
( spl52_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f466,plain,
( nil = sK49
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f465]) ).
fof(f467,plain,
( nil != sK49
| spl52_2 ),
inference(avatar_component_clause,[],[f465]) ).
fof(f468,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f415,f465,f461]) ).
fof(f470,definition,
( spl52_3
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f472,plain,
( ~ neq(sK49,nil)
| spl52_3 ),
inference(avatar_component_clause,[],[f470]) ).
fof(f474,definition,
( spl52_4
<=> frontsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f476,plain,
( ~ frontsegP(sK50,sK49)
| spl52_4 ),
inference(avatar_component_clause,[],[f474]) ).
fof(f477,plain,
( ~ spl52_3
| ~ spl52_4 ),
inference(avatar_split_clause,[],[f427,f474,f470]) ).
fof(f479,definition,
( spl52_5
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f480,plain,
( ssList(nil)
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f479]) ).
fof(f507,plain,
spl52_5,
inference(avatar_split_clause,[],[f306,f479]) ).
fof(f509,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f431,f318]) ).
fof(f729,plain,
( frontsegP(sK50,sK49)
| ~ ssList(sK51)
| ~ ssList(sK49) ),
inference(superposition,[],[f509,f414]) ).
fof(f733,plain,
( ~ ssList(sK51)
| ~ ssList(sK49)
| spl52_4 ),
inference(forward_subsumption_resolution,[],[f729,f476]) ).
fof(f734,plain,
( ~ ssList(sK49)
| spl52_4 ),
inference(forward_subsumption_resolution,[],[f733,f412]) ).
fof(f735,plain,
( $false
| spl52_4 ),
inference(forward_subsumption_resolution,[],[f734,f421]) ).
fof(f736,plain,
spl52_4,
inference(avatar_contradiction_clause,[],[f735]) ).
fof(f754,plain,
( ~ ssList(nil)
| nil = sK49
| ~ ssList(sK49)
| spl52_3 ),
inference(resolution,[],[f303,f472]) ).
fof(f757,plain,
( nil = sK49
| ~ ssList(sK49)
| spl52_3
| ~ spl52_5 ),
inference(forward_subsumption_resolution,[],[f754,f480]) ).
fof(f758,plain,
( ~ ssList(sK49)
| spl52_2
| spl52_3
| ~ spl52_5 ),
inference(forward_subsumption_resolution,[],[f757,f467]) ).
fof(f759,plain,
( $false
| spl52_2
| spl52_3
| ~ spl52_5 ),
inference(forward_subsumption_resolution,[],[f758,f421]) ).
fof(f760,plain,
( spl52_2
| spl52_3
| ~ spl52_5 ),
inference(avatar_contradiction_clause,[],[f759]) ).
fof(f762,plain,
( neq(nil,nil)
| ~ spl52_1 ),
inference(superposition,[],[f426,f463]) ).
fof(f779,plain,
( ~ neq(nil,nil)
| ~ spl52_2
| spl52_3 ),
inference(superposition,[],[f472,f466]) ).
fof(f794,plain,
( $false
| ~ spl52_1
| ~ spl52_2
| spl52_3 ),
inference(forward_subsumption_resolution,[],[f779,f762]) ).
fof(f795,plain,
( ~ spl52_1
| ~ spl52_2
| spl52_3 ),
inference(avatar_contradiction_clause,[],[f794]) ).
cnf(s1,plain,
( spl52_1
| ~ spl52_2 ),
inference(sat_conversion,[],[f468]) ).
cnf(s2,plain,
( ~ spl52_3
| ~ spl52_4 ),
inference(sat_conversion,[],[f477]) ).
cnf(s10,plain,
spl52_5,
inference(sat_conversion,[],[f507]) ).
cnf(s21,plain,
spl52_4,
inference(sat_conversion,[],[f736]) ).
cnf(s23,plain,
( spl52_2
| spl52_3
| ~ spl52_5 ),
inference(sat_conversion,[],[f760]) ).
cnf(s25,plain,
( ~ spl52_1
| ~ spl52_2
| spl52_3 ),
inference(sat_conversion,[],[f795]) ).
cnf(s29,plain,
~ spl52_3,
inference(rat,[],[s2,s21]) ).
cnf(s30,plain,
spl52_2,
inference(rat,[],[s23,s10,s29]) ).
cnf(s31,plain,
~ spl52_1,
inference(rat,[],[s25,s29,s30]) ).
cnf(s32,plain,
$false,
inference(rat,[],[s1,s30,s31]) ).
fof(f797,plain,
$false,
inference(avatar_sat_refutation,[],[s32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC104+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.11/0.39 % Computer : n004.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 07:53:23 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.16/0.49 % (192809)Will run a generic schedule for satisfiability detection.
% 0.16/0.49 % (192814)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3901683248_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.49 % (192815)% WARNING: option uhcvi not known.
% 0.16/0.49 % (192815)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=329890517:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.49 % (192816)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1289549284:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.49 % (192817)dis+10_1_sil=32000:sp=arity:random_seed=619534009:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.49 % TRYING [1]
% 0.16/0.49 % (192818)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=303205082:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.49 % (192819)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3257559478:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.49 % TRYING [2]
% 0.16/0.49 % (192820)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=697356279:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.49 % TRYING [3]
% 0.16/0.49 % TRYING [4]
% 0.16/0.49 % (192818) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-192809-192818"...
% 0.16/0.49 % (192815) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-192809-192815"...
% 0.16/0.49 % (192818)...printing done.
% 0.16/0.49 % (192815)...printing done.
% 0.16/0.49 % (192818)Refutation found. Thanks to Tanya!
% 0.16/0.49 % SZS status Theorem for theBenchmark
% 0.16/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.49 % (192818)------------------------------
% 0.16/0.49 % (192818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.49 % (192818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.49 % (192818)CaDiCaL version: 2.1.3
% 0.16/0.49 % (192818)Termination reason: Refutation
% 0.16/0.49 % (192818)Time elapsed: 0.019 s
% 0.16/0.49 % (192818)Peak memory usage: 13 MB
% 0.16/0.49 % (192818)Instructions burned: 31 (million)
% 0.16/0.49 % (192809)Success in time 0.061 s
% 0.16/0.49 % Vampire exiting
%------------------------------------------------------------------------------