%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC242+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 : n019.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:13 PM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 84 ( 12 unt; 6 def)
% Number of atoms : 406 ( 51 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 580 ( 258 ~; 256 |; 50 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 7 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 73 ( 0 sgn 57 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) )
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ssItem(X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& memberP(X10,X11)
& lt(X8,X11) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) )
| ( nil != X2
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X9,cons(X8,nil)),X10) != X2
| ? [X11] :
( ssItem(X11)
& ~ leq(X8,X11)
& memberP(X9,X11)
& memberP(X10,X11)
& lt(X8,X11) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& memberP(X6,X7)
& lt(X4,X7)
& ~ leq(X4,X7) ) ) ) )
& ( nil = X2
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ssList(X10)
& app(app(X9,cons(X8,nil)),X10) = X2
& ! [X11] :
( ~ ssItem(X11)
| leq(X8,X11)
| ~ memberP(X9,X11)
| ~ memberP(X10,X11)
| ~ lt(X8,X11) ) )
& ssList(X9) )
& ssItem(X8) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f295,plain,
( ssList(sK56)
& sK54 = sK56
& sK53 = sK55
& nil != sK53
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| ( ssItem(sK57(X4,X5,X6))
& memberP(X5,sK57(X4,X5,X6))
& memberP(X6,sK57(X4,X5,X6))
& lt(X4,sK57(X4,X5,X6))
& ~ leq(X4,sK57(X4,X5,X6)) ) ) ) )
& ( nil = sK55
| ( ssList(sK60)
& sK55 = app(app(sK59,cons(sK58,nil)),sK60)
& ! [X11] :
( ~ ssItem(X11)
| leq(sK58,X11)
| ~ memberP(sK59,X11)
| ~ memberP(sK60,X11)
| ~ lt(sK58,X11) )
& ssList(sK59)
& ssItem(sK58) ) )
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59,sK60]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X7,sK57(X4,X5,X6)),skolemize(X8,sK58),skolemize(X9,sK59),skolemize(X10,sK60)],[f221]) ).
fof(f498,plain,
( nil = sK55
| ssItem(sK58) ),
inference(cnf_transformation,[],[f295]) ).
fof(f499,plain,
( nil = sK55
| ssList(sK59) ),
inference(cnf_transformation,[],[f295]) ).
fof(f500,plain,
! [X11] :
( nil = sK55
| ~ ssItem(X11)
| leq(sK58,X11)
| ~ memberP(sK59,X11)
| ~ memberP(sK60,X11)
| ~ lt(sK58,X11) ),
inference(cnf_transformation,[],[f295]) ).
fof(f501,plain,
( nil = sK55
| sK55 = app(app(sK59,cons(sK58,nil)),sK60) ),
inference(cnf_transformation,[],[f295]) ).
fof(f502,plain,
( nil = sK55
| ssList(sK60) ),
inference(cnf_transformation,[],[f295]) ).
fof(f503,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| ~ leq(X4,sK57(X4,X5,X6)) ),
inference(cnf_transformation,[],[f295]) ).
fof(f504,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| lt(X4,sK57(X4,X5,X6)) ),
inference(cnf_transformation,[],[f295]) ).
fof(f505,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| memberP(X6,sK57(X4,X5,X6)) ),
inference(cnf_transformation,[],[f295]) ).
fof(f506,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| memberP(X5,sK57(X4,X5,X6)) ),
inference(cnf_transformation,[],[f295]) ).
fof(f507,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| ssItem(sK57(X4,X5,X6)) ),
inference(cnf_transformation,[],[f295]) ).
fof(f508,plain,
nil != sK53,
inference(cnf_transformation,[],[f295]) ).
fof(f509,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f295]) ).
fof(f512,plain,
nil != sK55,
inference(definition_unfolding,[],[f508,f509]) ).
fof(f513,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| ssItem(sK57(X4,X5,X6)) ),
inference(definition_unfolding,[],[f507,f509]) ).
fof(f514,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| memberP(X5,sK57(X4,X5,X6)) ),
inference(definition_unfolding,[],[f506,f509]) ).
fof(f515,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| memberP(X6,sK57(X4,X5,X6)) ),
inference(definition_unfolding,[],[f505,f509]) ).
fof(f516,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| lt(X4,sK57(X4,X5,X6)) ),
inference(definition_unfolding,[],[f504,f509]) ).
fof(f517,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| ~ leq(X4,sK57(X4,X5,X6)) ),
inference(definition_unfolding,[],[f503,f509]) ).
fof(f555,definition,
( spl61_1
<=> ssItem(sK58) ),
introduced(definition,[new_symbols(definition,[spl61_1])],[avatar_definition]) ).
fof(f557,plain,
( ssItem(sK58)
| ~ spl61_1 ),
inference(avatar_component_clause,[],[f555]) ).
fof(f559,definition,
( spl61_2
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl61_2])],[avatar_definition]) ).
fof(f562,plain,
( spl61_1
| spl61_2 ),
inference(avatar_split_clause,[],[f498,f559,f555]) ).
fof(f564,definition,
( spl61_3
<=> ssList(sK59) ),
introduced(definition,[new_symbols(definition,[spl61_3])],[avatar_definition]) ).
fof(f566,plain,
( ssList(sK59)
| ~ spl61_3 ),
inference(avatar_component_clause,[],[f564]) ).
fof(f567,plain,
( spl61_3
| spl61_2 ),
inference(avatar_split_clause,[],[f499,f559,f564]) ).
fof(f569,definition,
( spl61_4
<=> ! [X11] :
( ~ ssItem(X11)
| ~ lt(sK58,X11)
| ~ memberP(sK60,X11)
| ~ memberP(sK59,X11)
| leq(sK58,X11) ) ),
introduced(definition,[new_symbols(definition,[spl61_4])],[avatar_definition]) ).
fof(f570,plain,
( ! [X11] :
( ~ lt(sK58,X11)
| ~ ssItem(X11)
| ~ memberP(sK60,X11)
| ~ memberP(sK59,X11)
| leq(sK58,X11) )
| ~ spl61_4 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f571,plain,
( spl61_4
| spl61_2 ),
inference(avatar_split_clause,[],[f500,f559,f569]) ).
fof(f573,definition,
( spl61_5
<=> sK55 = app(app(sK59,cons(sK58,nil)),sK60) ),
introduced(definition,[new_symbols(definition,[spl61_5])],[avatar_definition]) ).
fof(f575,plain,
( sK55 = app(app(sK59,cons(sK58,nil)),sK60)
| ~ spl61_5 ),
inference(avatar_component_clause,[],[f573]) ).
fof(f576,plain,
( spl61_5
| spl61_2 ),
inference(avatar_split_clause,[],[f501,f559,f573]) ).
fof(f578,definition,
( spl61_6
<=> ssList(sK60) ),
introduced(definition,[new_symbols(definition,[spl61_6])],[avatar_definition]) ).
fof(f580,plain,
( ssList(sK60)
| ~ spl61_6 ),
inference(avatar_component_clause,[],[f578]) ).
fof(f581,plain,
( spl61_6
| spl61_2 ),
inference(avatar_split_clause,[],[f502,f559,f578]) ).
fof(f582,plain,
~ spl61_2,
inference(avatar_split_clause,[],[f512,f559]) ).
fof(f618,plain,
( sK55 != sK55
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| ssItem(sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(superposition,[],[f513,f575]) ).
fof(f619,plain,
( ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| ssItem(sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(trivial_inequality_removal,[],[f618]) ).
fof(f620,plain,
( ~ ssList(sK60)
| ~ ssItem(sK58)
| ssItem(sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5 ),
inference(forward_subsumption_resolution,[],[f619,f566]) ).
fof(f621,plain,
( ~ ssItem(sK58)
| ssItem(sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f620,f580]) ).
fof(f622,plain,
( ssItem(sK57(sK58,sK59,sK60))
| ~ spl61_1
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f621,f557]) ).
fof(f623,plain,
( sK55 != sK55
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| memberP(sK59,sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(superposition,[],[f514,f575]) ).
fof(f624,plain,
( ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| memberP(sK59,sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(trivial_inequality_removal,[],[f623]) ).
fof(f625,plain,
( ~ ssList(sK60)
| ~ ssItem(sK58)
| memberP(sK59,sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5 ),
inference(forward_subsumption_resolution,[],[f624,f566]) ).
fof(f626,plain,
( ~ ssItem(sK58)
| memberP(sK59,sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f625,f580]) ).
fof(f627,plain,
( memberP(sK59,sK57(sK58,sK59,sK60))
| ~ spl61_1
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f626,f557]) ).
fof(f628,plain,
( sK55 != sK55
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| memberP(sK60,sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(superposition,[],[f515,f575]) ).
fof(f629,plain,
( ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| memberP(sK60,sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(trivial_inequality_removal,[],[f628]) ).
fof(f630,plain,
( ~ ssList(sK60)
| ~ ssItem(sK58)
| memberP(sK60,sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5 ),
inference(forward_subsumption_resolution,[],[f629,f566]) ).
fof(f631,plain,
( ~ ssItem(sK58)
| memberP(sK60,sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f630,f580]) ).
fof(f632,plain,
( memberP(sK60,sK57(sK58,sK59,sK60))
| ~ spl61_1
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f631,f557]) ).
fof(f633,plain,
( sK55 != sK55
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| lt(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(superposition,[],[f516,f575]) ).
fof(f634,plain,
( ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| lt(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(trivial_inequality_removal,[],[f633]) ).
fof(f635,plain,
( ~ ssList(sK60)
| ~ ssItem(sK58)
| lt(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5 ),
inference(forward_subsumption_resolution,[],[f634,f566]) ).
fof(f636,plain,
( ~ ssItem(sK58)
| lt(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f635,f580]) ).
fof(f637,plain,
( lt(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_1
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f636,f557]) ).
fof(f638,plain,
( ~ ssItem(sK57(sK58,sK59,sK60))
| ~ memberP(sK60,sK57(sK58,sK59,sK60))
| ~ memberP(sK59,sK57(sK58,sK59,sK60))
| leq(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_1
| ~ spl61_3
| ~ spl61_4
| ~ spl61_5
| ~ spl61_6 ),
inference(resolution,[],[f637,f570]) ).
fof(f639,plain,
( ~ memberP(sK60,sK57(sK58,sK59,sK60))
| ~ memberP(sK59,sK57(sK58,sK59,sK60))
| leq(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_1
| ~ spl61_3
| ~ spl61_4
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f638,f622]) ).
fof(f640,plain,
( ~ memberP(sK59,sK57(sK58,sK59,sK60))
| leq(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_1
| ~ spl61_3
| ~ spl61_4
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f639,f632]) ).
fof(f641,plain,
( leq(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_1
| ~ spl61_3
| ~ spl61_4
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f640,f627]) ).
fof(f642,plain,
( sK55 != sK55
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| ~ leq(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(superposition,[],[f517,f575]) ).
fof(f643,plain,
( ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssItem(sK58)
| ~ leq(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_5 ),
inference(trivial_inequality_removal,[],[f642]) ).
fof(f644,plain,
( ~ ssList(sK60)
| ~ ssItem(sK58)
| ~ leq(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5 ),
inference(forward_subsumption_resolution,[],[f643,f566]) ).
fof(f645,plain,
( ~ ssItem(sK58)
| ~ leq(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f644,f580]) ).
fof(f646,plain,
( ~ leq(sK58,sK57(sK58,sK59,sK60))
| ~ spl61_1
| ~ spl61_3
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f645,f557]) ).
fof(f647,plain,
( $false
| ~ spl61_1
| ~ spl61_3
| ~ spl61_4
| ~ spl61_5
| ~ spl61_6 ),
inference(forward_subsumption_resolution,[],[f641,f646]) ).
fof(f648,plain,
( ~ spl61_1
| ~ spl61_3
| ~ spl61_4
| ~ spl61_5
| ~ spl61_6 ),
inference(avatar_contradiction_clause,[],[f647]) ).
cnf(s1,plain,
( spl61_1
| spl61_2 ),
inference(sat_conversion,[],[f562]) ).
cnf(s2,plain,
( spl61_2
| spl61_3 ),
inference(sat_conversion,[],[f567]) ).
cnf(s3,plain,
( spl61_2
| spl61_4 ),
inference(sat_conversion,[],[f571]) ).
cnf(s4,plain,
( spl61_2
| spl61_5 ),
inference(sat_conversion,[],[f576]) ).
cnf(s5,plain,
( spl61_2
| spl61_6 ),
inference(sat_conversion,[],[f581]) ).
cnf(s6,plain,
~ spl61_2,
inference(sat_conversion,[],[f582]) ).
cnf(s16,plain,
( ~ spl61_1
| ~ spl61_3
| ~ spl61_4
| ~ spl61_5
| ~ spl61_6 ),
inference(sat_conversion,[],[f648]) ).
cnf(s21,plain,
spl61_6,
inference(rat,[],[s5,s6]) ).
cnf(s22,plain,
spl61_5,
inference(rat,[],[s4,s6]) ).
cnf(s23,plain,
spl61_4,
inference(rat,[],[s3,s6]) ).
cnf(s24,plain,
spl61_3,
inference(rat,[],[s2,s6]) ).
cnf(s25,plain,
~ spl61_1,
inference(rat,[],[s16,s21,s22,s23,s24]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s1,s6,s25]) ).
fof(f649,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC242+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.08/0.18 % Computer : n019.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 08:38:48 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.08/0.26 % (3856374)Will run a generic schedule for satisfiability detection.
% 0.08/0.26 % (3856383)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=147958007:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26 % (3856379)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1927490281_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.26 % (3856381)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=299198123:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.26 % (3856382)dis+10_1_sil=32000:sp=arity:random_seed=3687303976:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.26 % (3856384)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=333722648:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.26 % (3856385)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1191340675:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.26 % (3856380)% WARNING: option uhcvi not known.
% 0.08/0.26 % (3856382) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3856374-3856382"...
% 0.08/0.26 % (3856380)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2502106882:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26 % (3856382)...printing done.
% 0.08/0.26 % (3856385) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3856374-3856385"...
% 0.08/0.26 % (3856382)Refutation found. Thanks to Tanya!
% 0.08/0.26 % SZS status Theorem for theBenchmark
% 0.08/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.27 % (3856382)------------------------------
% 0.08/0.27 % (3856382)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.27 % (3856382)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.27 % (3856382)CaDiCaL version: 2.1.3
% 0.08/0.27 % (3856382)Termination reason: Refutation
% 0.08/0.27 % (3856382)Time elapsed: 0.008 s
% 0.08/0.27 % (3856382)Peak memory usage: 12 MB
% 0.08/0.27 % (3856382)Instructions burned: 13 (million)
% 0.08/0.27 % (3856374)Success in time 0.042 s
% 0.08/0.27 % Vampire exiting
%------------------------------------------------------------------------------