%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC038+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 : n010.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:23 PM UTC 2026
% Result : Theorem 0.13s 0.46s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 15 unt; 3 def)
% Number of atoms : 123 ( 46 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 124 ( 40 ~; 37 |; 33 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn 13 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f158,plain,
! [X0] :
( ( frontsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f283,plain,
! [X0] :
( ( ( frontsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ frontsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f158]) ).
fof(f296,plain,
( nil = sK54
& sK54 = sK56
& sK53 = sK55
& nil != sK53
& ( ( nil = sK56
& nil = sK55 )
| ( neq(sK55,nil)
& frontsegP(sK56,sK55) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f429,plain,
! [X0] :
( nil = X0
| ~ frontsegP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f283]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil = sK55
| frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
nil != sK53,
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
nil = sK54,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
nil = sK56,
inference(definition_unfolding,[],[f507,f506]) ).
fof(f523,plain,
! [X0] :
( ~ frontsegP(sK56,X0)
| sK56 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f429,f508,f508]) ).
fof(f567,plain,
sK55 != sK56,
inference(definition_unfolding,[],[f504,f508,f505]) ).
fof(f571,plain,
( sK55 = sK56
| frontsegP(sK56,sK55) ),
inference(definition_unfolding,[],[f500,f508]) ).
fof(f573,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f505]) ).
fof(f741,definition,
( spl57_1
<=> frontsegP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f743,plain,
( frontsegP(sK56,sK55)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f741]) ).
fof(f745,definition,
( spl57_2
<=> sK55 = sK56 ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f748,plain,
( spl57_1
| spl57_2 ),
inference(avatar_split_clause,[],[f571,f745,f741]) ).
fof(f754,plain,
~ spl57_2,
inference(avatar_split_clause,[],[f567,f745]) ).
fof(f794,plain,
( sK55 = sK56
| ~ ssList(sK55)
| ~ spl57_1 ),
inference(resolution,[],[f523,f743]) ).
fof(f799,definition,
( spl57_10
<=> ssList(sK55) ),
introduced(definition,[new_symbols(definition,[spl57_10])],[avatar_definition]) ).
fof(f801,plain,
( ~ ssList(sK55)
| spl57_10 ),
inference(avatar_component_clause,[],[f799]) ).
fof(f802,plain,
( ~ spl57_10
| spl57_2
| ~ spl57_1 ),
inference(avatar_split_clause,[],[f794,f741,f745,f799]) ).
fof(f803,plain,
( $false
| spl57_10 ),
inference(resolution,[],[f801,f573]) ).
fof(f804,plain,
spl57_10,
inference(avatar_contradiction_clause,[],[f803]) ).
cnf(s1,plain,
( spl57_1
| spl57_2 ),
inference(sat_conversion,[],[f748]) ).
cnf(s3,plain,
~ spl57_2,
inference(sat_conversion,[],[f754]) ).
cnf(s12,plain,
( ~ spl57_1
| spl57_2
| ~ spl57_10 ),
inference(sat_conversion,[],[f802]) ).
cnf(s13,plain,
spl57_10,
inference(sat_conversion,[],[f804]) ).
cnf(s14,plain,
( ~ spl57_1
| spl57_2 ),
inference(rat,[],[s12,s13]) ).
cnf(s18,plain,
~ spl57_1,
inference(rat,[],[s14,s3]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s1,s3,s18]) ).
fof(f805,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC038+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.13/0.38 % Computer : n010.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 28 07:32:51 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 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.13/0.46 % (1742007)Will run a generic schedule for satisfiability detection.
% 0.13/0.46 % (1742018)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1140287752:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.46 % (1742013)% WARNING: option uhcvi not known.
% 0.13/0.46 % (1742018) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1742007-1742018"...
% 0.13/0.46 % (1742012)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3065178237_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.46 % (1742013)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1176554190:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.46 % (1742015)dis+10_1_sil=32000:sp=arity:random_seed=171766404:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.46 % (1742014)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1891112599:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.46 % (1742016)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1832090590:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.46 % (1742018)...printing done.
% 0.13/0.46 % (1742017)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=387300730:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.46 % (1742018)Refutation found. Thanks to Tanya!
% 0.13/0.46 % SZS status Theorem for theBenchmark
% 0.13/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.46 % (1742018)------------------------------
% 0.13/0.46 % (1742018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.46 % (1742018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.46 % (1742018)CaDiCaL version: 2.1.3
% 0.13/0.46 % (1742018)Termination reason: Refutation
% 0.13/0.46 % (1742018)Time elapsed: 0.006 s
% 0.13/0.46 % (1742018)Peak memory usage: 13 MB
% 0.13/0.46 % (1742018)Instructions burned: 15 (million)
% 0.13/0.46 % (1742007)Success in time 0.031 s
% 0.13/0.46 % Vampire exiting
%------------------------------------------------------------------------------