%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC279-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 : n006.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:22 PM UTC 2026
% Result : Unsatisfiable 0.06s 0.26s
% Output : Refutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of formulae : 58 ( 14 unt; 4 def)
% Number of atoms : 158 ( 10 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 195 ( 95 ~; 96 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
! [X2,X3,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk3
| ~ ssItem(X3)
| leq(X0,X3)
| ~ memberP(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,plain,
! [X2,X3,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ ssItem(X3)
| leq(X0,X3)
| ~ memberP(X2,X3) ),
inference(reorient_equations,[],[f206]) ).
fof(f208,negated_conjecture,
! [X2,X3,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk3
| ~ ssItem(X3)
| leq(X3,X0)
| ~ memberP(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f209,plain,
! [X2,X3,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ ssItem(X3)
| leq(X3,X0)
| ~ memberP(X1,X3) ),
inference(reorient_equations,[],[f208]) ).
fof(f210,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f211,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f212,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f213,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f214,plain,
sk1 = app(app(sk6,cons(sk5,nil)),sk7),
inference(reorient_equations,[],[f213]) ).
fof(f215,negated_conjecture,
ssItem(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f216,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk7,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f217,negated_conjecture,
( memberP(sk6,sk8)
| ~ leq(sk5,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f218,negated_conjecture,
( ~ leq(sk8,sk5)
| memberP(sk7,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f219,negated_conjecture,
( ~ leq(sk8,sk5)
| ~ leq(sk5,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f222,plain,
sk3 = app(app(sk6,cons(sk5,nil)),sk7),
inference(definition_unfolding,[],[f214,f205]) ).
fof(f254,definition,
( spl0_1
<=> leq(sk5,sk8) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f256,plain,
( ~ leq(sk5,sk8)
| spl0_1 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f258,definition,
( spl0_2
<=> leq(sk8,sk5) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f260,plain,
( ~ leq(sk8,sk5)
| spl0_2 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f261,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f219,f258,f254]) ).
fof(f263,definition,
( spl0_3
<=> memberP(sk7,sk8) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f265,plain,
( memberP(sk7,sk8)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f266,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f218,f258,f263]) ).
fof(f268,definition,
( spl0_4
<=> memberP(sk6,sk8) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f270,plain,
( memberP(sk6,sk8)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f271,plain,
( ~ spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f217,f268,f254]) ).
fof(f272,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f216,f268,f263]) ).
fof(f333,plain,
! [X0] :
( sk3 != sk3
| ~ ssList(sk6)
| ~ ssList(sk7)
| ~ ssItem(sk5)
| ~ ssItem(X0)
| leq(sk5,X0)
| ~ memberP(sk7,X0) ),
inference(superposition,[],[f207,f222]) ).
fof(f334,plain,
! [X0] :
( ~ ssList(sk6)
| ~ ssList(sk7)
| ~ ssItem(sk5)
| ~ ssItem(X0)
| leq(sk5,X0)
| ~ memberP(sk7,X0) ),
inference(trivial_inequality_removal,[],[f333]) ).
fof(f335,plain,
! [X0] :
( ~ ssList(sk7)
| ~ ssItem(sk5)
| ~ ssItem(X0)
| leq(sk5,X0)
| ~ memberP(sk7,X0) ),
inference(forward_subsumption_resolution,[],[f334,f211]) ).
fof(f336,plain,
! [X0] :
( ~ ssItem(sk5)
| ~ ssItem(X0)
| leq(sk5,X0)
| ~ memberP(sk7,X0) ),
inference(forward_subsumption_resolution,[],[f335,f212]) ).
fof(f337,plain,
! [X0] :
( ~ memberP(sk7,X0)
| leq(sk5,X0)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f336,f210]) ).
fof(f338,plain,
! [X0] :
( sk3 != sk3
| ~ ssList(sk6)
| ~ ssList(sk7)
| ~ ssItem(sk5)
| ~ ssItem(X0)
| leq(X0,sk5)
| ~ memberP(sk6,X0) ),
inference(superposition,[],[f209,f222]) ).
fof(f339,plain,
! [X0] :
( ~ ssList(sk6)
| ~ ssList(sk7)
| ~ ssItem(sk5)
| ~ ssItem(X0)
| leq(X0,sk5)
| ~ memberP(sk6,X0) ),
inference(trivial_inequality_removal,[],[f338]) ).
fof(f340,plain,
! [X0] :
( ~ ssList(sk7)
| ~ ssItem(sk5)
| ~ ssItem(X0)
| leq(X0,sk5)
| ~ memberP(sk6,X0) ),
inference(forward_subsumption_resolution,[],[f339,f211]) ).
fof(f341,plain,
! [X0] :
( ~ ssItem(sk5)
| ~ ssItem(X0)
| leq(X0,sk5)
| ~ memberP(sk6,X0) ),
inference(forward_subsumption_resolution,[],[f340,f212]) ).
fof(f342,plain,
! [X0] :
( ~ memberP(sk6,X0)
| leq(X0,sk5)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f341,f210]) ).
fof(f343,plain,
( leq(sk8,sk5)
| ~ ssItem(sk8)
| ~ spl0_4 ),
inference(resolution,[],[f342,f270]) ).
fof(f344,plain,
( ~ ssItem(sk8)
| spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f343,f260]) ).
fof(f345,plain,
( $false
| spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f344,f215]) ).
fof(f346,plain,
( spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f345]) ).
fof(f347,plain,
( leq(sk5,sk8)
| ~ ssItem(sk8)
| ~ spl0_3 ),
inference(resolution,[],[f265,f337]) ).
fof(f348,plain,
( ~ ssItem(sk8)
| spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f347,f256]) ).
fof(f349,plain,
( $false
| spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f348,f215]) ).
fof(f350,plain,
( spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f349]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f261]) ).
cnf(s2,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f266]) ).
cnf(s3,plain,
( ~ spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f271]) ).
cnf(s4,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f272]) ).
cnf(s17,plain,
( spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f346]) ).
cnf(s18,plain,
( spl0_1
| ~ spl0_3 ),
inference(sat_conversion,[],[f350]) ).
cnf(s23,plain,
spl0_3,
inference(rat,[],[s17,s2,s4]) ).
cnf(s24,plain,
spl0_1,
inference(rat,[],[s18,s23]) ).
cnf(s25,plain,
spl0_4,
inference(rat,[],[s3,s24]) ).
cnf(s26,plain,
~ spl0_2,
inference(rat,[],[s1,s24]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s17,s25,s26]) ).
fof(f351,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC279-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.06/0.17 % Computer : n006.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Mon Sep 28 08:50:40 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.20 Running first-order model finding
% 0.06/0.20 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.06/0.26 % (3825026)Will run a generic schedule for satisfiability detection.
% 0.06/0.26 % (3825031)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=481315769_2999 on theBenchmark for (2999ds/0Mi)
% 0.06/0.26 % TRYING [1]
% 0.06/0.26 % TRYING [2]
% 0.06/0.26 % (3825033)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2165935754:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.06/0.26 % (3825034)dis+10_1_sil=32000:sp=arity:random_seed=72470905:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.06/0.26 % (3825037)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2761325522:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.06/0.26 % (3825035)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1161038119:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.06/0.26 % (3825036)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=507142336:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.06/0.26 % TRYING [3]
% 0.06/0.26 % (3825032)% WARNING: option uhcvi not known.
% 0.06/0.26 % (3825034) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3825026-3825034"...
% 0.06/0.26 % (3825034)...printing done.
% 0.06/0.26 % (3825037) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3825026-3825037"...
% 0.06/0.26 % (3825034)Refutation found. Thanks to Tanya!
% 0.06/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.06/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.26 % (3825034)------------------------------
% 0.06/0.26 % (3825034)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.26 % (3825034)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.26 % (3825034)CaDiCaL version: 2.1.3
% 0.06/0.26 % (3825034)Termination reason: Refutation
% 0.06/0.26 % (3825034)Time elapsed: 0.005 s
% 0.06/0.26 % (3825034)Peak memory usage: 12 MB
% 0.06/0.26 % (3825034)Instructions burned: 6 (million)
% 0.06/0.26 % (3825026)Success in time 0.044 s
% 0.06/0.26 % Vampire exiting
%------------------------------------------------------------------------------