%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC019+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 : 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:04:18 PM UTC 2026
% Result : Theorem 0.25s 0.46s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 44 ( 18 unt; 1 def)
% Number of atoms : 132 ( 35 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 141 ( 53 ~; 50 |; 24 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 36 ( 0 sgn 26 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
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(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| X3 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X1,X4)
& frontsegP(X0,X4) )
| ( nil = X1
& nil = 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
| X3 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X1,X4)
& frontsegP(X0,X4) )
| ( nil = X1
& nil = X0 ) ) ) ) ) ),
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(f153,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& X2 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ frontsegP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& X2 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ frontsegP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f340,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f411,plain,
! [X4] :
( ~ frontsegP(sK47,X4)
| ~ frontsegP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( nil != sK47
| nil != sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
sK49 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
ssList(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK47 = sK50,
inference(definition_unfolding,[],[f415,f414]) ).
fof(f421,plain,
ssList(sK50),
inference(definition_unfolding,[],[f419,f420]) ).
fof(f424,plain,
( nil != sK50
| nil != sK50 ),
inference(definition_unfolding,[],[f412,f420,f416]) ).
fof(f425,plain,
! [X4] :
( ~ frontsegP(sK50,X4)
| ~ frontsegP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f411,f420,f416]) ).
fof(f531,plain,
! [X0,X1] :
( neq(X0,X1)
| ssList(X1)
| X0 = X1
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f533,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f306]) ).
fof(f566,plain,
! [X0] :
( frontsegP(X0,X0)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f340]) ).
fof(f633,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f421]) ).
fof(f637,plain,
! [X4] :
( ~ frontsegP(sK50,X4)
| ~ frontsegP(sK50,X4)
| ~ neq(X4,nil)
| ssList(X4) ),
inference(consistent_polarity_flipping,[],[f425]) ).
fof(f638,plain,
! [X4] :
( ~ frontsegP(sK50,X4)
| ~ neq(X4,nil)
| ssList(X4) ),
inference(duplicate_literal_removal,[],[f637]) ).
fof(f639,plain,
nil != sK50,
inference(duplicate_literal_removal,[],[f424]) ).
fof(f652,definition,
( spl51_2
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f653,plain,
( ~ ssList(nil)
| spl51_2 ),
inference(avatar_component_clause,[],[f652]) ).
fof(f681,plain,
~ spl51_2,
inference(avatar_split_clause,[],[f533,f652]) ).
fof(f682,plain,
( ssList(sK50)
| ~ neq(sK50,nil)
| ssList(sK50) ),
inference(resolution,[],[f566,f638]) ).
fof(f683,plain,
( ssList(sK50)
| ~ neq(sK50,nil) ),
inference(duplicate_literal_removal,[],[f682]) ).
fof(f684,plain,
~ neq(sK50,nil),
inference(forward_subsumption_resolution,[],[f683,f633]) ).
fof(f780,plain,
( ssList(nil)
| nil = sK50
| ssList(sK50) ),
inference(resolution,[],[f531,f684]) ).
fof(f787,plain,
( nil = sK50
| ssList(sK50)
| spl51_2 ),
inference(forward_subsumption_resolution,[],[f780,f653]) ).
fof(f788,plain,
( ssList(sK50)
| spl51_2 ),
inference(forward_subsumption_resolution,[],[f787,f639]) ).
fof(f789,plain,
( $false
| spl51_2 ),
inference(forward_subsumption_resolution,[],[f788,f633]) ).
fof(f790,plain,
spl51_2,
inference(avatar_contradiction_clause,[],[f789]) ).
cnf(s9,plain,
~ spl51_2,
inference(sat_conversion,[],[f681]) ).
cnf(s11,plain,
spl51_2,
inference(sat_conversion,[],[f790]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s9,s11]) ).
fof(f791,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC019+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.10/0.37 % Computer : n005.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 07:27:01 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.25/0.46 % (620227)Will run a generic schedule for satisfiability detection.
% 0.25/0.46 % (620232)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1595810176_2999 on theBenchmark for (2999ds/0Mi)
% 0.25/0.46 % (620233)% WARNING: option uhcvi not known.
% 0.25/0.46 % TRYING [1]
% 0.25/0.46 % (620234)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=958645599:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.46 % (620235)dis+10_1_sil=32000:sp=arity:random_seed=4071128763:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.25/0.46 % (620236)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2949984014:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.46 % (620237)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1091336009:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.25/0.46 % TRYING [2]
% 0.25/0.46 % (620238)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2773562756:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.25/0.46 % (620233)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=355771743:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.25/0.46 % TRYING [3]
% 0.25/0.46 % (620233) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-620227-620233"...
% 0.25/0.46 % TRYING [4]
% 0.25/0.46 % (620233)...printing done.
% 0.25/0.46 % (620235) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-620227-620235"...
% 0.25/0.46 % (620236) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-620227-620236"...
% 0.25/0.46 % (620233)Refutation found. Thanks to Tanya!
% 0.25/0.46 % SZS status Theorem for theBenchmark
% 0.25/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.46 % (620233)------------------------------
% 0.25/0.46 % (620233)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.46 % (620233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.46 % (620233)CaDiCaL version: 2.1.3
% 0.25/0.46 % (620233)Termination reason: Refutation
% 0.25/0.46 % (620233)Time elapsed: 0.011 s
% 0.25/0.46 % (620233)Peak memory usage: 13 MB
% 0.25/0.46 % (620233)Instructions burned: 16 (million)
% 0.25/0.46 % (620227)Success in time 0.048 s
% 0.25/0.46 % Vampire exiting
%------------------------------------------------------------------------------