%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC179+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 : n004.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:59 PM UTC 2026
% Result : Theorem 0.17s 0.49s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 11 unt; 3 def)
% Number of atoms : 137 ( 32 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 150 ( 50 ~; 44 |; 38 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 21 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f71,axiom,
! [X0] :
( ssItem(X0)
=> duplicatefreeP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax71) ).
fof(f72,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax72) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| duplicatefreeP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,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
| duplicatefreeP(X0)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f184,plain,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f71]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ~ duplicatefreeP(X0)
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& 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
& ~ duplicatefreeP(X0)
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f380,plain,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f184]) ).
fof(f381,plain,
duplicatefreeP(nil),
inference(cnf_transformation,[],[f72]) ).
fof(f420,plain,
( nil = sK49
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
( nil = sK49
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
~ duplicatefreeP(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f427,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f434,plain,
~ duplicatefreeP(sK49),
inference(definition_unfolding,[],[f426,f427]) ).
fof(f655,definition,
( spl54_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl54_2])],[avatar_definition]) ).
fof(f657,plain,
( nil = sK49
| ~ spl54_2 ),
inference(avatar_component_clause,[],[f655]) ).
fof(f680,definition,
( spl54_7
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl54_7])],[avatar_definition]) ).
fof(f682,plain,
( sK49 = cons(sK51,nil)
| ~ spl54_7 ),
inference(avatar_component_clause,[],[f680]) ).
fof(f686,plain,
( spl54_7
| spl54_2 ),
inference(avatar_split_clause,[],[f420,f655,f680]) ).
fof(f694,definition,
( spl54_9
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl54_9])],[avatar_definition]) ).
fof(f696,plain,
( ssItem(sK51)
| ~ spl54_9 ),
inference(avatar_component_clause,[],[f694]) ).
fof(f698,plain,
( spl54_9
| spl54_2 ),
inference(avatar_split_clause,[],[f424,f655,f694]) ).
fof(f735,plain,
( ~ duplicatefreeP(nil)
| ~ spl54_2 ),
inference(superposition,[],[f434,f657]) ).
fof(f739,plain,
( $false
| ~ spl54_2 ),
inference(forward_subsumption_resolution,[],[f381,f735]) ).
fof(f740,plain,
~ spl54_2,
inference(avatar_contradiction_clause,[],[f739]) ).
fof(f746,plain,
( duplicatefreeP(sK49)
| ~ ssItem(sK51)
| ~ spl54_7 ),
inference(superposition,[],[f380,f682]) ).
fof(f747,plain,
( ~ ssItem(sK51)
| ~ spl54_7 ),
inference(forward_subsumption_resolution,[],[f746,f434]) ).
fof(f748,plain,
( $false
| ~ spl54_7
| ~ spl54_9 ),
inference(forward_subsumption_resolution,[],[f747,f696]) ).
fof(f749,plain,
( ~ spl54_7
| ~ spl54_9 ),
inference(avatar_contradiction_clause,[],[f748]) ).
cnf(s10,plain,
( spl54_2
| spl54_7 ),
inference(sat_conversion,[],[f686]) ).
cnf(s14,plain,
( spl54_2
| spl54_9 ),
inference(sat_conversion,[],[f698]) ).
cnf(s26,plain,
~ spl54_2,
inference(sat_conversion,[],[f740]) ).
cnf(s27,plain,
( ~ spl54_7
| ~ spl54_9 ),
inference(sat_conversion,[],[f749]) ).
cnf(s32,plain,
spl54_9,
inference(rat,[],[s14,s26]) ).
cnf(s33,plain,
~ spl54_7,
inference(rat,[],[s27,s32]) ).
cnf(s35,plain,
$false,
inference(rat,[],[s10,s33,s26]) ).
fof(f750,plain,
$false,
inference(avatar_sat_refutation,[],[s35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC179+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.12/0.39 % Computer : n004.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 08:19:22 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/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.17/0.49 % (203709)Will run a generic schedule for satisfiability detection.
% 0.17/0.49 % (203714)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4158594409_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.49 % (203715)% WARNING: option uhcvi not known.
% 0.17/0.49 % (203717)dis+10_1_sil=32000:sp=arity:random_seed=2480479036:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.49 % (203715)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2129221970:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.49 % (203716)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=661232487:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.49 % (203718)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3647058078:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.49 % (203719)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3194780801:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.49 % (203720)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1699274687:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.49 % TRYING [1]
% 0.17/0.49 % TRYING [2]
% 0.17/0.49 % TRYING [3]
% 0.17/0.49 % (203715) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-203709-203715"...
% 0.17/0.49 % (203715)...printing done.
% 0.17/0.49 % (203715)Refutation found. Thanks to Tanya!
% 0.17/0.49 % SZS status Theorem for theBenchmark
% 0.17/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.49 % (203715)------------------------------
% 0.17/0.49 % (203715)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.49 % (203715)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.49 % (203715)CaDiCaL version: 2.1.3
% 0.17/0.49 % (203715)Termination reason: Refutation
% 0.17/0.49 % (203715)Time elapsed: 0.008 s
% 0.17/0.49 % (203715)Peak memory usage: 13 MB
% 0.17/0.49 % (203715)Instructions burned: 12 (million)
% 0.17/0.49 % (203709)Success in time 0.056 s
% 0.17/0.49 % Vampire exiting
%------------------------------------------------------------------------------