%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC258+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:05:17 PM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 13 unt; 4 def)
% Number of atoms : 134 ( 32 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 147 ( 54 ~; 48 |; 30 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 17 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| totalorderedP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X3,X5)
& leq(X5,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)
=> ( X1 != X3
| X0 != X2
| totalorderedP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X3,X5)
& leq(X5,X4) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f180,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ~ totalorderedP(X0)
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ memberP(X3,X5)
| ~ leq(X5,X4) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ~ totalorderedP(X0)
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ memberP(X3,X5)
| ~ leq(X5,X4) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f368,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f180]) ).
fof(f369,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f416,plain,
( nil = sK49
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( nil = sK49
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
~ totalorderedP(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f428,plain,
~ totalorderedP(sK49),
inference(definition_unfolding,[],[f420,f421]) ).
fof(f463,definition,
( spl52_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f465,plain,
( nil = sK49
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f463]) ).
fof(f473,definition,
( spl52_4
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f475,plain,
( ssItem(sK51)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f473]) ).
fof(f483,definition,
( spl52_6
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f485,plain,
( sK49 = cons(sK51,nil)
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f483]) ).
fof(f487,plain,
( spl52_4
| spl52_2 ),
inference(avatar_split_clause,[],[f416,f463,f473]) ).
fof(f489,plain,
( spl52_6
| spl52_2 ),
inference(avatar_split_clause,[],[f418,f463,f483]) ).
fof(f500,definition,
( spl52_9
<=> ! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ) ),
introduced(definition,[new_symbols(definition,[spl52_9])],[avatar_definition]) ).
fof(f501,plain,
( ! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl52_9 ),
inference(avatar_component_clause,[],[f500]) ).
fof(f503,plain,
spl52_9,
inference(avatar_split_clause,[],[f368,f500]) ).
fof(f522,plain,
( ~ totalorderedP(nil)
| ~ spl52_2 ),
inference(superposition,[],[f428,f465]) ).
fof(f524,plain,
( $false
| ~ spl52_2 ),
inference(forward_subsumption_resolution,[],[f522,f369]) ).
fof(f525,plain,
~ spl52_2,
inference(avatar_contradiction_clause,[],[f524]) ).
fof(f545,plain,
( totalorderedP(sK49)
| ~ ssItem(sK51)
| ~ spl52_6
| ~ spl52_9 ),
inference(superposition,[],[f501,f485]) ).
fof(f546,plain,
( ~ ssItem(sK51)
| ~ spl52_6
| ~ spl52_9 ),
inference(forward_subsumption_resolution,[],[f545,f428]) ).
fof(f547,plain,
( $false
| ~ spl52_4
| ~ spl52_6
| ~ spl52_9 ),
inference(forward_subsumption_resolution,[],[f546,f475]) ).
fof(f548,plain,
( ~ spl52_4
| ~ spl52_6
| ~ spl52_9 ),
inference(avatar_contradiction_clause,[],[f547]) ).
cnf(s6,plain,
( spl52_2
| spl52_4 ),
inference(sat_conversion,[],[f487]) ).
cnf(s8,plain,
( spl52_2
| spl52_6 ),
inference(sat_conversion,[],[f489]) ).
cnf(s12,plain,
spl52_9,
inference(sat_conversion,[],[f503]) ).
cnf(s17,plain,
~ spl52_2,
inference(sat_conversion,[],[f525]) ).
cnf(s19,plain,
( ~ spl52_4
| ~ spl52_6
| ~ spl52_9 ),
inference(sat_conversion,[],[f548]) ).
cnf(s23,plain,
spl52_6,
inference(rat,[],[s8,s17]) ).
cnf(s24,plain,
~ spl52_4,
inference(rat,[],[s19,s12,s23]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s6,s24,s17]) ).
fof(f549,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC258+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n010.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 08:44:53 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.20/0.27 % (1778963)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (1778972)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3359618067:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (1778969)% WARNING: option uhcvi not known.
% 0.20/0.27 % (1778968)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2414226907_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % (1778969)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1811158586:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (1778972) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1778963-1778972"...
% 0.20/0.27 % (1778970)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3680162583:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (1778971)dis+10_1_sil=32000:sp=arity:random_seed=3958399944:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (1778972)...printing done.
% 0.20/0.27 % (1778972)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (1778972)------------------------------
% 0.20/0.27 % (1778972)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1778972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1778972)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1778972)Termination reason: Refutation
% 0.20/0.27 % (1778972)Time elapsed: 0.007 s
% 0.20/0.27 % (1778972)Peak memory usage: 13 MB
% 0.20/0.27 % (1778972)Instructions burned: 20 (million)
% 0.20/0.27 % (1778963)Success in time 0.042 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------