%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC021-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:04:19 PM UTC 2026
% Result : Unsatisfiable 11.38s 2.08s
% Output : Refutation 11.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 40
% Syntax : Number of formulae : 181 ( 34 unt; 13 def)
% Number of atoms : 558 ( 48 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 599 ( 222 ~; 364 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 22 ( 20 usr; 14 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 147 ( 0 sgn 147 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f12,axiom,
! [X0] : ssItem(skaf83(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
fof(f13,axiom,
! [X0] : ssList(skaf82(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
fof(f57,axiom,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
fof(f60,axiom,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
fof(f61,axiom,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).
fof(f66,axiom,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).
fof(f72,axiom,
! [X0,X1] :
( ~ ssList(X0)
| duplicatefreeP(X0)
| ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
fof(f75,axiom,
! [X0] :
( ~ ssList(X0)
| ssList(tl(X0))
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
fof(f85,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f98,axiom,
! [X0,X1] :
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
fof(f99,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(reorient_equations,[],[f98]) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f107,axiom,
! [X0] :
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
fof(f112,axiom,
! [X0] :
( ~ ssList(X0)
| cons(skaf83(X0),skaf82(X0)) = X0
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
fof(f125,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
fof(f126,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) = app(cons(X0,nil),X1) ),
inference(reorient_equations,[],[f125]) ).
fof(f186,axiom,
! [X2,X3,X0,X1] :
( ~ segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(app(X3,X0),X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
fof(f192,axiom,
! [X2,X3,X0,X1] :
( ~ frontsegP(X0,X1)
| X2 != X3
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X2)
| frontsegP(cons(X2,X0),cons(X3,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
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/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
fof(f200,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
fof(f201,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
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,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f208,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ frontsegP(sk2,X0)
| ~ frontsegP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(sk3,X0)
| ~ frontsegP(sk4,X0)
| ~ segmentP(X0,sk3)
| ~ strictorderedP(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,plain,
ssList(sk3),
inference(definition_unfolding,[],[f200,f205]) ).
fof(f212,plain,
ssList(sk4),
inference(definition_unfolding,[],[f201,f204]) ).
fof(f213,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ frontsegP(sk4,X0)
| ~ frontsegP(sk3,X0) ),
inference(definition_unfolding,[],[f208,f204,f205]) ).
fof(f214,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f210,f204,f205]) ).
fof(f231,plain,
! [X3,X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X3)
| frontsegP(cons(X3,X0),cons(X3,X1)) ),
inference(equality_resolution,[],[f192]) ).
fof(f232,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(equality_resolution,[],[f193]) ).
fof(f242,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f245,plain,
! [X0] : ~ ssItem(skaf83(X0)),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f246,plain,
! [X0] : ~ ssList(skaf82(X0)),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f289,plain,
! [X0] :
( segmentP(X0,X0)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f57]) ).
fof(f292,plain,
! [X0] :
( frontsegP(X0,nil)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f60]) ).
fof(f293,plain,
! [X0] :
( frontsegP(X0,X0)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f61]) ).
fof(f298,plain,
! [X0] :
( ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(consistent_polarity_flipping,[],[f66]) ).
fof(f304,plain,
! [X0,X1] :
( ssList(X0)
| duplicatefreeP(X0)
| ~ ssItem(X1) ),
inference(consistent_polarity_flipping,[],[f72]) ).
fof(f307,plain,
! [X0] :
( ~ ssList(tl(X0))
| ssList(X0)
| nil = X0 ),
inference(consistent_polarity_flipping,[],[f75]) ).
fof(f317,plain,
! [X0,X1] :
( ~ ssList(app(X1,X0))
| ssList(X1)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f85]) ).
fof(f318,plain,
! [X0,X1] :
( ~ ssList(cons(X0,X1))
| ssList(X1)
| ssItem(X0) ),
inference(consistent_polarity_flipping,[],[f86]) ).
fof(f330,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ssItem(X0)
| ssList(X1) ),
inference(consistent_polarity_flipping,[],[f99]) ).
fof(f332,plain,
! [X0,X1] :
( ~ neq(X1,X0)
| ssList(X1)
| ssList(X0)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f102]) ).
fof(f336,plain,
! [X0] :
( ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| nil = X0 ),
inference(consistent_polarity_flipping,[],[f107]) ).
fof(f341,plain,
! [X0] :
( ssList(X0)
| cons(skaf83(X0),skaf82(X0)) = X0
| nil = X0 ),
inference(consistent_polarity_flipping,[],[f112]) ).
fof(f352,plain,
! [X0,X1] :
( ssItem(X0)
| ssList(X1)
| cons(X0,X1) = app(cons(X0,nil),X1) ),
inference(consistent_polarity_flipping,[],[f126]) ).
fof(f404,plain,
! [X2,X3,X0,X1] :
( ~ segmentP(X0,X1)
| ssList(X2)
| ssList(X3)
| ssList(X1)
| ssList(X0)
| segmentP(app(app(X3,X0),X2),X1) ),
inference(consistent_polarity_flipping,[],[f186]) ).
fof(f410,plain,
! [X3,X0,X1] :
( ~ frontsegP(X0,X1)
| ssList(X1)
| ssList(X0)
| ssItem(X3)
| ssItem(X3)
| frontsegP(cons(X3,X0),cons(X3,X1)) ),
inference(consistent_polarity_flipping,[],[f231]) ).
fof(f411,plain,
! [X2,X3,X0,X1] :
( ssList(X3)
| ssList(X2)
| ssList(X0)
| ssItem(X1)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(consistent_polarity_flipping,[],[f232]) ).
fof(f418,plain,
~ ssList(sk3),
inference(consistent_polarity_flipping,[],[f211]) ).
fof(f419,plain,
~ ssList(sk4),
inference(consistent_polarity_flipping,[],[f212]) ).
fof(f422,plain,
! [X0] :
( ~ frontsegP(sk4,X0)
| neq(X0,nil)
| ssList(X0)
| ~ frontsegP(sk3,X0) ),
inference(consistent_polarity_flipping,[],[f213]) ).
fof(f423,plain,
! [X0] :
( ~ frontsegP(sk4,X0)
| neq(sk3,X0)
| ssList(X0)
| ~ segmentP(X0,sk3)
| ~ strictorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f209]) ).
fof(f424,plain,
! [X3,X0,X1] :
( frontsegP(cons(X3,X0),cons(X3,X1))
| ssList(X1)
| ssList(X0)
| ssItem(X3)
| ~ frontsegP(X0,X1) ),
inference(duplicate_literal_removal,[],[f410]) ).
fof(f431,definition,
( spl0_1
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f432,plain,
( nil = sk3
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f431]) ).
fof(f435,definition,
( spl0_2
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f437,plain,
( nil != sk4
| spl0_2 ),
inference(avatar_component_clause,[],[f435]) ).
fof(f438,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f214,f435,f431]) ).
fof(f444,definition,
( spl0_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f445,plain,
( ~ ssList(nil)
| spl0_4 ),
inference(avatar_component_clause,[],[f444]) ).
fof(f453,definition,
( spl0_6
<=> ! [X1] :
( ssItem(X1)
| strictorderedP(cons(X1,nil)) ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f454,plain,
( ! [X1] :
( strictorderedP(cons(X1,nil))
| ssItem(X1) )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f453]) ).
fof(f472,definition,
( spl0_10
<=> ! [X1] : ~ ssItem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f473,plain,
( ! [X1] : ~ ssItem(X1)
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f472]) ).
fof(f475,definition,
( spl0_11
<=> ! [X0] :
( ssList(X0)
| duplicatefreeP(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f476,plain,
( ! [X0] :
( duplicatefreeP(X0)
| ssList(X0) )
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f477,plain,
( spl0_10
| spl0_11 ),
inference(avatar_split_clause,[],[f304,f475,f472]) ).
fof(f479,plain,
spl0_6,
inference(avatar_split_clause,[],[f298,f453]) ).
fof(f480,plain,
~ spl0_4,
inference(avatar_split_clause,[],[f242,f444]) ).
fof(f481,plain,
( neq(sk3,nil)
| ssList(sk3)
| ~ frontsegP(sk3,sk3) ),
inference(resolution,[],[f422,f206]) ).
fof(f482,plain,
( neq(sk3,nil)
| ~ frontsegP(sk3,sk3) ),
inference(forward_subsumption_resolution,[],[f481,f418]) ).
fof(f484,definition,
( spl0_12
<=> frontsegP(sk3,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f486,plain,
( ~ frontsegP(sk3,sk3)
| spl0_12 ),
inference(avatar_component_clause,[],[f484]) ).
fof(f488,definition,
( spl0_13
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f490,plain,
( neq(sk3,nil)
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f488]) ).
fof(f491,plain,
( ~ spl0_12
| spl0_13 ),
inference(avatar_split_clause,[],[f482,f488,f484]) ).
fof(f531,plain,
( ssList(sk3)
| spl0_12 ),
inference(resolution,[],[f293,f486]) ).
fof(f534,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[],[f531,f418]) ).
fof(f535,plain,
spl0_12,
inference(avatar_contradiction_clause,[],[f534]) ).
fof(f573,plain,
( ! [X1] : strictorderedP(cons(X1,nil))
| ~ spl0_6
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f454,f473]) ).
fof(f659,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,X1))
| ssList(X1) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f318,f473]) ).
fof(f666,plain,
( ! [X0,X1] :
( nil != cons(X0,X1)
| ssList(X1) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f330,f473]) ).
fof(f740,plain,
( ssList(sk3)
| ssList(nil)
| nil = sk3
| ~ spl0_13 ),
inference(resolution,[],[f332,f490]) ).
fof(f745,plain,
( ssList(nil)
| nil = sk3
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f740,f418]) ).
fof(f746,plain,
( nil = sk3
| spl0_4
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f745,f445]) ).
fof(f749,plain,
( spl0_1
| spl0_4
| ~ spl0_13 ),
inference(avatar_split_clause,[],[f746,f488,f444,f431]) ).
fof(f831,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| nil = sk4 ),
inference(resolution,[],[f336,f419]) ).
fof(f832,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f831,f437]) ).
fof(f866,plain,
( sk4 = cons(skaf83(sk4),skaf82(sk4))
| nil = sk4 ),
inference(resolution,[],[f341,f419]) ).
fof(f867,plain,
( sk4 = cons(skaf83(sk4),skaf82(sk4))
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f866,f437]) ).
fof(f881,definition,
( spl0_24
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_24])],[avatar_definition]) ).
fof(f882,plain,
( ~ ssList(tl(sk4))
| spl0_24 ),
inference(avatar_component_clause,[],[f881]) ).
fof(f883,plain,
( ssList(tl(sk4))
| ~ spl0_24 ),
inference(avatar_component_clause,[],[f881]) ).
fof(f894,plain,
( ssList(sk4)
| nil = sk4
| ~ spl0_24 ),
inference(resolution,[],[f883,f307]) ).
fof(f895,plain,
( nil = sk4
| ~ spl0_24 ),
inference(forward_subsumption_resolution,[],[f894,f419]) ).
fof(f896,plain,
( $false
| spl0_2
| ~ spl0_24 ),
inference(forward_subsumption_resolution,[],[f895,f437]) ).
fof(f897,plain,
( spl0_2
| ~ spl0_24 ),
inference(avatar_contradiction_clause,[],[f896]) ).
fof(f920,plain,
( ! [X0,X1] :
( ssList(X1)
| cons(X0,X1) = app(cons(X0,nil),X1) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f352,f473]) ).
fof(f953,plain,
( ! [X0] : cons(X0,sk3) = app(cons(X0,nil),sk3)
| ~ spl0_10 ),
inference(resolution,[],[f920,f418]) ).
fof(f955,plain,
( ! [X0] : cons(X0,nil) = app(cons(X0,nil),nil)
| ~ spl0_1
| ~ spl0_10 ),
inference(forward_demodulation,[],[f953,f432]) ).
fof(f1624,plain,
( ! [X3,X0,X1] :
( frontsegP(cons(X3,X0),cons(X3,X1))
| ssList(X1)
| ssList(X0)
| ~ frontsegP(X0,X1) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f424,f473]) ).
fof(f1640,plain,
( ! [X0] :
( frontsegP(sk4,cons(hd(sk4),X0))
| ssList(X0)
| ssList(tl(sk4))
| ~ frontsegP(tl(sk4),X0) )
| spl0_2
| ~ spl0_10 ),
inference(superposition,[],[f1624,f832]) ).
fof(f1647,plain,
( ! [X0] :
( ~ frontsegP(tl(sk4),X0)
| ssList(X0)
| frontsegP(sk4,cons(hd(sk4),X0)) )
| spl0_2
| ~ spl0_10
| spl0_24 ),
inference(forward_subsumption_resolution,[],[f1640,f882]) ).
fof(f1996,plain,
! [X2,X0,X1] :
( ssList(X0)
| ssList(X1)
| ssList(X2)
| ssList(X2)
| segmentP(app(app(X1,X2),X0),X2)
| ssList(X2) ),
inference(resolution,[],[f404,f289]) ).
fof(f1999,plain,
! [X2,X0,X1] :
( segmentP(app(app(X1,X2),X0),X2)
| ssList(X1)
| ssList(X2)
| ssList(X0) ),
inference(duplicate_literal_removal,[],[f1996]) ).
fof(f5594,plain,
( ! [X2,X3,X0,X1] :
( ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ssList(X2)
| ssList(X0)
| ssItem(X1)
| ssList(X3) )
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f411,f476]) ).
fof(f5595,plain,
( ! [X2,X3,X0,X1] :
( ssList(X0)
| ssList(X1)
| ssItem(X2)
| ssList(X3)
| ssList(app(X1,cons(X2,X0)))
| ssList(cons(X2,X3)) )
| ~ spl0_11 ),
inference(resolution,[],[f5594,f317]) ).
fof(f5604,plain,
( ! [X2,X3,X0,X1] :
( ssList(X0)
| ssList(X1)
| ssItem(X2)
| ssList(X3)
| ssList(app(X1,cons(X2,X0))) )
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f5595,f318]) ).
fof(f5610,definition,
( spl0_114
<=> ! [X3] : ssList(X3) ),
introduced(definition,[new_symbols(definition,[spl0_114])],[avatar_definition]) ).
fof(f5611,plain,
( ! [X3] : ssList(X3)
| ~ spl0_114 ),
inference(avatar_component_clause,[],[f5610]) ).
fof(f5613,definition,
( spl0_115
<=> ! [X2,X0,X1] :
( ssList(X0)
| ssList(X1)
| ssList(app(X1,cons(X2,X0)))
| ssItem(X2) ) ),
introduced(definition,[new_symbols(definition,[spl0_115])],[avatar_definition]) ).
fof(f5614,plain,
( ! [X2,X0,X1] :
( ssList(app(X1,cons(X2,X0)))
| ssList(X1)
| ssList(X0)
| ssItem(X2) )
| ~ spl0_115 ),
inference(avatar_component_clause,[],[f5613]) ).
fof(f5615,plain,
( spl0_114
| spl0_115
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f5604,f475,f5613,f5610]) ).
fof(f5754,plain,
( $false
| ~ spl0_114 ),
inference(backward_subsumption_resolution,[],[f419,f5611]) ).
fof(f5787,plain,
~ spl0_114,
inference(avatar_contradiction_clause,[],[f5754]) ).
fof(f12001,plain,
( ! [X0] :
( ssList(app(X0,sk4))
| ssList(X0)
| ssList(skaf82(sk4))
| ssItem(skaf83(sk4)) )
| spl0_2
| ~ spl0_115 ),
inference(superposition,[],[f5614,f867]) ).
fof(f12003,plain,
( ! [X0] :
( ssList(app(X0,sk4))
| ssList(X0)
| ssItem(skaf83(sk4)) )
| spl0_2
| ~ spl0_115 ),
inference(forward_subsumption_resolution,[],[f12001,f246]) ).
fof(f12006,plain,
( ! [X0] :
( ssList(app(X0,sk4))
| ssList(X0) )
| spl0_2
| ~ spl0_115 ),
inference(forward_subsumption_resolution,[],[f12003,f245]) ).
fof(f12013,plain,
( ! [X0] :
( ssList(X0)
| ssList(X0)
| ssList(sk4) )
| spl0_2
| ~ spl0_115 ),
inference(resolution,[],[f12006,f317]) ).
fof(f12018,plain,
( ! [X0] :
( ssList(X0)
| ssList(sk4) )
| spl0_2
| ~ spl0_115 ),
inference(duplicate_literal_removal,[],[f12013]) ).
fof(f12024,plain,
( ! [X0] : ssList(X0)
| spl0_2
| ~ spl0_115 ),
inference(forward_subsumption_resolution,[],[f12018,f419]) ).
fof(f12032,plain,
( spl0_114
| spl0_2
| ~ spl0_115 ),
inference(avatar_split_clause,[],[f12024,f5613,f435,f5610]) ).
fof(f16921,plain,
( ! [X0,X1] :
( segmentP(app(cons(X0,nil),X1),nil)
| ssList(cons(X0,nil))
| ssList(nil)
| ssList(X1) )
| ~ spl0_1
| ~ spl0_10 ),
inference(superposition,[],[f1999,f955]) ).
fof(f17070,plain,
( ! [X0,X1] :
( segmentP(app(cons(X0,nil),X1),nil)
| ssList(nil)
| ssList(X1) )
| ~ spl0_1
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f16921,f659]) ).
fof(f17138,plain,
( ! [X0,X1] :
( segmentP(app(cons(X0,nil),X1),nil)
| ssList(X1) )
| ~ spl0_1
| spl0_4
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f17070,f445]) ).
fof(f17567,plain,
( ! [X0] :
( segmentP(cons(X0,nil),nil)
| ssList(nil) )
| ~ spl0_1
| spl0_4
| ~ spl0_10 ),
inference(superposition,[],[f17138,f955]) ).
fof(f17626,plain,
( ! [X0] : segmentP(cons(X0,nil),nil)
| ~ spl0_1
| spl0_4
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f17567,f445]) ).
fof(f61219,plain,
( ssList(nil)
| frontsegP(sk4,cons(hd(sk4),nil))
| ssList(tl(sk4))
| spl0_2
| ~ spl0_10
| spl0_24 ),
inference(resolution,[],[f1647,f292]) ).
fof(f61223,plain,
( frontsegP(sk4,cons(hd(sk4),nil))
| ssList(tl(sk4))
| spl0_2
| spl0_4
| ~ spl0_10
| spl0_24 ),
inference(forward_subsumption_resolution,[],[f61219,f445]) ).
fof(f61228,plain,
( frontsegP(sk4,cons(hd(sk4),nil))
| spl0_2
| spl0_4
| ~ spl0_10
| spl0_24 ),
inference(forward_subsumption_resolution,[],[f61223,f882]) ).
fof(f61236,plain,
( neq(sk3,cons(hd(sk4),nil))
| ssList(cons(hd(sk4),nil))
| ~ segmentP(cons(hd(sk4),nil),sk3)
| ~ strictorderedP(cons(hd(sk4),nil))
| spl0_2
| spl0_4
| ~ spl0_10
| spl0_24 ),
inference(resolution,[],[f61228,f423]) ).
fof(f61255,plain,
( neq(sk3,cons(hd(sk4),nil))
| ssList(cons(hd(sk4),nil))
| ~ segmentP(cons(hd(sk4),nil),sk3)
| spl0_2
| spl0_4
| ~ spl0_6
| ~ spl0_10
| spl0_24 ),
inference(forward_subsumption_resolution,[],[f61236,f573]) ).
fof(f61261,definition,
( spl0_1305
<=> ssList(cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_1305])],[avatar_definition]) ).
fof(f61263,plain,
( ssList(cons(hd(sk4),nil))
| ~ spl0_1305 ),
inference(avatar_component_clause,[],[f61261]) ).
fof(f61287,plain,
( neq(nil,cons(hd(sk4),nil))
| ssList(cons(hd(sk4),nil))
| ~ segmentP(cons(hd(sk4),nil),sk3)
| ~ spl0_1
| spl0_2
| spl0_4
| ~ spl0_6
| ~ spl0_10
| spl0_24 ),
inference(forward_demodulation,[],[f61255,f432]) ).
fof(f61299,plain,
( ~ segmentP(cons(hd(sk4),nil),nil)
| neq(nil,cons(hd(sk4),nil))
| ssList(cons(hd(sk4),nil))
| ~ spl0_1
| spl0_2
| spl0_4
| ~ spl0_6
| ~ spl0_10
| spl0_24 ),
inference(forward_demodulation,[],[f61287,f432]) ).
fof(f61300,plain,
( neq(nil,cons(hd(sk4),nil))
| ssList(cons(hd(sk4),nil))
| ~ spl0_1
| spl0_2
| spl0_4
| ~ spl0_6
| ~ spl0_10
| spl0_24 ),
inference(forward_subsumption_resolution,[],[f61299,f17626]) ).
fof(f61302,definition,
( spl0_1313
<=> neq(nil,cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_1313])],[avatar_definition]) ).
fof(f61304,plain,
( neq(nil,cons(hd(sk4),nil))
| ~ spl0_1313 ),
inference(avatar_component_clause,[],[f61302]) ).
fof(f61305,plain,
( spl0_1305
| spl0_1313
| ~ spl0_1
| spl0_2
| spl0_4
| ~ spl0_6
| ~ spl0_10
| spl0_24 ),
inference(avatar_split_clause,[],[f61300,f881,f472,f453,f444,f435,f431,f61302,f61261]) ).
fof(f61326,plain,
( ssList(nil)
| ~ spl0_10
| ~ spl0_1305 ),
inference(resolution,[],[f61263,f659]) ).
fof(f61327,plain,
( $false
| spl0_4
| ~ spl0_10
| ~ spl0_1305 ),
inference(forward_subsumption_resolution,[],[f61326,f445]) ).
fof(f61328,plain,
( spl0_4
| ~ spl0_10
| ~ spl0_1305 ),
inference(avatar_contradiction_clause,[],[f61327]) ).
fof(f62178,plain,
( ssList(nil)
| ssList(cons(hd(sk4),nil))
| nil = cons(hd(sk4),nil)
| ~ spl0_1313 ),
inference(resolution,[],[f61304,f332]) ).
fof(f62179,plain,
( ssList(nil)
| nil = cons(hd(sk4),nil)
| ~ spl0_10
| ~ spl0_1313 ),
inference(forward_subsumption_resolution,[],[f62178,f659]) ).
fof(f62181,plain,
( ssList(nil)
| ~ spl0_10
| ~ spl0_1313 ),
inference(forward_subsumption_resolution,[],[f62179,f666]) ).
fof(f62182,plain,
( $false
| spl0_4
| ~ spl0_10
| ~ spl0_1313 ),
inference(forward_subsumption_resolution,[],[f62181,f445]) ).
fof(f62183,plain,
( spl0_4
| ~ spl0_10
| ~ spl0_1313 ),
inference(avatar_contradiction_clause,[],[f62182]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f438]) ).
cnf(s8,plain,
( spl0_10
| spl0_11 ),
inference(sat_conversion,[],[f477]) ).
cnf(s10,plain,
spl0_6,
inference(sat_conversion,[],[f479]) ).
cnf(s11,plain,
~ spl0_4,
inference(sat_conversion,[],[f480]) ).
cnf(s12,plain,
( ~ spl0_12
| spl0_13 ),
inference(sat_conversion,[],[f491]) ).
cnf(s17,plain,
spl0_12,
inference(sat_conversion,[],[f535]) ).
cnf(s22,plain,
( spl0_1
| spl0_4
| ~ spl0_13 ),
inference(sat_conversion,[],[f749]) ).
cnf(s27,plain,
( spl0_2
| ~ spl0_24 ),
inference(sat_conversion,[],[f897]) ).
cnf(s171,plain,
( ~ spl0_11
| spl0_114
| spl0_115 ),
inference(sat_conversion,[],[f5615]) ).
cnf(s205,plain,
~ spl0_114,
inference(sat_conversion,[],[f5787]) ).
cnf(s351,plain,
( spl0_2
| spl0_114
| ~ spl0_115 ),
inference(sat_conversion,[],[f12032]) ).
cnf(s1662,plain,
( ~ spl0_1
| spl0_2
| spl0_4
| ~ spl0_6
| ~ spl0_10
| spl0_24
| spl0_1305
| spl0_1313 ),
inference(sat_conversion,[],[f61305]) ).
cnf(s1663,plain,
( spl0_4
| ~ spl0_10
| ~ spl0_1305 ),
inference(sat_conversion,[],[f61328]) ).
cnf(s1676,plain,
( spl0_4
| ~ spl0_10
| ~ spl0_1313 ),
inference(sat_conversion,[],[f62183]) ).
cnf(s1704,plain,
( ~ spl0_11
| spl0_115 ),
inference(rat,[],[s171,s205]) ).
cnf(s1712,plain,
spl0_13,
inference(rat,[],[s12,s17]) ).
cnf(s1715,plain,
spl0_1,
inference(rat,[],[s22,s1712,s11]) ).
cnf(s1726,plain,
~ spl0_2,
inference(rat,[],[s1,s1715]) ).
cnf(s1731,plain,
~ spl0_115,
inference(rat,[],[s351,s205,s1726]) ).
cnf(s1735,plain,
~ spl0_24,
inference(rat,[],[s27,s1726]) ).
cnf(s1927,plain,
~ spl0_11,
inference(rat,[],[s1704,s1731]) ).
cnf(s1947,plain,
spl0_10,
inference(rat,[],[s8,s1927]) ).
cnf(s2074,plain,
~ spl0_1313,
inference(rat,[],[s1676,s11,s1947]) ).
cnf(s2075,plain,
~ spl0_1305,
inference(rat,[],[s1663,s11,s1947]) ).
cnf(s2126,plain,
$false,
inference(rat,[],[s1662,s2074,s1735,s1726,s10,s1715,s11,s2075,s1947]) ).
fof(f62184,plain,
$false,
inference(avatar_sat_refutation,[],[s2126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC021-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n006.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:28:11 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
% 11.38/2.07 % (3796793)Will run a generic schedule for satisfiability detection.
% 11.38/2.07 % (3796801)dis+10_1_sil=32000:sp=arity:random_seed=1775687460:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 11.38/2.07 % (3796799)% WARNING: option uhcvi not known.
% 11.38/2.07 % (3796798)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2892117534_2999 on theBenchmark for (2999ds/0Mi)
% 11.38/2.07 % (3796799)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1417601435:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 11.38/2.07 % (3796800)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4073086841:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 11.38/2.07 % (3796802)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1945017569:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 11.38/2.07 % (3796803)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3900137416:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 11.38/2.07 % (3796804)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=364496997:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 11.38/2.07 % TRYING [1]
% 11.38/2.07 % TRYING [2]
% 11.38/2.07 % TRYING [3]
% 11.38/2.07 % (3796801)Instruction limit reached!
% 11.38/2.07 % (3796801)------------------------------
% 11.38/2.07 % (3796801)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.07 % (3796801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.07 % (3796801)CaDiCaL version: 2.1.3
% 11.38/2.07 % (3796801)Termination reason: Instruction limit
% 11.38/2.07 % (3796801)Termination phase: Saturation
% 11.38/2.07 % (3796801)Time elapsed: 0.034 s
% 11.38/2.07 % (3796801)Peak memory usage: 13 MB
% 11.38/2.07 % (3796801)Instructions burned: 104 (million)
% 11.38/2.07 % (3796812)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=17059766:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 11.38/2.07 % TRYING [4]
% 11.38/2.07 % TRYING [1]
% 11.38/2.07 % TRYING [2]
% 11.38/2.07 % TRYING [3]
% 11.38/2.07 % TRYING [4]
% 11.38/2.07 % (3796802)Instruction limit reached!
% 11.38/2.07 % (3796802)------------------------------
% 11.38/2.07 % (3796802)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.07 % (3796802)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796802)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796802)Termination reason: Instruction limit
% 11.38/2.08 % (3796802)Termination phase: Saturation
% 11.38/2.08 % (3796802)Time elapsed: 0.061 s
% 11.38/2.08 % (3796802)Peak memory usage: 13 MB
% 11.38/2.08 % (3796802)Instructions burned: 117 (million)
% 11.38/2.08 % (3796803)Instruction limit reached!
% 11.38/2.08 % (3796803)------------------------------
% 11.38/2.08 % (3796803)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796803)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796803)Termination reason: Instruction limit
% 11.38/2.08 % (3796803)Termination phase: Saturation
% 11.38/2.08 % (3796803)Time elapsed: 0.067 s
% 11.38/2.08 % (3796803)Peak memory usage: 14 MB
% 11.38/2.08 % (3796803)Instructions burned: 132 (million)
% 11.38/2.08 % (3796814)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=80641129:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 11.38/2.08 % (3796815)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=6799349:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 11.38/2.08 % (3796804)Instruction limit reached!
% 11.38/2.08 % (3796804)------------------------------
% 11.38/2.08 % (3796804)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796804)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796804)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796804)Termination reason: Instruction limit
% 11.38/2.08 % (3796804)Termination phase: Saturation
% 11.38/2.08 % (3796804)Time elapsed: 0.088 s
% 11.38/2.08 % (3796804)Peak memory usage: 14 MB
% 11.38/2.08 % (3796804)Instructions burned: 159 (million)
% 11.38/2.08 % TRYING [5]
% 11.38/2.08 % TRYING [5]
% 11.38/2.08 % (3796818)ott-21_1_sil=16000:fs=off:random_seed=2124667406:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 11.38/2.08 % (3796814)Instruction limit reached!
% 11.38/2.08 % (3796814)------------------------------
% 11.38/2.08 % (3796814)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796814)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796814)Termination reason: Instruction limit
% 11.38/2.08 % (3796814)Termination phase: Saturation
% 11.38/2.08 % (3796814)Time elapsed: 0.073 s
% 11.38/2.08 % (3796814)Peak memory usage: 14 MB
% 11.38/2.08 % (3796814)Instructions burned: 131 (million)
% 11.38/2.08 % (3796820)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3559441811:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 11.38/2.08 % TRYING [6]
% 11.38/2.08 % (3796812)Instruction limit reached!
% 11.38/2.08 % (3796812)------------------------------
% 11.38/2.08 % (3796812)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796812)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796812)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796812)Termination reason: Instruction limit
% 11.38/2.08 % (3796812)Termination phase: Finite model building constraint generation
% 11.38/2.08 % (3796812)Time elapsed: 0.150 s
% 11.38/2.08 % (3796812)Peak memory usage: 36 MB
% 11.38/2.08 % (3796812)Instructions burned: 718 (million)
% 11.38/2.08 % (3796818)Instruction limit reached!
% 11.38/2.08 % (3796818)------------------------------
% 11.38/2.08 % (3796818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796818)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796818)Termination reason: Instruction limit
% 11.38/2.08 % (3796818)Termination phase: Saturation
% 11.38/2.08 % (3796818)Time elapsed: 0.082 s
% 11.38/2.08 % (3796818)Peak memory usage: 13 MB
% 11.38/2.08 % (3796818)Instructions burned: 180 (million)
% 11.38/2.08 % (3796822)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1406142635:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 11.38/2.08 % TRYING [1]
% 11.38/2.08 % TRYING [2]
% 11.38/2.08 % TRYING [3]
% 11.38/2.08 % (3796823)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3390032672:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 11.38/2.08 % TRYING [4]
% 11.38/2.08 % TRYING [6]
% 11.38/2.08 % TRYING [5]
% 11.38/2.08 % (3796822)Instruction limit reached!
% 11.38/2.08 % (3796822)------------------------------
% 11.38/2.08 % (3796822)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796822)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796822)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796822)Termination reason: Instruction limit
% 11.38/2.08 % (3796822)Termination phase: Finite model building SAT solving
% 11.38/2.08 % (3796822)Time elapsed: 0.178 s
% 11.38/2.08 % (3796822)Peak memory usage: 23 MB
% 11.38/2.08 % (3796822)Instructions burned: 869 (million)
% 11.38/2.08 % (3796826)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=297712706:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 11.38/2.08 % TRYING [14]
% 11.38/2.08 % (3796815)Instruction limit reached!
% 11.38/2.08 % (3796815)------------------------------
% 11.38/2.08 % (3796815)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796815)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796815)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796815)Termination reason: Instruction limit
% 11.38/2.08 % (3796815)Termination phase: Saturation
% 11.38/2.08 % (3796815)Time elapsed: 0.398 s
% 11.38/2.08 % (3796815)Peak memory usage: 16 MB
% 11.38/2.08 % (3796815)Instructions burned: 685 (million)
% 11.38/2.08 % (3796820)Instruction limit reached!
% 11.38/2.08 % (3796820)------------------------------
% 11.38/2.08 % (3796820)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796820)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796820)Termination reason: Instruction limit
% 11.38/2.08 % (3796820)Termination phase: Saturation
% 11.38/2.08 % (3796820)Time elapsed: 0.312 s
% 11.38/2.08 % (3796820)Peak memory usage: 14 MB
% 11.38/2.08 % (3796820)Instructions burned: 477 (million)
% 11.38/2.08 % (3796828)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2194525951:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 11.38/2.08 % (3796829)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1517612102:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 11.38/2.08 % (3796826)Instruction limit reached!
% 11.38/2.08 % (3796826)------------------------------
% 11.38/2.08 % (3796826)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796826)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796826)Termination reason: Instruction limit
% 11.38/2.08 % (3796826)Termination phase: Finite model building constraint generation
% 11.38/2.08 % (3796826)Time elapsed: 0.177 s
% 11.38/2.08 % (3796826)Peak memory usage: 73 MB
% 11.38/2.08 % (3796826)Instructions burned: 892 (million)
% 11.38/2.08 % (3796832)fmb+10_1_sil=64000:random_seed=2142211411:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 11.38/2.08 % TRYING [1]
% 11.38/2.08 % TRYING [2]
% 11.38/2.08 % TRYING [3]
% 11.38/2.08 % TRYING [4]
% 11.38/2.08 % TRYING [5]
% 11.38/2.08 % TRYING [7]
% 11.38/2.08 % (3796823)Instruction limit reached!
% 11.38/2.08 % (3796823)------------------------------
% 11.38/2.08 % (3796823)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796823)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796823)Termination reason: Instruction limit
% 11.38/2.08 % (3796823)Termination phase: Saturation
% 11.38/2.08 % (3796823)Time elapsed: 0.635 s
% 11.38/2.08 % (3796823)Peak memory usage: 28 MB
% 11.38/2.08 % (3796823)Instructions burned: 1179 (million)
% 11.38/2.08 % (3796834)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3393562953:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 11.38/2.08 % TRYING [20]
% 11.38/2.08 % (3796828)Instruction limit reached!
% 11.38/2.08 % (3796828)------------------------------
% 11.38/2.08 % (3796828)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796828)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796828)Termination reason: Instruction limit
% 11.38/2.08 % (3796828)Termination phase: Saturation
% 11.38/2.08 % (3796828)Time elapsed: 0.383 s
% 11.38/2.08 % (3796828)Peak memory usage: 21 MB
% 11.38/2.08 % (3796828)Instructions burned: 694 (million)
% 11.38/2.08 % (3796836)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=682738642:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 11.38/2.08 % TRYING [6]
% 11.38/2.08 % TRYING [8]
% 11.38/2.08 % (3796829)Instruction limit reached!
% 11.38/2.08 % (3796829)------------------------------
% 11.38/2.08 % (3796829)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796829)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796829)Termination reason: Instruction limit
% 11.38/2.08 % (3796829)Termination phase: Saturation
% 11.38/2.08 % (3796829)Time elapsed: 0.470 s
% 11.38/2.08 % (3796829)Peak memory usage: 20 MB
% 11.38/2.08 % (3796829)Instructions burned: 879 (million)
% 11.38/2.08 % (3796838)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=4102569047:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 11.38/2.08 % (3796836)Instruction limit reached!
% 11.38/2.08 % (3796836)------------------------------
% 11.38/2.08 % (3796836)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796836)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796836)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796836)Termination reason: Instruction limit
% 11.38/2.08 % (3796836)Termination phase: Finite model building constraint generation
% 11.38/2.08 % (3796836)Time elapsed: 0.335 s
% 11.38/2.08 % (3796836)Peak memory usage: 79 MB
% 11.38/2.08 % (3796836)Instructions burned: 921 (million)
% 11.38/2.08 % (3796840)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3595840506:i=1472:ins=7:fdi=8:gsp=on_2987 on theBenchmark for (2987ds/1472Mi)
% 11.38/2.08 % TRYING [7]
% 11.38/2.08 % (3796799) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3796793-3796799"...
% 11.38/2.08 % (3796799)...printing done.
% 11.38/2.08 % (3796799)Refutation found. Thanks to Tanya!
% 11.38/2.08 % SZS status Unsatisfiable for theBenchmark
% 11.38/2.08 % SZS output start Proof for theBenchmark
% See solution above
% 11.38/2.08 % (3796799)------------------------------
% 11.38/2.08 % (3796799)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.08 % (3796799)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.08 % (3796799)CaDiCaL version: 2.1.3
% 11.38/2.08 % (3796799)Termination reason: Refutation
% 11.38/2.08 % (3796799)Time elapsed: 1.592 s
% 11.38/2.08 % (3796799)Peak memory usage: 40 MB
% 11.38/2.08 % (3796799)Instructions burned: 3033 (million)
% 11.38/2.08 % (3796793)Success in time 1.654 s
% 11.38/2.08 % Vampire exiting
%------------------------------------------------------------------------------