%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC002-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 : n005.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:14 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 24
% Syntax : Number of formulae : 110 ( 17 unt; 11 def)
% Number of atoms : 485 ( 79 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 751 ( 376 ~; 364 |; 0 &)
% ( 11 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 12 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 63 ( 0 sgn 63 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f224,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk2
| app(X1,X2) != sk1
| ssItem(sk5(X2,X1,X0))
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
fof(f225,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk2 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk1
| ssItem(sk5(X2,X1,X0))
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f224]) ).
fof(f226,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk2
| app(X1,X2) != sk1
| memberP(sk2,sk5(X2,X1,X0))
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
fof(f227,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk2 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk1
| memberP(sk2,sk5(X2,X1,X0))
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f226]) ).
fof(f228,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk2
| app(X1,X2) != sk1
| geq(sk5(X2,X1,X0),X0)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_21) ).
fof(f229,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk2 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk1
| geq(sk5(X2,X1,X0),X0)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f228]) ).
fof(f230,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk2
| app(X1,X2) != sk1
| X0 != sk5(X2,X1,X0)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_22) ).
fof(f231,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk2 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk1
| sk5(X2,X1,X0) != X0
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f230]) ).
fof(f232,negated_conjecture,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_23) ).
fof(f233,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_24) ).
fof(f234,negated_conjecture,
( ssList(sk8)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_25) ).
fof(f235,negated_conjecture,
( app(app(sk7,cons(sk6,nil)),sk8) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_26) ).
fof(f236,plain,
( sk4 = app(app(sk7,cons(sk6,nil)),sk8)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f235]) ).
fof(f237,negated_conjecture,
( app(sk7,sk8) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_27) ).
fof(f238,plain,
( sk3 = app(sk7,sk8)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f237]) ).
fof(f239,negated_conjecture,
! [X0] :
( ~ ssItem(X0)
| sk6 = X0
| ~ memberP(sk4,X0)
| ~ geq(X0,sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_28) ).
fof(f242,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f254,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk3
| ssItem(sk5(X2,X1,X0))
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f225,f204,f205]) ).
fof(f255,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk3
| memberP(sk4,sk5(X2,X1,X0))
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f227,f204,f205,f204]) ).
fof(f256,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk3
| geq(sk5(X2,X1,X0),X0)
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f229,f204,f205]) ).
fof(f257,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| app(X1,X2) != sk3
| sk5(X2,X1,X0) != X0
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f231,f204,f205]) ).
fof(f282,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f242]) ).
fof(f290,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f294,definition,
( spl0_2
<=> ! [X0] :
( ~ ssItem(X0)
| ~ geq(X0,sk6)
| ~ memberP(sk4,X0)
| sk6 = X0 ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f295,plain,
( ! [X0] :
( ~ memberP(sk4,X0)
| ~ geq(X0,sk6)
| ~ ssItem(X0)
| sk6 = X0 )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f294]) ).
fof(f296,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f239,f294,f290]) ).
fof(f298,definition,
( spl0_3
<=> sk3 = app(sk7,sk8) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f300,plain,
( sk3 = app(sk7,sk8)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f298]) ).
fof(f301,plain,
( ~ spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f238,f298,f290]) ).
fof(f303,definition,
( spl0_4
<=> sk4 = app(app(sk7,cons(sk6,nil)),sk8) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f305,plain,
( sk4 = app(app(sk7,cons(sk6,nil)),sk8)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f303]) ).
fof(f306,plain,
( ~ spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f236,f303,f290]) ).
fof(f308,definition,
( spl0_5
<=> ssList(sk8) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f310,plain,
( ssList(sk8)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f308]) ).
fof(f311,plain,
( ~ spl0_1
| spl0_5 ),
inference(avatar_split_clause,[],[f234,f308,f290]) ).
fof(f313,definition,
( spl0_6
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f315,plain,
( ssList(sk7)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f313]) ).
fof(f316,plain,
( ~ spl0_1
| spl0_6 ),
inference(avatar_split_clause,[],[f233,f313,f290]) ).
fof(f318,definition,
( spl0_7
<=> ssItem(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f320,plain,
( ssItem(sk6)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f318]) ).
fof(f321,plain,
( ~ spl0_1
| spl0_7 ),
inference(avatar_split_clause,[],[f232,f318,f290]) ).
fof(f323,definition,
( spl0_8
<=> ! [X2,X0,X1] :
( ~ ssItem(X0)
| sk5(X2,X1,X0) != X0
| app(X1,X2) != sk3
| sk4 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f324,plain,
( ! [X2,X0,X1] :
( sk4 != app(app(X1,cons(X0,nil)),X2)
| sk5(X2,X1,X0) != X0
| app(X1,X2) != sk3
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ ssList(X1) )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f323]) ).
fof(f325,plain,
( ~ spl0_1
| spl0_8 ),
inference(avatar_split_clause,[],[f257,f323,f290]) ).
fof(f327,definition,
( spl0_9
<=> ! [X2,X0,X1] :
( ~ ssItem(X0)
| geq(sk5(X2,X1,X0),X0)
| app(X1,X2) != sk3
| sk4 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f328,plain,
( ! [X2,X0,X1] :
( sk4 != app(app(X1,cons(X0,nil)),X2)
| geq(sk5(X2,X1,X0),X0)
| app(X1,X2) != sk3
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ ssList(X1) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f327]) ).
fof(f329,plain,
( ~ spl0_1
| spl0_9 ),
inference(avatar_split_clause,[],[f256,f327,f290]) ).
fof(f331,definition,
( spl0_10
<=> ! [X2,X0,X1] :
( ~ ssItem(X0)
| memberP(sk4,sk5(X2,X1,X0))
| app(X1,X2) != sk3
| sk4 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f332,plain,
( ! [X2,X0,X1] :
( sk4 != app(app(X1,cons(X0,nil)),X2)
| memberP(sk4,sk5(X2,X1,X0))
| app(X1,X2) != sk3
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ ssList(X1) )
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f331]) ).
fof(f333,plain,
( ~ spl0_1
| spl0_10 ),
inference(avatar_split_clause,[],[f255,f331,f290]) ).
fof(f335,definition,
( spl0_11
<=> ! [X2,X0,X1] :
( ~ ssItem(X0)
| ssItem(sk5(X2,X1,X0))
| app(X1,X2) != sk3
| sk4 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f336,plain,
( ! [X2,X0,X1] :
( sk4 != app(app(X1,cons(X0,nil)),X2)
| ssItem(sk5(X2,X1,X0))
| app(X1,X2) != sk3
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ ssList(X1) )
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f337,plain,
( ~ spl0_1
| spl0_11 ),
inference(avatar_split_clause,[],[f254,f335,f290]) ).
fof(f348,plain,
spl0_1,
inference(avatar_split_clause,[],[f282,f290]) ).
fof(f391,plain,
( sk4 != sk4
| ssItem(sk5(sk8,sk7,sk6))
| sk3 != app(sk7,sk8)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_11 ),
inference(superposition,[],[f336,f305]) ).
fof(f392,plain,
( ssItem(sk5(sk8,sk7,sk6))
| sk3 != app(sk7,sk8)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_11 ),
inference(trivial_inequality_removal,[],[f391]) ).
fof(f393,plain,
( ssItem(sk5(sk8,sk7,sk6))
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f392,f300]) ).
fof(f394,plain,
( ssItem(sk5(sk8,sk7,sk6))
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_7
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f393,f320]) ).
fof(f395,plain,
( ssItem(sk5(sk8,sk7,sk6))
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_7
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f394,f310]) ).
fof(f396,plain,
( ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f395,f315]) ).
fof(f397,plain,
( sk4 != sk4
| sk6 != sk5(sk8,sk7,sk6)
| sk3 != app(sk7,sk8)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_8 ),
inference(superposition,[],[f324,f305]) ).
fof(f398,plain,
( sk6 != sk5(sk8,sk7,sk6)
| sk3 != app(sk7,sk8)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_8 ),
inference(trivial_inequality_removal,[],[f397]) ).
fof(f399,plain,
( sk6 != sk5(sk8,sk7,sk6)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f398,f300]) ).
fof(f400,plain,
( sk6 != sk5(sk8,sk7,sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f399,f320]) ).
fof(f401,plain,
( sk6 != sk5(sk8,sk7,sk6)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f400,f310]) ).
fof(f402,plain,
( sk6 != sk5(sk8,sk7,sk6)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f401,f315]) ).
fof(f403,plain,
( sk4 != sk4
| geq(sk5(sk8,sk7,sk6),sk6)
| sk3 != app(sk7,sk8)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_9 ),
inference(superposition,[],[f328,f305]) ).
fof(f404,plain,
( geq(sk5(sk8,sk7,sk6),sk6)
| sk3 != app(sk7,sk8)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f403]) ).
fof(f405,plain,
( geq(sk5(sk8,sk7,sk6),sk6)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f404,f300]) ).
fof(f406,plain,
( geq(sk5(sk8,sk7,sk6),sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_7
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f405,f320]) ).
fof(f407,plain,
( geq(sk5(sk8,sk7,sk6),sk6)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_7
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f406,f310]) ).
fof(f408,plain,
( geq(sk5(sk8,sk7,sk6),sk6)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f407,f315]) ).
fof(f409,plain,
( sk4 != sk4
| memberP(sk4,sk5(sk8,sk7,sk6))
| sk3 != app(sk7,sk8)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_10 ),
inference(superposition,[],[f332,f305]) ).
fof(f410,plain,
( memberP(sk4,sk5(sk8,sk7,sk6))
| sk3 != app(sk7,sk8)
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_10 ),
inference(trivial_inequality_removal,[],[f409]) ).
fof(f411,plain,
( memberP(sk4,sk5(sk8,sk7,sk6))
| ~ ssItem(sk6)
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f410,f300]) ).
fof(f412,plain,
( memberP(sk4,sk5(sk8,sk7,sk6))
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_7
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f411,f320]) ).
fof(f413,plain,
( memberP(sk4,sk5(sk8,sk7,sk6))
| ~ ssList(sk7)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_7
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f412,f310]) ).
fof(f414,plain,
( memberP(sk4,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f413,f315]) ).
fof(f415,plain,
( ~ geq(sk5(sk8,sk7,sk6),sk6)
| ~ ssItem(sk5(sk8,sk7,sk6))
| sk6 = sk5(sk8,sk7,sk6)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_10 ),
inference(resolution,[],[f414,f295]) ).
fof(f416,plain,
( ~ ssItem(sk5(sk8,sk7,sk6))
| sk6 = sk5(sk8,sk7,sk6)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_9
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f415,f408]) ).
fof(f417,plain,
( sk6 = sk5(sk8,sk7,sk6)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_9
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f416,f396]) ).
fof(f418,plain,
( $false
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f417,f402]) ).
fof(f419,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9
| ~ spl0_10
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f418]) ).
cnf(s1,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f296]) ).
cnf(s2,plain,
( ~ spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f301]) ).
cnf(s3,plain,
( ~ spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f306]) ).
cnf(s4,plain,
( ~ spl0_1
| spl0_5 ),
inference(sat_conversion,[],[f311]) ).
cnf(s5,plain,
( ~ spl0_1
| spl0_6 ),
inference(sat_conversion,[],[f316]) ).
cnf(s6,plain,
( ~ spl0_1
| spl0_7 ),
inference(sat_conversion,[],[f321]) ).
cnf(s7,plain,
( ~ spl0_1
| spl0_8 ),
inference(sat_conversion,[],[f325]) ).
cnf(s8,plain,
( ~ spl0_1
| spl0_9 ),
inference(sat_conversion,[],[f329]) ).
cnf(s9,plain,
( ~ spl0_1
| spl0_10 ),
inference(sat_conversion,[],[f333]) ).
cnf(s10,plain,
( ~ spl0_1
| spl0_11 ),
inference(sat_conversion,[],[f337]) ).
cnf(s21,plain,
spl0_1,
inference(sat_conversion,[],[f348]) ).
cnf(s32,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9
| ~ spl0_10
| ~ spl0_11 ),
inference(sat_conversion,[],[f419]) ).
cnf(s37,plain,
spl0_11,
inference(rat,[],[s10,s21]) ).
cnf(s38,plain,
spl0_10,
inference(rat,[],[s9,s21]) ).
cnf(s39,plain,
spl0_9,
inference(rat,[],[s8,s21]) ).
cnf(s40,plain,
spl0_8,
inference(rat,[],[s7,s21]) ).
cnf(s41,plain,
spl0_7,
inference(rat,[],[s6,s21]) ).
cnf(s42,plain,
spl0_6,
inference(rat,[],[s5,s21]) ).
cnf(s43,plain,
spl0_5,
inference(rat,[],[s4,s21]) ).
cnf(s44,plain,
spl0_4,
inference(rat,[],[s3,s21]) ).
cnf(s45,plain,
spl0_3,
inference(rat,[],[s2,s21]) ).
cnf(s46,plain,
~ spl0_2,
inference(rat,[],[s32,s37,s38,s39,s40,s41,s42,s43,s44,s45]) ).
cnf(s47,plain,
$false,
inference(rat,[],[s1,s46,s21]) ).
fof(f420,plain,
$false,
inference(avatar_sat_refutation,[],[s47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC002-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.11/0.38 % Computer : n005.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 07:23:47 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.11/0.46 % (618570)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (618578)dis+10_1_sil=32000:sp=arity:random_seed=1309554626:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46 % (618578) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-618570-618578"...
% 0.11/0.46 % (618576)% WARNING: option uhcvi not known.
% 0.11/0.46 % (618578)...printing done.
% 0.11/0.46 % (618578)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (618578)------------------------------
% 0.17/0.46 % (618578)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (618578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (618578)CaDiCaL version: 2.1.3
% 0.17/0.46 % (618578)Termination reason: Refutation
% 0.17/0.46 % (618578)Time elapsed: 0.004 s
% 0.17/0.46 % (618578)Peak memory usage: 12 MB
% 0.17/0.46 % (618578)Instructions burned: 8 (million)
% 0.17/0.46 % (618570)Success in time 0.039 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------