%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC161-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 : 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:02:43 PM UTC 2026
% Result : Unsatisfiable 12.63s 2.65s
% Output : Refutation 13.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 47
% Syntax : Number of formulae : 229 ( 50 unt; 23 def)
% Number of atoms : 743 ( 46 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 1036 ( 522 ~; 497 |; 0 &)
% ( 17 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 26 ( 24 usr; 18 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 14 con; 0-2 aty)
% Number of variables : 172 ( 0 sgn 172 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f52,axiom,
! [X0,X1] : ssList(skaf43(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause52) ).
fof(f53,axiom,
! [X0,X1] : ssList(skaf42(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause53) ).
fof(f72,axiom,
! [X0,X1] :
( ~ ssList(X0)
| duplicatefreeP(X0)
| ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause72) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause86) ).
fof(f106,axiom,
! [X0,X1] :
( ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause103) ).
fof(f117,axiom,
! [X0,X1] :
( ~ lt(X1,X0)
| ~ lt(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause114) ).
fof(f125,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause120) ).
fof(f126,plain,
! [X0,X1] :
( cons(X0,X1) = app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f125]) ).
fof(f140,axiom,
! [X0,X1] :
( ~ leq(X0,X1)
| ~ leq(X1,X0)
| ~ ssItem(X0)
| ~ ssItem(X1)
| X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause130) ).
fof(f141,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| X0 = X1 ),
inference(reorient_equations,[],[f140]) ).
fof(f161,axiom,
! [X2,X0,X1] :
( app(app(X2,X1),X0) = app(X2,app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause149) ).
fof(f182,axiom,
! [X0,X1] :
( app(skaf42(X0,X1),cons(X1,skaf43(X1,X0))) = X0
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause169) ).
fof(f189,axiom,
! [X2,X3,X0,X1] :
( app(X0,cons(X1,X2)) != X3
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(X3)
| memberP(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause175) ).
fof(f193,axiom,
! [X2,X3,X0,X1,X4] :
( app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ duplicatefreeP(X4)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause179) ).
fof(f195,axiom,
! [X2,X3,X0,X1,X4,X5] :
( app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ strictorderedP(X5)
| ~ ssList(X5)
| lt(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause181) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f210,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f215,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f216,negated_conjecture,
ssItem(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f217,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f218,negated_conjecture,
ssList(sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f219,negated_conjecture,
ssList(sk11),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f220,negated_conjecture,
app(app(app(app(sk9,cons(sk7,nil)),sk10),cons(sk8,nil)),sk11) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f221,plain,
sk1 = app(app(app(app(sk9,cons(sk7,nil)),sk10),cons(sk8,nil)),sk11),
inference(reorient_equations,[],[f220]) ).
fof(f222,negated_conjecture,
leq(sk8,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
fof(f229,plain,
sk3 = app(app(app(app(sk9,cons(sk7,nil)),sk10),cons(sk8,nil)),sk11),
inference(definition_unfolding,[],[f221,f205]) ).
fof(f245,plain,
! [X2,X0,X1] :
( memberP(app(X0,cons(X1,X2)),X1)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(X2) ),
inference(equality_resolution,[],[f189]) ).
fof(f247,plain,
! [X2,X3,X0,X1] :
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(X3) ),
inference(equality_resolution,[],[f193]) ).
fof(f249,plain,
! [X2,X3,X0,X1,X4] :
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(X4)
| lt(X1,X3) ),
inference(equality_resolution,[],[f195]) ).
fof(f259,definition,
sF2 = cons(sk7,nil),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f260,plain,
cons(sk7,nil) = sF2,
inference(reorient_equations,[],[f259]) ).
fof(f261,definition,
sF3 = app(sk9,sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f262,plain,
app(sk9,sF2) = sF3,
inference(reorient_equations,[],[f261]) ).
fof(f263,definition,
sF4 = app(sF3,sk10),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f264,plain,
app(sF3,sk10) = sF4,
inference(reorient_equations,[],[f263]) ).
fof(f265,definition,
sF5 = cons(sk8,nil),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f266,plain,
cons(sk8,nil) = sF5,
inference(reorient_equations,[],[f265]) ).
fof(f267,definition,
sF6 = app(sF4,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f268,plain,
app(sF4,sF5) = sF6,
inference(reorient_equations,[],[f267]) ).
fof(f269,definition,
sF7 = app(sF6,sk11),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f270,plain,
app(sF6,sk11) = sF7,
inference(reorient_equations,[],[f269]) ).
fof(f271,plain,
sk3 = sF7,
inference(definition_folding,[],[f229,f270,f268,f266,f264,f262,f260]) ).
fof(f288,definition,
( spl8_3
<=> leq(sk7,sk8) ),
introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).
fof(f289,plain,
( leq(sk7,sk8)
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f290,plain,
( ~ leq(sk7,sk8)
| spl8_3 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f315,definition,
( spl8_9
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl8_9])],[avatar_definition]) ).
fof(f316,plain,
( ssList(nil)
| ~ spl8_9 ),
inference(avatar_component_clause,[],[f315]) ).
fof(f343,definition,
( spl8_15
<=> ! [X1] : ssItem(X1) ),
introduced(definition,[new_symbols(definition,[spl8_15])],[avatar_definition]) ).
fof(f344,plain,
( ! [X1] : ssItem(X1)
| ~ spl8_15 ),
inference(avatar_component_clause,[],[f343]) ).
fof(f346,definition,
( spl8_16
<=> ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) ) ),
introduced(definition,[new_symbols(definition,[spl8_16])],[avatar_definition]) ).
fof(f347,plain,
( ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) )
| ~ spl8_16 ),
inference(avatar_component_clause,[],[f346]) ).
fof(f348,plain,
( spl8_15
| spl8_16 ),
inference(avatar_split_clause,[],[f72,f346,f343]) ).
fof(f351,plain,
spl8_9,
inference(avatar_split_clause,[],[f8,f315]) ).
fof(f353,plain,
sk3 = app(sF6,sk11),
inference(forward_demodulation,[],[f270,f271]) ).
fof(f356,plain,
! [X0] :
( app(sk9,app(sF2,X0)) = app(sF3,X0)
| ~ ssList(sF2)
| ~ ssList(sk9)
| ~ ssList(X0) ),
inference(superposition,[],[f161,f262]) ).
fof(f362,plain,
! [X0] :
( app(sk9,app(sF2,X0)) = app(sF3,X0)
| ~ ssList(sF2)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f356,f217]) ).
fof(f382,definition,
( spl8_21
<=> ssList(sF2) ),
introduced(definition,[new_symbols(definition,[spl8_21])],[avatar_definition]) ).
fof(f383,plain,
( ssList(sF2)
| ~ spl8_21 ),
inference(avatar_component_clause,[],[f382]) ).
fof(f384,plain,
( ~ ssList(sF2)
| spl8_21 ),
inference(avatar_component_clause,[],[f382]) ).
fof(f386,definition,
( spl8_22
<=> ! [X0] :
( app(sk9,app(sF2,X0)) = app(sF3,X0)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[spl8_22])],[avatar_definition]) ).
fof(f387,plain,
( ! [X0] :
( app(sk9,app(sF2,X0)) = app(sF3,X0)
| ~ ssList(X0) )
| ~ spl8_22 ),
inference(avatar_component_clause,[],[f386]) ).
fof(f388,plain,
( ~ spl8_21
| spl8_22 ),
inference(avatar_split_clause,[],[f362,f386,f382]) ).
fof(f390,plain,
! [X0] :
( app(sF4,app(sF5,X0)) = app(sF6,X0)
| ~ ssList(sF5)
| ~ ssList(sF4)
| ~ ssList(X0) ),
inference(superposition,[],[f161,f268]) ).
fof(f392,definition,
( spl8_23
<=> ssList(sF4) ),
introduced(definition,[new_symbols(definition,[spl8_23])],[avatar_definition]) ).
fof(f393,plain,
( ssList(sF4)
| ~ spl8_23 ),
inference(avatar_component_clause,[],[f392]) ).
fof(f394,plain,
( ~ ssList(sF4)
| spl8_23 ),
inference(avatar_component_clause,[],[f392]) ).
fof(f396,definition,
( spl8_24
<=> ssList(sF5) ),
introduced(definition,[new_symbols(definition,[spl8_24])],[avatar_definition]) ).
fof(f397,plain,
( ssList(sF5)
| ~ spl8_24 ),
inference(avatar_component_clause,[],[f396]) ).
fof(f400,definition,
( spl8_25
<=> ! [X0] :
( app(sF4,app(sF5,X0)) = app(sF6,X0)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[spl8_25])],[avatar_definition]) ).
fof(f401,plain,
( ! [X0] :
( app(sF4,app(sF5,X0)) = app(sF6,X0)
| ~ ssList(X0) )
| ~ spl8_25 ),
inference(avatar_component_clause,[],[f400]) ).
fof(f402,plain,
( ~ spl8_23
| ~ spl8_24
| spl8_25 ),
inference(avatar_split_clause,[],[f390,f400,f396,f392]) ).
fof(f403,plain,
! [X2,X0,X1] :
( ssList(app(X0,app(X1,X2)))
| ~ ssList(app(X0,X1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(superposition,[],[f85,f161]) ).
fof(f405,plain,
( ssList(sF3)
| ~ ssList(sk9)
| ~ ssList(sF2) ),
inference(superposition,[],[f85,f262]) ).
fof(f409,plain,
! [X2,X0,X1] :
( ssList(app(X0,app(X1,X2)))
| ~ ssList(app(X0,X1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f403]) ).
fof(f411,plain,
! [X2,X0,X1] :
( ssList(app(X0,app(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f409,f85]) ).
fof(f415,plain,
( ssList(sF4)
| ~ ssList(sF3)
| ~ ssList(sk10) ),
inference(superposition,[],[f85,f264]) ).
fof(f418,plain,
( ~ ssList(sF3)
| ~ ssList(sk10)
| spl8_23 ),
inference(forward_subsumption_resolution,[],[f415,f394]) ).
fof(f420,definition,
( spl8_26
<=> ssList(sF3) ),
introduced(definition,[new_symbols(definition,[spl8_26])],[avatar_definition]) ).
fof(f422,plain,
( ~ ssList(sF3)
| spl8_26 ),
inference(avatar_component_clause,[],[f420]) ).
fof(f427,plain,
( ~ ssList(sF3)
| spl8_23 ),
inference(forward_subsumption_resolution,[],[f418,f218]) ).
fof(f428,plain,
( ~ spl8_26
| spl8_23 ),
inference(avatar_split_clause,[],[f427,f392,f420]) ).
fof(f429,plain,
( ssList(sF2)
| ~ ssList(nil)
| ~ ssItem(sk7) ),
inference(superposition,[],[f86,f260]) ).
fof(f430,plain,
( ssList(sF5)
| ~ ssList(nil)
| ~ ssItem(sk8) ),
inference(superposition,[],[f86,f266]) ).
fof(f431,plain,
( ssList(sF5)
| ~ ssItem(sk8)
| ~ spl8_9 ),
inference(forward_subsumption_resolution,[],[f430,f316]) ).
fof(f432,plain,
( ~ ssList(nil)
| ~ ssItem(sk7)
| spl8_21 ),
inference(forward_subsumption_resolution,[],[f429,f384]) ).
fof(f433,plain,
( ssList(sF5)
| ~ spl8_9 ),
inference(forward_subsumption_resolution,[],[f431,f216]) ).
fof(f434,plain,
( ~ ssItem(sk7)
| ~ spl8_9
| spl8_21 ),
inference(forward_subsumption_resolution,[],[f432,f316]) ).
fof(f435,plain,
( spl8_24
| ~ spl8_9 ),
inference(avatar_split_clause,[],[f433,f315,f396]) ).
fof(f436,plain,
( $false
| ~ spl8_9
| spl8_21 ),
inference(forward_subsumption_resolution,[],[f434,f215]) ).
fof(f437,plain,
( ~ spl8_9
| spl8_21 ),
inference(avatar_contradiction_clause,[],[f436]) ).
fof(f438,plain,
( ~ ssList(sk9)
| ~ ssList(sF2)
| spl8_26 ),
inference(forward_subsumption_resolution,[],[f405,f422]) ).
fof(f439,plain,
( ~ ssList(sF2)
| spl8_26 ),
inference(forward_subsumption_resolution,[],[f438,f217]) ).
fof(f440,plain,
( $false
| ~ spl8_21
| spl8_26 ),
inference(forward_subsumption_resolution,[],[f439,f383]) ).
fof(f441,plain,
( ~ spl8_21
| spl8_26 ),
inference(avatar_contradiction_clause,[],[f440]) ).
fof(f478,plain,
! [X0] :
( app(sF2,X0) = cons(sk7,X0)
| ~ ssList(X0)
| ~ ssItem(sk7) ),
inference(superposition,[],[f126,f260]) ).
fof(f479,plain,
! [X0] :
( app(sF5,X0) = cons(sk8,X0)
| ~ ssList(X0)
| ~ ssItem(sk8) ),
inference(superposition,[],[f126,f266]) ).
fof(f487,plain,
! [X0] :
( app(sF5,X0) = cons(sk8,X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f479,f216]) ).
fof(f488,plain,
! [X0] :
( app(sF2,X0) = cons(sk7,X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f478,f215]) ).
fof(f549,plain,
( ! [X0] :
( app(sF6,X0) = app(sF4,cons(sk8,X0))
| ~ ssList(X0)
| ~ ssList(X0) )
| ~ spl8_25 ),
inference(superposition,[],[f401,f487]) ).
fof(f556,plain,
( ! [X0] :
( app(sF6,X0) = app(sF4,cons(sk8,X0))
| ~ ssList(X0) )
| ~ spl8_25 ),
inference(duplicate_literal_removal,[],[f549]) ).
fof(f600,plain,
! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X2,X3)))
| ~ ssList(skaf43(X1,X0))
| ~ ssList(skaf42(X0,X1))
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ strictorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| lt(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(superposition,[],[f249,f182]) ).
fof(f603,plain,
! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X2,X3)))
| ~ ssList(skaf43(X1,X0))
| ~ ssList(skaf42(X0,X1))
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ strictorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| lt(X1,X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(duplicate_literal_removal,[],[f600]) ).
fof(f606,plain,
! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X2,X3)))
| ~ ssList(skaf42(X0,X1))
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ strictorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| lt(X1,X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(forward_subsumption_resolution,[],[f603,f52]) ).
fof(f608,plain,
! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X2,X3)))
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ strictorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| lt(X1,X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(forward_subsumption_resolution,[],[f606,f53]) ).
fof(f609,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X2,X3)))
| ~ ssItem(X2)
| ~ strictorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| lt(X1,X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) )
| ~ spl8_15 ),
inference(forward_subsumption_resolution,[],[f608,f344]) ).
fof(f610,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X2,X3)))
| ~ strictorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| lt(X1,X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) )
| ~ spl8_15 ),
inference(forward_subsumption_resolution,[],[f609,f344]) ).
fof(f680,plain,
( ! [X0] :
( ssList(app(sF6,X0))
| ~ ssList(X0)
| ~ ssList(sF5)
| ~ ssList(sF4)
| ~ ssList(X0) )
| ~ spl8_25 ),
inference(superposition,[],[f411,f401]) ).
fof(f682,plain,
( ! [X0] :
( ssList(app(sF6,X0))
| ~ ssList(X0)
| ~ ssList(sF5)
| ~ ssList(sF4) )
| ~ spl8_25 ),
inference(duplicate_literal_removal,[],[f680]) ).
fof(f690,plain,
( ! [X0] :
( ssList(app(sF6,X0))
| ~ ssList(X0)
| ~ ssList(sF4) )
| ~ spl8_24
| ~ spl8_25 ),
inference(forward_subsumption_resolution,[],[f682,f397]) ).
fof(f706,plain,
( ! [X0] :
( ssList(app(sF6,X0))
| ~ ssList(X0) )
| ~ spl8_23
| ~ spl8_24
| ~ spl8_25 ),
inference(forward_subsumption_resolution,[],[f690,f393]) ).
fof(f914,plain,
( ! [X0] :
( app(sF3,X0) = app(sk9,cons(sk7,X0))
| ~ ssList(X0)
| ~ ssList(X0) )
| ~ spl8_22 ),
inference(superposition,[],[f387,f488]) ).
fof(f916,plain,
( ! [X0] :
( ssList(app(sF3,X0))
| ~ ssList(X0)
| ~ ssList(sF2)
| ~ ssList(sk9)
| ~ ssList(X0) )
| ~ spl8_22 ),
inference(superposition,[],[f411,f387]) ).
fof(f920,plain,
( ! [X0] :
( ssList(app(sF3,X0))
| ~ ssList(X0)
| ~ ssList(sF2)
| ~ ssList(sk9) )
| ~ spl8_22 ),
inference(duplicate_literal_removal,[],[f916]) ).
fof(f921,plain,
( ! [X0] :
( app(sF3,X0) = app(sk9,cons(sk7,X0))
| ~ ssList(X0) )
| ~ spl8_22 ),
inference(duplicate_literal_removal,[],[f914]) ).
fof(f925,plain,
( ! [X0] :
( ssList(app(sF3,X0))
| ~ ssList(X0)
| ~ ssList(sk9) )
| ~ spl8_21
| ~ spl8_22 ),
inference(forward_subsumption_resolution,[],[f920,f383]) ).
fof(f927,plain,
( ! [X0] :
( ssList(app(sF3,X0))
| ~ ssList(X0) )
| ~ spl8_21
| ~ spl8_22 ),
inference(forward_subsumption_resolution,[],[f925,f217]) ).
fof(f1042,plain,
! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(skaf43(X1,X0))
| ~ ssList(skaf42(X0,X1))
| ~ ssItem(X1)
| ~ duplicatefreeP(app(X0,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(superposition,[],[f247,f182]) ).
fof(f1052,plain,
! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(skaf43(X1,X0))
| ~ ssList(skaf42(X0,X1))
| ~ ssItem(X1)
| ~ duplicatefreeP(app(X0,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(duplicate_literal_removal,[],[f1042]) ).
fof(f1060,plain,
! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(skaf42(X0,X1))
| ~ ssItem(X1)
| ~ duplicatefreeP(app(X0,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(forward_subsumption_resolution,[],[f1052,f52]) ).
fof(f1069,plain,
! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ duplicatefreeP(app(X0,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(forward_subsumption_resolution,[],[f1060,f53]) ).
fof(f1080,plain,
( ! [X0] :
( memberP(app(sF3,X0),sk7)
| ~ ssList(sk9)
| ~ ssItem(sk7)
| ~ ssList(app(sF3,X0))
| ~ ssList(X0)
| ~ ssList(X0) )
| ~ spl8_22 ),
inference(superposition,[],[f245,f921]) ).
fof(f1087,plain,
( ! [X0] :
( memberP(app(sF3,X0),sk7)
| ~ ssList(sk9)
| ~ ssItem(sk7)
| ~ ssList(app(sF3,X0))
| ~ ssList(X0) )
| ~ spl8_22 ),
inference(duplicate_literal_removal,[],[f1080]) ).
fof(f1093,plain,
( ! [X0] :
( memberP(app(sF3,X0),sk7)
| ~ ssList(sk9)
| ~ ssItem(sk7)
| ~ ssList(X0) )
| ~ spl8_21
| ~ spl8_22 ),
inference(forward_subsumption_resolution,[],[f1087,f927]) ).
fof(f1100,plain,
( ! [X0] :
( memberP(app(sF3,X0),sk7)
| ~ ssItem(sk7)
| ~ ssList(X0) )
| ~ spl8_21
| ~ spl8_22 ),
inference(forward_subsumption_resolution,[],[f1093,f217]) ).
fof(f1105,plain,
( ! [X0] :
( memberP(app(sF3,X0),sk7)
| ~ ssList(X0) )
| ~ spl8_21
| ~ spl8_22 ),
inference(forward_subsumption_resolution,[],[f1100,f215]) ).
fof(f1344,plain,
( ! [X0,X1] :
( ~ ssList(app(sF6,X0))
| ~ strictorderedP(app(sF6,X0))
| ~ ssList(X0)
| lt(X1,sk8)
| ~ ssList(sF4)
| ~ memberP(sF4,X1)
| ~ ssList(X0) )
| ~ spl8_15
| ~ spl8_25 ),
inference(superposition,[],[f610,f556]) ).
fof(f1346,plain,
( ! [X0,X1] :
( ~ ssList(app(sF6,X0))
| ~ strictorderedP(app(sF6,X0))
| ~ ssList(X0)
| lt(X1,sk8)
| ~ ssList(sF4)
| ~ memberP(sF4,X1) )
| ~ spl8_15
| ~ spl8_25 ),
inference(duplicate_literal_removal,[],[f1344]) ).
fof(f1352,plain,
( ! [X0,X1] :
( ~ strictorderedP(app(sF6,X0))
| ~ ssList(X0)
| lt(X1,sk8)
| ~ ssList(sF4)
| ~ memberP(sF4,X1) )
| ~ spl8_15
| ~ spl8_23
| ~ spl8_24
| ~ spl8_25 ),
inference(forward_subsumption_resolution,[],[f1346,f706]) ).
fof(f1361,plain,
( ! [X0,X1] :
( ~ strictorderedP(app(sF6,X0))
| ~ ssList(X0)
| lt(X1,sk8)
| ~ memberP(sF4,X1) )
| ~ spl8_15
| ~ spl8_23
| ~ spl8_24
| ~ spl8_25 ),
inference(forward_subsumption_resolution,[],[f1352,f393]) ).
fof(f1368,definition,
( spl8_33
<=> ! [X1] :
( lt(X1,sk8)
| ~ memberP(sF4,X1) ) ),
introduced(definition,[new_symbols(definition,[spl8_33])],[avatar_definition]) ).
fof(f1369,plain,
( ! [X1] :
( ~ memberP(sF4,X1)
| lt(X1,sk8) )
| ~ spl8_33 ),
inference(avatar_component_clause,[],[f1368]) ).
fof(f1371,definition,
( spl8_34
<=> ! [X0] :
( ~ strictorderedP(app(sF6,X0))
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[spl8_34])],[avatar_definition]) ).
fof(f1372,plain,
( ! [X0] :
( ~ strictorderedP(app(sF6,X0))
| ~ ssList(X0) )
| ~ spl8_34 ),
inference(avatar_component_clause,[],[f1371]) ).
fof(f1373,plain,
( spl8_33
| spl8_34
| ~ spl8_15
| ~ spl8_23
| ~ spl8_24
| ~ spl8_25 ),
inference(avatar_split_clause,[],[f1361,f400,f396,f392,f343,f1371,f1368]) ).
fof(f1402,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) )
| ~ spl8_16 ),
inference(forward_subsumption_resolution,[],[f1069,f347]) ).
fof(f1535,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(cons(X0,X1)) )
| ~ spl8_16 ),
inference(resolution,[],[f1402,f85]) ).
fof(f1551,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X2,X0)
| ~ ssList(cons(X0,X1)) )
| ~ spl8_16 ),
inference(duplicate_literal_removal,[],[f1535]) ).
fof(f1562,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X2,X0) )
| ~ spl8_16 ),
inference(forward_subsumption_resolution,[],[f1551,f86]) ).
fof(f1572,definition,
( spl8_39
<=> ! [X1] : ~ ssList(X1) ),
introduced(definition,[new_symbols(definition,[spl8_39])],[avatar_definition]) ).
fof(f1573,plain,
( ! [X1] : ~ ssList(X1)
| ~ spl8_39 ),
inference(avatar_component_clause,[],[f1572]) ).
fof(f1575,definition,
( spl8_40
<=> ! [X2,X0] :
( ~ ssItem(X0)
| ~ ssList(X2)
| ~ memberP(X2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl8_40])],[avatar_definition]) ).
fof(f1576,plain,
( ! [X2,X0] :
( ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssItem(X0) )
| ~ spl8_40 ),
inference(avatar_component_clause,[],[f1575]) ).
fof(f1577,plain,
( spl8_39
| spl8_40
| ~ spl8_16 ),
inference(avatar_split_clause,[],[f1562,f346,f1575,f1572]) ).
fof(f1649,plain,
( ~ strictorderedP(sk3)
| ~ ssList(sk11)
| ~ spl8_34 ),
inference(superposition,[],[f1372,f353]) ).
fof(f1652,plain,
( ~ ssList(sk11)
| ~ spl8_34 ),
inference(forward_subsumption_resolution,[],[f1649,f210]) ).
fof(f1654,plain,
( $false
| ~ spl8_34 ),
inference(forward_subsumption_resolution,[],[f1652,f219]) ).
fof(f1655,plain,
~ spl8_34,
inference(avatar_contradiction_clause,[],[f1654]) ).
fof(f1696,definition,
( spl8_44
<=> lt(sk8,sk7) ),
introduced(definition,[new_symbols(definition,[spl8_44])],[avatar_definition]) ).
fof(f1697,plain,
( ~ lt(sk8,sk7)
| spl8_44 ),
inference(avatar_component_clause,[],[f1696]) ).
fof(f1698,plain,
( lt(sk8,sk7)
| ~ spl8_44 ),
inference(avatar_component_clause,[],[f1696]) ).
fof(f2193,definition,
( spl8_48
<=> lt(sk7,sk8) ),
introduced(definition,[new_symbols(definition,[spl8_48])],[avatar_definition]) ).
fof(f2194,plain,
( ~ lt(sk7,sk8)
| spl8_48 ),
inference(avatar_component_clause,[],[f2193]) ).
fof(f2195,plain,
( lt(sk7,sk8)
| ~ spl8_48 ),
inference(avatar_component_clause,[],[f2193]) ).
fof(f2201,definition,
( spl8_50
<=> lt(sk7,sk7) ),
introduced(definition,[new_symbols(definition,[spl8_50])],[avatar_definition]) ).
fof(f2202,plain,
( ~ lt(sk7,sk7)
| spl8_50 ),
inference(avatar_component_clause,[],[f2201]) ).
fof(f2203,plain,
( lt(sk7,sk7)
| ~ spl8_50 ),
inference(avatar_component_clause,[],[f2201]) ).
fof(f2212,plain,
( ~ ssItem(sk8)
| ~ ssItem(sk7)
| leq(sk7,sk8)
| ~ spl8_48 ),
inference(resolution,[],[f2195,f106]) ).
fof(f2213,plain,
( ~ ssItem(sk7)
| leq(sk7,sk8)
| ~ spl8_48 ),
inference(forward_subsumption_resolution,[],[f2212,f216]) ).
fof(f2214,plain,
( leq(sk7,sk8)
| ~ spl8_48 ),
inference(forward_subsumption_resolution,[],[f2213,f215]) ).
fof(f2215,plain,
( $false
| spl8_3
| ~ spl8_48 ),
inference(forward_subsumption_resolution,[],[f2214,f290]) ).
fof(f2216,plain,
( spl8_3
| ~ spl8_48 ),
inference(avatar_contradiction_clause,[],[f2215]) ).
fof(f2360,plain,
( $false
| ~ spl8_39 ),
inference(resolution,[],[f1573,f52]) ).
fof(f2393,plain,
~ spl8_39,
inference(avatar_contradiction_clause,[],[f2360]) ).
fof(f2408,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(X2) )
| ~ spl8_40 ),
inference(resolution,[],[f1576,f245]) ).
fof(f2413,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) )
| ~ spl8_40 ),
inference(duplicate_literal_removal,[],[f2408]) ).
fof(f2424,plain,
( ! [X0] :
( ~ ssList(app(sF3,X0))
| ~ ssItem(sk7)
| ~ ssList(sk9)
| ~ ssList(X0)
| ~ ssList(X0) )
| ~ spl8_22
| ~ spl8_40 ),
inference(superposition,[],[f2413,f921]) ).
fof(f2429,plain,
( ! [X0] :
( ~ ssList(app(sF3,X0))
| ~ ssItem(sk7)
| ~ ssList(sk9)
| ~ ssList(X0) )
| ~ spl8_22
| ~ spl8_40 ),
inference(duplicate_literal_removal,[],[f2424]) ).
fof(f2437,plain,
( ! [X0] :
( ~ ssItem(sk7)
| ~ ssList(sk9)
| ~ ssList(X0) )
| ~ spl8_21
| ~ spl8_22
| ~ spl8_40 ),
inference(forward_subsumption_resolution,[],[f2429,f927]) ).
fof(f2448,plain,
( ! [X0] :
( ~ ssList(sk9)
| ~ ssList(X0) )
| ~ spl8_21
| ~ spl8_22
| ~ spl8_40 ),
inference(forward_subsumption_resolution,[],[f2437,f215]) ).
fof(f2458,plain,
( ! [X0] : ~ ssList(X0)
| ~ spl8_21
| ~ spl8_22
| ~ spl8_40 ),
inference(forward_subsumption_resolution,[],[f2448,f217]) ).
fof(f2462,plain,
( spl8_39
| ~ spl8_21
| ~ spl8_22
| ~ spl8_40 ),
inference(avatar_split_clause,[],[f2458,f1575,f386,f382,f1572]) ).
fof(f4030,plain,
( ~ lt(sk7,sk8)
| ~ ssItem(sk7)
| ~ ssItem(sk8)
| ~ spl8_44 ),
inference(resolution,[],[f117,f1698]) ).
fof(f4494,plain,
( ~ leq(sk7,sk8)
| ~ ssItem(sk7)
| ~ ssItem(sk8)
| sk7 = sk8 ),
inference(resolution,[],[f141,f222]) ).
fof(f4538,plain,
( ~ ssItem(sk7)
| ~ ssItem(sk8)
| ~ spl8_44
| ~ spl8_48 ),
inference(forward_subsumption_resolution,[],[f4030,f2195]) ).
fof(f4540,plain,
( ~ ssItem(sk8)
| ~ spl8_44
| ~ spl8_48 ),
inference(forward_subsumption_resolution,[],[f4538,f215]) ).
fof(f4542,plain,
( $false
| ~ spl8_44
| ~ spl8_48 ),
inference(forward_subsumption_resolution,[],[f4540,f216]) ).
fof(f4543,plain,
( ~ spl8_44
| ~ spl8_48 ),
inference(avatar_contradiction_clause,[],[f4542]) ).
fof(f7251,plain,
( memberP(sF4,sk7)
| ~ ssList(sk10)
| ~ spl8_21
| ~ spl8_22 ),
inference(superposition,[],[f1105,f264]) ).
fof(f7256,plain,
( memberP(sF4,sk7)
| ~ spl8_21
| ~ spl8_22 ),
inference(forward_subsumption_resolution,[],[f7251,f218]) ).
fof(f7257,plain,
( lt(sk7,sk8)
| ~ spl8_21
| ~ spl8_22
| ~ spl8_33 ),
inference(resolution,[],[f7256,f1369]) ).
fof(f7258,plain,
( $false
| ~ spl8_21
| ~ spl8_22
| ~ spl8_33
| spl8_48 ),
inference(forward_subsumption_resolution,[],[f7257,f2194]) ).
fof(f7259,plain,
( ~ spl8_21
| ~ spl8_22
| ~ spl8_33
| spl8_48 ),
inference(avatar_contradiction_clause,[],[f7258]) ).
fof(f7260,plain,
( ~ ssItem(sk7)
| ~ ssItem(sk8)
| sk7 = sk8
| ~ spl8_3 ),
inference(forward_subsumption_resolution,[],[f4494,f289]) ).
fof(f7262,plain,
( ~ ssItem(sk8)
| sk7 = sk8
| ~ spl8_3 ),
inference(forward_subsumption_resolution,[],[f7260,f215]) ).
fof(f7264,plain,
( sk7 = sk8
| ~ spl8_3
| ~ spl8_15 ),
inference(forward_subsumption_resolution,[],[f7262,f344]) ).
fof(f7285,plain,
( ~ lt(sk7,sk7)
| ~ spl8_3
| ~ spl8_15
| spl8_44 ),
inference(backward_demodulation,[],[f1697,f7264]) ).
fof(f7289,plain,
( lt(sk7,sk7)
| ~ spl8_3
| ~ spl8_15
| ~ spl8_48 ),
inference(backward_demodulation,[],[f2195,f7264]) ).
fof(f7460,plain,
( $false
| ~ spl8_3
| ~ spl8_15
| spl8_44
| ~ spl8_50 ),
inference(forward_subsumption_resolution,[],[f7285,f2203]) ).
fof(f7461,plain,
( ~ spl8_3
| ~ spl8_15
| spl8_44
| ~ spl8_50 ),
inference(avatar_contradiction_clause,[],[f7460]) ).
fof(f7637,plain,
( $false
| ~ spl8_3
| ~ spl8_15
| ~ spl8_48
| spl8_50 ),
inference(forward_subsumption_resolution,[],[f7289,f2202]) ).
fof(f7638,plain,
( ~ spl8_3
| ~ spl8_15
| ~ spl8_48
| spl8_50 ),
inference(avatar_contradiction_clause,[],[f7637]) ).
cnf(s11,plain,
( spl8_15
| spl8_16 ),
inference(sat_conversion,[],[f348]) ).
cnf(s14,plain,
spl8_9,
inference(sat_conversion,[],[f351]) ).
cnf(s17,plain,
( ~ spl8_21
| spl8_22 ),
inference(sat_conversion,[],[f388]) ).
cnf(s18,plain,
( ~ spl8_23
| ~ spl8_24
| spl8_25 ),
inference(sat_conversion,[],[f402]) ).
cnf(s21,plain,
( spl8_23
| ~ spl8_26 ),
inference(sat_conversion,[],[f428]) ).
cnf(s22,plain,
( ~ spl8_9
| spl8_24 ),
inference(sat_conversion,[],[f435]) ).
cnf(s23,plain,
( ~ spl8_9
| spl8_21 ),
inference(sat_conversion,[],[f437]) ).
cnf(s24,plain,
( ~ spl8_21
| spl8_26 ),
inference(sat_conversion,[],[f441]) ).
cnf(s29,plain,
( ~ spl8_15
| ~ spl8_23
| ~ spl8_24
| ~ spl8_25
| spl8_33
| spl8_34 ),
inference(sat_conversion,[],[f1373]) ).
cnf(s33,plain,
( ~ spl8_16
| spl8_39
| spl8_40 ),
inference(sat_conversion,[],[f1577]) ).
cnf(s37,plain,
~ spl8_34,
inference(sat_conversion,[],[f1655]) ).
cnf(s44,plain,
( spl8_3
| ~ spl8_48 ),
inference(sat_conversion,[],[f2216]) ).
cnf(s61,plain,
~ spl8_39,
inference(sat_conversion,[],[f2393]) ).
cnf(s67,plain,
( ~ spl8_21
| ~ spl8_22
| spl8_39
| ~ spl8_40 ),
inference(sat_conversion,[],[f2462]) ).
cnf(s98,plain,
( ~ spl8_44
| ~ spl8_48 ),
inference(sat_conversion,[],[f4543]) ).
cnf(s111,plain,
( ~ spl8_21
| ~ spl8_22
| ~ spl8_33
| spl8_48 ),
inference(sat_conversion,[],[f7259]) ).
cnf(s112,plain,
( ~ spl8_3
| ~ spl8_15
| spl8_44
| ~ spl8_50 ),
inference(sat_conversion,[],[f7461]) ).
cnf(s118,plain,
( ~ spl8_3
| ~ spl8_15
| ~ spl8_48
| spl8_50 ),
inference(sat_conversion,[],[f7638]) ).
cnf(s123,plain,
( ~ spl8_16
| spl8_40 ),
inference(rat,[],[s33,s61]) ).
cnf(s125,plain,
( ~ spl8_15
| ~ spl8_23
| ~ spl8_24
| ~ spl8_25
| spl8_33 ),
inference(rat,[],[s29,s37]) ).
cnf(s127,plain,
spl8_21,
inference(rat,[],[s23,s14]) ).
cnf(s128,plain,
spl8_24,
inference(rat,[],[s22,s14]) ).
cnf(s129,plain,
spl8_26,
inference(rat,[],[s24,s127]) ).
cnf(s130,plain,
spl8_22,
inference(rat,[],[s17,s127]) ).
cnf(s131,plain,
spl8_23,
inference(rat,[],[s21,s129]) ).
cnf(s133,plain,
~ spl8_40,
inference(rat,[],[s67,s127,s61,s130]) ).
cnf(s135,plain,
spl8_25,
inference(rat,[],[s18,s128,s131]) ).
cnf(s136,plain,
~ spl8_16,
inference(rat,[],[s123,s133]) ).
cnf(s139,plain,
spl8_15,
inference(rat,[],[s11,s136]) ).
cnf(s141,plain,
spl8_33,
inference(rat,[],[s125,s135,s131,s128,s139]) ).
cnf(s142,plain,
spl8_48,
inference(rat,[],[s111,s130,s127,s141]) ).
cnf(s143,plain,
~ spl8_44,
inference(rat,[],[s98,s142]) ).
cnf(s144,plain,
spl8_3,
inference(rat,[],[s44,s142]) ).
cnf(s146,plain,
spl8_50,
inference(rat,[],[s118,s142,s139,s144]) ).
cnf(s149,plain,
$false,
inference(rat,[],[s112,s143,s139,s146,s144]) ).
fof(f7648,plain,
$false,
inference(avatar_sat_refutation,[],[s149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC161-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.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:14:07 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 11.07/2.49 % (201946)Input is clausal, will run a generic CNF schedule.
% 11.07/2.49 % (201952)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2903559626:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 11.07/2.49 % (201951)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=1656675147:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 11.07/2.49 % (201953)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=273205431:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 11.07/2.49 % (201956)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2982407442:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 11.07/2.49 % (201954)lrs+10_1_sil=8000:sp=occurrence:random_seed=3179949970:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 11.07/2.49 % (201955)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2874538085:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 11.07/2.49 % (201957)dis-21_1_sil=8000:lcm=predicate:random_seed=1022528141: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)
% 11.07/2.49 % (201957)Instruction limit reached!
% 11.07/2.49 % (201957)------------------------------
% 11.07/2.49 % (201957)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.07/2.49 % (201957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.07/2.49 % (201957)CaDiCaL version: 2.1.3
% 11.07/2.49 % (201957)Termination reason: Instruction limit
% 11.07/2.49 % (201957)Termination phase: Saturation
% 11.07/2.49 % (201957)Time elapsed: 0.054 s
% 11.07/2.49 % (201957)Peak memory usage: 89 MB
% 11.07/2.49 % (201957)Instructions burned: 117 (million)
% 11.07/2.49 % (201954)Instruction limit reached!
% 11.07/2.49 % (201954)------------------------------
% 11.07/2.49 % (201954)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.07/2.49 % (201954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.07/2.49 % (201954)CaDiCaL version: 2.1.3
% 11.07/2.49 % (201954)Termination reason: Instruction limit
% 11.07/2.49 % (201954)Termination phase: Saturation
% 11.07/2.49 % (201954)Time elapsed: 0.065 s
% 11.07/2.49 % (201954)Peak memory usage: 89 MB
% 11.07/2.49 % (201954)Instructions burned: 109 (million)
% 11.07/2.49 % (201955)Instruction limit reached!
% 11.07/2.49 % (201955)------------------------------
% 11.07/2.49 % (201955)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.07/2.49 % (201955)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.07/2.49 % (201955)CaDiCaL version: 2.1.3
% 11.07/2.49 % (201955)Termination reason: Instruction limit
% 11.07/2.49 % (201955)Termination phase: Saturation
% 11.07/2.49 % (201955)Time elapsed: 0.067 s
% 11.07/2.49 % (201955)Peak memory usage: 89 MB
% 11.07/2.49 % (201955)Instructions burned: 115 (million)
% 11.07/2.49 % (201956)Instruction limit reached!
% 11.07/2.49 % (201956)------------------------------
% 11.07/2.49 % (201956)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.07/2.49 % (201956)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.07/2.49 % (201956)CaDiCaL version: 2.1.3
% 11.07/2.49 % (201956)Termination reason: Instruction limit
% 11.07/2.49 % (201956)Termination phase: Saturation
% 11.07/2.49 % (201956)Time elapsed: 0.119 s
% 11.07/2.49 % (201956)Peak memory usage: 90 MB
% 11.07/2.49 % (201956)Instructions burned: 180 (million)
% 11.07/2.49 % (201967)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1808999478:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 11.07/2.49 % (201966)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3670396351:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 11.07/2.49 % (201965)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=87269950:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 11.07/2.49 % (201968)lrs+10_64_to=lpo:sil=8000:random_seed=4087820714:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 11.07/2.49 % (201965)Instruction limit reached!
% 11.07/2.49 % (201965)------------------------------
% 11.07/2.49 % (201965)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201965)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201965)Termination reason: Instruction limit
% 12.63/2.65 % (201965)Termination phase: Saturation
% 12.63/2.65 % (201965)Time elapsed: 0.090 s
% 12.63/2.65 % (201965)Peak memory usage: 90 MB
% 12.63/2.65 % (201965)Instructions burned: 145 (million)
% 12.63/2.65 % (201966)Instruction limit reached!
% 12.63/2.65 % (201966)------------------------------
% 12.63/2.65 % (201966)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201966)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201966)Termination reason: Instruction limit
% 12.63/2.65 % (201966)Termination phase: Saturation
% 12.63/2.65 % (201966)Time elapsed: 0.095 s
% 12.63/2.65 % (201966)Peak memory usage: 92 MB
% 12.63/2.65 % (201966)Instructions burned: 190 (million)
% 12.63/2.65 % (201967)Instruction limit reached!
% 12.63/2.65 % (201967)------------------------------
% 12.63/2.65 % (201967)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201967)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201967)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201967)Termination reason: Instruction limit
% 12.63/2.65 % (201967)Termination phase: Saturation
% 12.63/2.65 % (201967)Time elapsed: 0.132 s
% 12.63/2.65 % (201967)Peak memory usage: 90 MB
% 12.63/2.65 % (201967)Instructions burned: 220 (million)
% 12.63/2.65 % (201968)Instruction limit reached!
% 12.63/2.65 % (201968)------------------------------
% 12.63/2.65 % (201968)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201968)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201968)Termination reason: Instruction limit
% 12.63/2.65 % (201968)Termination phase: Saturation
% 12.63/2.65 % (201968)Time elapsed: 0.065 s
% 12.63/2.65 % (201968)Peak memory usage: 90 MB
% 12.63/2.65 % (201968)Instructions burned: 126 (million)
% 12.63/2.65 % (201974)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=4020497029:i=157:gtg=all_2995 on theBenchmark for (2995ds/157Mi)
% 12.63/2.65 % (201973)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=776536378:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 12.63/2.65 % (201976)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=307150378:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2994 on theBenchmark for (2994ds/106Mi)
% 12.63/2.65 % (201975)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=1459241671:i=3394:sd=4:ss=included:sgt=64_2994 on theBenchmark for (2994ds/3394Mi)
% 12.63/2.65 % (201974)Instruction limit reached!
% 12.63/2.65 % (201974)------------------------------
% 12.63/2.65 % (201974)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201974)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201974)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201974)Termination reason: Instruction limit
% 12.63/2.65 % (201974)Termination phase: Saturation
% 12.63/2.65 % (201974)Time elapsed: 0.093 s
% 12.63/2.65 % (201974)Peak memory usage: 91 MB
% 12.63/2.65 % (201974)Instructions burned: 158 (million)
% 12.63/2.65 % (201976)Instruction limit reached!
% 12.63/2.65 % (201976)------------------------------
% 12.63/2.65 % (201976)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201976)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201976)Termination reason: Instruction limit
% 12.63/2.65 % (201976)Termination phase: Saturation
% 12.63/2.65 % (201976)Time elapsed: 0.056 s
% 12.63/2.65 % (201976)Peak memory usage: 90 MB
% 12.63/2.65 % (201976)Instructions burned: 108 (million)
% 12.63/2.65 % (201973)Instruction limit reached!
% 12.63/2.65 % (201973)------------------------------
% 12.63/2.65 % (201973)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201973)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201973)Termination reason: Instruction limit
% 12.63/2.65 % (201973)Termination phase: Saturation
% 12.63/2.65 % (201973)Time elapsed: 0.121 s
% 12.63/2.65 % (201973)Peak memory usage: 90 MB
% 12.63/2.65 % (201973)Instructions burned: 195 (million)
% 12.63/2.65 % (201981)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=582798681:i=107_2992 on theBenchmark for (2992ds/107Mi)
% 12.63/2.65 % (201982)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3133323042:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2992 on theBenchmark for (2992ds/242Mi)
% 12.63/2.65 % (201983)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=710085935:cond=fast:i=5208:av=off_2992 on theBenchmark for (2992ds/5208Mi)
% 12.63/2.65 % (201981)Instruction limit reached!
% 12.63/2.65 % (201981)------------------------------
% 12.63/2.65 % (201981)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201981)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201981)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201981)Termination reason: Instruction limit
% 12.63/2.65 % (201981)Termination phase: Saturation
% 12.63/2.65 % (201981)Time elapsed: 0.061 s
% 12.63/2.65 % (201981)Peak memory usage: 90 MB
% 12.63/2.65 % (201981)Instructions burned: 107 (million)
% 12.63/2.65 % (201982)Instruction limit reached!
% 12.63/2.65 % (201982)------------------------------
% 12.63/2.65 % (201982)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201982)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201982)Termination reason: Instruction limit
% 12.63/2.65 % (201982)Termination phase: Saturation
% 12.63/2.65 % (201982)Time elapsed: 0.153 s
% 12.63/2.65 % (201982)Peak memory usage: 90 MB
% 12.63/2.65 % (201982)Instructions burned: 242 (million)
% 12.63/2.65 % (201987)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=2236109836:i=134:sd=2:doe=on:ss=axioms:sgt=14_2990 on theBenchmark for (2990ds/134Mi)
% 12.63/2.65 % (201987)Instruction limit reached!
% 12.63/2.65 % (201987)------------------------------
% 12.63/2.65 % (201987)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201987)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201987)Termination reason: Instruction limit
% 12.63/2.65 % (201987)Termination phase: Saturation
% 12.63/2.65 % (201987)Time elapsed: 0.084 s
% 12.63/2.65 % (201987)Peak memory usage: 90 MB
% 12.63/2.65 % (201987)Instructions burned: 135 (million)
% 12.63/2.65 % (201988)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=2745275338:i=499:bd=all_2989 on theBenchmark for (2989ds/499Mi)
% 12.63/2.65 % (201990)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=599433994:i=191:fgj=on:bd=all_2988 on theBenchmark for (2988ds/191Mi)
% 12.63/2.65 % (201990)Instruction limit reached!
% 12.63/2.65 % (201990)------------------------------
% 12.63/2.65 % (201990)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201990)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201990)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201990)Termination reason: Instruction limit
% 12.63/2.65 % (201990)Termination phase: Saturation
% 12.63/2.65 % (201990)Time elapsed: 0.107 s
% 12.63/2.65 % (201990)Peak memory usage: 93 MB
% 12.63/2.65 % (201990)Instructions burned: 191 (million)
% 12.63/2.65 % (201988)Instruction limit reached!
% 12.63/2.65 % (201988)------------------------------
% 12.63/2.65 % (201988)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201988)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201988)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201988)Termination reason: Instruction limit
% 12.63/2.65 % (201988)Termination phase: Saturation
% 12.63/2.65 % (201988)Time elapsed: 0.255 s
% 12.63/2.65 % (201988)Peak memory usage: 102 MB
% 12.63/2.65 % (201988)Instructions burned: 500 (million)
% 12.63/2.65 % (201953)First to succeed.
% 12.63/2.65 % (201953)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-201946"
% 12.63/2.65 % (201993)lrs-11_32_anc=all:sil=8000:spb=goal_then_units:sac=on:random_seed=3507206580:i=264:kws=precedence:fsr=off_2985 on theBenchmark for (2985ds/264Mi)
% 12.63/2.65 % (201994)lrs-22_64_to=lpo:sil=8000:sp=const_frequency:urr=ec_only:nwc=4:flr=on:random_seed=2111431693:cond=on:i=156:bs=on:gtg=exists_all:er=known_2985 on theBenchmark for (2985ds/156Mi)
% 12.63/2.65 % (201994)Instruction limit reached!
% 12.63/2.65 % (201994)------------------------------
% 12.63/2.65 % (201994)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201994)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201994)Termination reason: Instruction limit
% 12.63/2.65 % (201994)Termination phase: Saturation
% 12.63/2.65 % (201994)Time elapsed: 0.095 s
% 12.63/2.65 % (201994)Peak memory usage: 90 MB
% 12.63/2.65 % (201994)Instructions burned: 156 (million)
% 12.63/2.65 % (201993)Instruction limit reached!
% 12.63/2.65 % (201993)------------------------------
% 12.63/2.65 % (201993)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.63/2.65 % (201993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.63/2.65 % (201993)CaDiCaL version: 2.1.3
% 12.63/2.65 % (201993)Termination reason: Instruction limit
% 12.63/2.65 % (201993)Termination phase: Saturation
% 12.63/2.65 % (201993)Time elapsed: 0.137 s
% 12.63/2.65 % (201993)Peak memory usage: 92 MB
% 12.63/2.65 % (201993)Instructions burned: 266 (million)
% 12.63/2.65 % (201951)Also succeeded, but the first one will report.
% 12.63/2.65 % (201953)Refutation found. Thanks to Tanya!
% 12.63/2.65 % SZS status Unsatisfiable for theBenchmark
% 12.63/2.65 % SZS output start Proof for theBenchmark
% See solution above
% 13.13/2.85 % (201953)------------------------------
% 13.13/2.85 % (201953)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.13/2.85 % (201953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.13/2.85 % (201953)CaDiCaL version: 2.1.3
% 13.13/2.85 % (201953)Termination reason: Refutation
% 13.13/2.85 % (201953)Time elapsed: 1.340 s
% 13.13/2.85 % (201953)Peak memory usage: 139 MB
% 13.13/2.85 % (201953)Instructions burned: 2123 (million)
% 13.13/2.85 % (201953)------------------------------
% 13.13/2.85 % (201953)------------------------------
% 13.13/2.85 % (201946)Success in time 1.774 s
% 13.13/2.85 % Vampire exiting
%------------------------------------------------------------------------------