%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC358+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 : n001.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:42 PM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 15 unt; 5 def)
% Number of atoms : 128 ( 27 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 129 ( 46 ~; 45 |; 22 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 19 ( 0 sgn 11 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| segmentP(X1,X0)
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) ) ) ) ) ) ),
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)
| segmentP(X1,X0)
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ segmentP(X1,X0)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& 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)
& ~ segmentP(X1,X0)
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f360,plain,
! [X0] :
( ~ ssList(X0)
| nil != X0
| segmentP(nil,X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f413,plain,
( segmentP(sK50,sK49)
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( segmentP(sK50,sK49)
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
~ segmentP(sK48,sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
~ segmentP(sK50,sK49),
inference(definition_unfolding,[],[f416,f419,f418]) ).
fof(f446,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f360]) ).
fof(f460,definition,
( spl51_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f462,plain,
( nil = sK50
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f460]) ).
fof(f469,definition,
( spl51_3
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f471,plain,
( nil = sK49
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f469]) ).
fof(f473,definition,
( spl51_4
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f474,plain,
( ~ segmentP(sK50,sK49)
| spl51_4 ),
inference(avatar_component_clause,[],[f473]) ).
fof(f476,plain,
( spl51_3
| spl51_4 ),
inference(avatar_split_clause,[],[f413,f473,f469]) ).
fof(f477,plain,
( spl51_1
| spl51_4 ),
inference(avatar_split_clause,[],[f414,f473,f460]) ).
fof(f478,plain,
~ spl51_4,
inference(avatar_split_clause,[],[f426,f473]) ).
fof(f480,definition,
( spl51_5
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f494,definition,
( spl51_8
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl51_8])],[avatar_definition]) ).
fof(f496,plain,
( segmentP(nil,nil)
| ~ spl51_8 ),
inference(avatar_component_clause,[],[f494]) ).
fof(f497,plain,
( spl51_8
| ~ spl51_5 ),
inference(avatar_split_clause,[],[f446,f480,f494]) ).
fof(f508,plain,
spl51_5,
inference(avatar_split_clause,[],[f306,f480]) ).
fof(f511,plain,
( ~ segmentP(sK50,nil)
| ~ spl51_3
| spl51_4 ),
inference(forward_demodulation,[],[f474,f471]) ).
fof(f512,plain,
( ~ segmentP(nil,nil)
| ~ spl51_1
| ~ spl51_3
| spl51_4 ),
inference(forward_demodulation,[],[f511,f462]) ).
fof(f513,plain,
( $false
| ~ spl51_1
| ~ spl51_3
| spl51_4
| ~ spl51_8 ),
inference(forward_subsumption_resolution,[],[f512,f496]) ).
fof(f514,plain,
( ~ spl51_1
| ~ spl51_3
| spl51_4
| ~ spl51_8 ),
inference(avatar_contradiction_clause,[],[f513]) ).
cnf(s2,plain,
( spl51_3
| spl51_4 ),
inference(sat_conversion,[],[f476]) ).
cnf(s3,plain,
( spl51_1
| spl51_4 ),
inference(sat_conversion,[],[f477]) ).
cnf(s4,plain,
~ spl51_4,
inference(sat_conversion,[],[f478]) ).
cnf(s9,plain,
( ~ spl51_5
| spl51_8 ),
inference(sat_conversion,[],[f497]) ).
cnf(s12,plain,
spl51_5,
inference(sat_conversion,[],[f508]) ).
cnf(s13,plain,
( ~ spl51_1
| ~ spl51_3
| spl51_4
| ~ spl51_8 ),
inference(sat_conversion,[],[f514]) ).
cnf(s16,plain,
spl51_8,
inference(rat,[],[s9,s12]) ).
cnf(s17,plain,
spl51_1,
inference(rat,[],[s3,s4]) ).
cnf(s18,plain,
~ spl51_3,
inference(rat,[],[s13,s16,s4,s17]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s2,s4,s18]) ).
fof(f515,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC358+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.07/0.18 % Computer : n001.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 09:21:03 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.25 % (235948)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (235957)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3796012534:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.25 % (235954)% WARNING: option uhcvi not known.
% 0.07/0.25 % (235957) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-235948-235957"...
% 0.07/0.25 % (235957)...printing done.
% 0.07/0.25 % (235953)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2493185938_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.25 % (235957)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Theorem for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.25 % (235957)------------------------------
% 0.07/0.25 % (235957)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (235957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (235957)CaDiCaL version: 2.1.3
% 0.07/0.25 % (235957)Termination reason: Refutation
% 0.07/0.25 % (235957)Time elapsed: 0.006 s
% 0.07/0.25 % (235957)Peak memory usage: 12 MB
% 0.07/0.25 % (235957)Instructions burned: 19 (million)
% 0.07/0.25 % (235948)Success in time 0.031 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------