%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC037+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.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 53 ( 14 unt; 4 def)
% Number of atoms : 161 ( 46 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 173 ( 65 ~; 61 |; 26 &)
% ( 8 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn 22 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ( ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,X4) ) )
& ( nil != X3
| nil != 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
| ( ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,X4) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
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(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( ? [X4] :
( neq(X4,nil)
& segmentP(X3,X4)
& segmentP(X2,X4)
& ssList(X4) )
| ( nil = X3
& nil = 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
& ( ? [X4] :
( neq(X4,nil)
& segmentP(X3,X4)
& segmentP(X2,X4)
& ssList(X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f361,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ~ segmentP(nil,X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f415,plain,
( nil = sK49
| ssList(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( nil = sK49
| segmentP(sK50,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( nil = sK49
| neq(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
nil != sK47,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
nil = sK48,
inference(cnf_transformation,[],[f222]) ).
fof(f427,plain,
nil = sK50,
inference(definition_unfolding,[],[f423,f422]) ).
fof(f447,plain,
! [X0] :
( ~ segmentP(sK50,X0)
| sK50 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f361,f427,f427]) ).
fof(f486,plain,
sK49 != sK50,
inference(definition_unfolding,[],[f420,f427,f421]) ).
fof(f487,plain,
( sK49 = sK50
| neq(sK51,sK50) ),
inference(definition_unfolding,[],[f418,f427,f427]) ).
fof(f488,plain,
( sK49 = sK50
| segmentP(sK50,sK51) ),
inference(definition_unfolding,[],[f417,f427]) ).
fof(f490,plain,
( sK49 = sK50
| ssList(sK51) ),
inference(definition_unfolding,[],[f415,f427]) ).
fof(f509,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f524,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f509]) ).
fof(f528,definition,
( spl52_1
<=> ssList(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f530,plain,
( ssList(sK51)
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f528]) ).
fof(f532,definition,
( spl52_2
<=> sK49 = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f535,plain,
( spl52_1
| spl52_2 ),
inference(avatar_split_clause,[],[f490,f532,f528]) ).
fof(f542,definition,
( spl52_4
<=> segmentP(sK50,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f544,plain,
( segmentP(sK50,sK51)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f542]) ).
fof(f545,plain,
( spl52_4
| spl52_2 ),
inference(avatar_split_clause,[],[f488,f532,f542]) ).
fof(f547,definition,
( spl52_5
<=> neq(sK51,sK50) ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f549,plain,
( neq(sK51,sK50)
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f547]) ).
fof(f550,plain,
( spl52_5
| spl52_2 ),
inference(avatar_split_clause,[],[f487,f532,f547]) ).
fof(f551,plain,
~ spl52_2,
inference(avatar_split_clause,[],[f486,f532]) ).
fof(f575,plain,
( sK50 = sK51
| ~ ssList(sK51)
| ~ spl52_4 ),
inference(resolution,[],[f447,f544]) ).
fof(f579,plain,
( sK50 = sK51
| ~ spl52_1
| ~ spl52_4 ),
inference(forward_subsumption_resolution,[],[f575,f530]) ).
fof(f583,plain,
( neq(sK50,sK50)
| ~ spl52_1
| ~ spl52_4
| ~ spl52_5 ),
inference(superposition,[],[f549,f579]) ).
fof(f1000,plain,
( ~ ssList(sK50)
| ~ spl52_1
| ~ spl52_4
| ~ spl52_5 ),
inference(resolution,[],[f524,f583]) ).
fof(f1001,plain,
( $false
| ~ spl52_1
| ~ spl52_4
| ~ spl52_5 ),
inference(forward_subsumption_resolution,[],[f1000,f419]) ).
fof(f1002,plain,
( ~ spl52_1
| ~ spl52_4
| ~ spl52_5 ),
inference(avatar_contradiction_clause,[],[f1001]) ).
cnf(s1,plain,
( spl52_1
| spl52_2 ),
inference(sat_conversion,[],[f535]) ).
cnf(s3,plain,
( spl52_2
| spl52_4 ),
inference(sat_conversion,[],[f545]) ).
cnf(s4,plain,
( spl52_2
| spl52_5 ),
inference(sat_conversion,[],[f550]) ).
cnf(s5,plain,
~ spl52_2,
inference(sat_conversion,[],[f551]) ).
cnf(s40,plain,
( ~ spl52_1
| ~ spl52_4
| ~ spl52_5 ),
inference(sat_conversion,[],[f1002]) ).
cnf(s45,plain,
spl52_5,
inference(rat,[],[s4,s5]) ).
cnf(s46,plain,
spl52_4,
inference(rat,[],[s3,s5]) ).
cnf(s47,plain,
~ spl52_1,
inference(rat,[],[s40,s45,s46]) ).
cnf(s49,plain,
$false,
inference(rat,[],[s1,s5,s47]) ).
fof(f1003,plain,
$false,
inference(avatar_sat_refutation,[],[s49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC037+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.39 % Computer : n010.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 28 07:33:03 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 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.18/0.49 % (1742410)Will run a generic schedule for satisfiability detection.
% 0.18/0.49 % (1742419)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1790778916:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.49 % (1742416)% WARNING: option uhcvi not known.
% 0.18/0.49 % (1742418)dis+10_1_sil=32000:sp=arity:random_seed=3438335958:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.49 % (1742415)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2483373312_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.49 % (1742420)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2433629648:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.49 % (1742416)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2263806216:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.49 % (1742417)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3987126675:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.49 % (1742421)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2926998157:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.49 % (1742419) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1742410-1742419"...
% 0.18/0.49 % (1742419)...printing done.
% 0.18/0.49 % (1742419)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (1742419)------------------------------
% 0.18/0.49 % (1742419)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49 % (1742419)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49 % (1742419)CaDiCaL version: 2.1.3
% 0.18/0.49 % (1742419)Termination reason: Refutation
% 0.18/0.49 % (1742419)Time elapsed: 0.012 s
% 0.18/0.49 % (1742419)Peak memory usage: 13 MB
% 0.18/0.49 % (1742419)Instructions burned: 36 (million)
% 0.18/0.49 % (1742410)Success in time 0.049 s
% 0.18/0.49 % Vampire exiting
%------------------------------------------------------------------------------