%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC242-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:03:06 PM UTC 2026
% Result : Unsatisfiable 2.99s 1.12s
% Output : Refutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 20
% Syntax : Number of formulae : 98 ( 14 unt; 8 def)
% Number of atoms : 367 ( 35 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 529 ( 260 ~; 261 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| ssItem(sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ssItem(sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f207]) ).
fof(f209,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| memberP(X1,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f210,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| memberP(X1,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f209]) ).
fof(f211,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| memberP(X2,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f212,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| memberP(X2,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f211]) ).
fof(f213,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| lt(X0,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f214,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| lt(X0,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f213]) ).
fof(f215,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ leq(X0,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f216,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ leq(X0,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f215]) ).
fof(f217,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f218,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f219,negated_conjecture,
( nil = sk3
| ssList(sk8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f220,negated_conjecture,
( nil = sk3
| app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f221,plain,
( nil = sk3
| sk3 = app(app(sk7,cons(sk6,nil)),sk8) ),
inference(reorient_equations,[],[f220]) ).
fof(f222,negated_conjecture,
! [X0] :
( nil = sk3
| ~ ssItem(X0)
| leq(sk6,X0)
| ~ memberP(sk7,X0)
| ~ memberP(sk8,X0)
| ~ lt(sk6,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f225,plain,
nil != sk3,
inference(definition_unfolding,[],[f206,f205]) ).
fof(f226,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| ssItem(sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f208,f205]) ).
fof(f227,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| memberP(X1,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f210,f205]) ).
fof(f228,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| memberP(X2,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f212,f205]) ).
fof(f229,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| lt(X0,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f214,f205]) ).
fof(f230,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ leq(X0,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f216,f205]) ).
fof(f247,definition,
( spl0_3
<=> ! [X0] :
( ~ ssItem(X0)
| ~ lt(sk6,X0)
| ~ memberP(sk8,X0)
| ~ memberP(sk7,X0)
| leq(sk6,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f248,plain,
( ! [X0] :
( ~ memberP(sk8,X0)
| ~ lt(sk6,X0)
| ~ ssItem(X0)
| ~ memberP(sk7,X0)
| leq(sk6,X0) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f250,definition,
( spl0_4
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f251,plain,
( nil = sk3
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f252,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f222,f250,f247]) ).
fof(f254,definition,
( spl0_5
<=> sk3 = app(app(sk7,cons(sk6,nil)),sk8) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f255,plain,
( sk3 = app(app(sk7,cons(sk6,nil)),sk8)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f256,plain,
( spl0_5
| spl0_4 ),
inference(avatar_split_clause,[],[f221,f250,f254]) ).
fof(f258,definition,
( spl0_6
<=> ssList(sk8) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f259,plain,
( ssList(sk8)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f260,plain,
( spl0_6
| spl0_4 ),
inference(avatar_split_clause,[],[f219,f250,f258]) ).
fof(f262,definition,
( spl0_7
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f263,plain,
( ssList(sk7)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f264,plain,
( spl0_7
| spl0_4 ),
inference(avatar_split_clause,[],[f218,f250,f262]) ).
fof(f266,definition,
( spl0_8
<=> ssItem(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f267,plain,
( ssItem(sk6)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f268,plain,
( spl0_8
| spl0_4 ),
inference(avatar_split_clause,[],[f217,f250,f266]) ).
fof(f269,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f251,f225]) ).
fof(f270,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f269]) ).
fof(f271,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(superposition,[],[f226,f255]) ).
fof(f272,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f271]) ).
fof(f273,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f272,f263]) ).
fof(f274,plain,
( ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f273,f259]) ).
fof(f275,plain,
( ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f274,f267]) ).
fof(f278,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk7,sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(superposition,[],[f227,f255]) ).
fof(f279,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk7,sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f278]) ).
fof(f280,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk7,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f279,f263]) ).
fof(f281,plain,
( ~ ssItem(sk6)
| memberP(sk7,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f280,f259]) ).
fof(f282,plain,
( memberP(sk7,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f281,f267]) ).
fof(f283,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk8,sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(superposition,[],[f228,f255]) ).
fof(f284,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk8,sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f283]) ).
fof(f285,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| memberP(sk8,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f284,f263]) ).
fof(f286,plain,
( ~ ssItem(sk6)
| memberP(sk8,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f285,f259]) ).
fof(f287,plain,
( memberP(sk8,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f286,f267]) ).
fof(f288,plain,
( ~ lt(sk6,sk5(sk8,sk7,sk6))
| ~ ssItem(sk5(sk8,sk7,sk6))
| ~ memberP(sk7,sk5(sk8,sk7,sk6))
| leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(resolution,[],[f287,f248]) ).
fof(f289,plain,
( ~ lt(sk6,sk5(sk8,sk7,sk6))
| ~ memberP(sk7,sk5(sk8,sk7,sk6))
| leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f288,f275]) ).
fof(f290,plain,
( ~ lt(sk6,sk5(sk8,sk7,sk6))
| leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f289,f282]) ).
fof(f292,definition,
( spl0_9
<=> leq(sk6,sk5(sk8,sk7,sk6)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f293,plain,
( leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f292]) ).
fof(f295,definition,
( spl0_10
<=> lt(sk6,sk5(sk8,sk7,sk6)) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f296,plain,
( ~ lt(sk6,sk5(sk8,sk7,sk6))
| spl0_10 ),
inference(avatar_component_clause,[],[f295]) ).
fof(f297,plain,
( spl0_9
| ~ spl0_10
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f290,f266,f262,f258,f254,f247,f295,f292]) ).
fof(f298,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(superposition,[],[f229,f255]) ).
fof(f299,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f298]) ).
fof(f300,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f299,f263]) ).
fof(f301,plain,
( ~ ssItem(sk6)
| lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f300,f259]) ).
fof(f302,plain,
( lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f301,f267]) ).
fof(f303,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(superposition,[],[f230,f255]) ).
fof(f304,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f303]) ).
fof(f305,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| ~ leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f304,f263]) ).
fof(f306,plain,
( ~ ssItem(sk6)
| ~ leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f305,f259]) ).
fof(f307,plain,
( ~ leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f306,f267]) ).
fof(f308,plain,
( $false
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f296,f302]) ).
fof(f309,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| spl0_10 ),
inference(avatar_contradiction_clause,[],[f308]) ).
fof(f310,plain,
( $false
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f293,f307]) ).
fof(f311,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f310]) ).
cnf(s2,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f252]) ).
cnf(s3,plain,
( spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f256]) ).
cnf(s4,plain,
( spl0_4
| spl0_6 ),
inference(sat_conversion,[],[f260]) ).
cnf(s5,plain,
( spl0_4
| spl0_7 ),
inference(sat_conversion,[],[f264]) ).
cnf(s6,plain,
( spl0_4
| spl0_8 ),
inference(sat_conversion,[],[f268]) ).
cnf(s7,plain,
~ spl0_4,
inference(sat_conversion,[],[f270]) ).
cnf(s9,plain,
( ~ spl0_3
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| spl0_9
| ~ spl0_10 ),
inference(sat_conversion,[],[f297]) ).
cnf(s10,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| spl0_10 ),
inference(sat_conversion,[],[f309]) ).
cnf(s11,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9 ),
inference(sat_conversion,[],[f311]) ).
cnf(s12,plain,
spl0_8,
inference(rat,[],[s6,s7]) ).
cnf(s13,plain,
spl0_7,
inference(rat,[],[s5,s7]) ).
cnf(s14,plain,
spl0_6,
inference(rat,[],[s4,s7]) ).
cnf(s15,plain,
spl0_5,
inference(rat,[],[s3,s7]) ).
cnf(s16,plain,
~ spl0_9,
inference(rat,[],[s11,s14,s12,s13,s15]) ).
cnf(s17,plain,
spl0_10,
inference(rat,[],[s10,s14,s12,s13,s15]) ).
cnf(s18,plain,
~ spl0_3,
inference(rat,[],[s9,s17,s16,s12,s13,s14,s15]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s2,s7,s18]) ).
fof(f312,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC242-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n008.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 08:39:24 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running first-order theorem proving
% 0.07/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.12 % (2103061)Input is clausal, will run a generic CNF schedule.
% 2.99/1.12 % (2103066)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=70559374:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.99/1.12 % (2103069)lrs+10_1_sil=8000:sp=occurrence:random_seed=983882401:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.99/1.12 % (2103071)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1058895578:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.99/1.12 % (2103068)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1153831525:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.99/1.12 % (2103067)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4040499041:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.99/1.12 % (2103072)dis-21_1_sil=8000:lcm=predicate:random_seed=3157374645:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.99/1.12 % (2103070)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3040416460:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.99/1.12 % (2103070)First to succeed.
% 2.99/1.12 % (2103069)Also succeeded, but the first one will report.
% 2.99/1.12 % (2103072)Also succeeded, but the first one will report.
% 2.99/1.12 % (2103070)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2103061"
% 2.99/1.12 % (2103071)Also succeeded, but the first one will report.
% 2.99/1.12 % (2103070)Refutation found. Thanks to Tanya!
% 2.99/1.12 % SZS status Unsatisfiable for theBenchmark
% 2.99/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 3.71/1.21 % (2103070)------------------------------
% 3.71/1.21 % (2103070)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.71/1.21 % (2103070)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.71/1.21 % (2103070)CaDiCaL version: 2.1.3
% 3.71/1.21 % (2103070)Termination reason: Refutation
% 3.71/1.21 % (2103070)Time elapsed: 0.005 s
% 3.71/1.21 % (2103070)Peak memory usage: 89 MB
% 3.71/1.21 % (2103070)Instructions burned: 6 (million)
% 3.71/1.21 % (2103070)------------------------------
% 3.71/1.21 % (2103070)------------------------------
% 3.71/1.21 % (2103061)Success in time 0.449 s
% 3.71/1.21 % Vampire exiting
%------------------------------------------------------------------------------