%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC308-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:05:29 PM UTC 2026
% Result : Unsatisfiable 1.75s 0.51s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 31
% Syntax : Number of formulae : 134 ( 26 unt; 12 def)
% Number of atoms : 409 ( 61 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 542 ( 267 ~; 263 |; 0 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 13 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn 101 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f9,axiom,
ssItem(skac3),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause9) ).
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(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
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] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(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(f120,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause117) ).
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(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(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| sk1 != X0
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk2) != X1
| app(X1,X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk2) != X3
| ~ neq(nil,sk2)
| ~ neq(nil,sk2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| app(X1,cons(X0,nil)) = sk3
| app(cons(X0,nil),X1) != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,plain,
! [X0,X1] :
( app(cons(X0,nil),X1) != sk4
| ~ ssList(X1)
| sk3 = app(X1,cons(X0,nil))
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f208]) ).
fof(f211,plain,
ssList(sk3),
inference(definition_unfolding,[],[f200,f205]) ).
fof(f213,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f214,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| sk3 != X0
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X1
| app(X1,X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(definition_unfolding,[],[f207,f205,f204,f204,f204,f204]) ).
fof(f223,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f120]) ).
fof(f232,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(f239,plain,
! [X2,X3,X1] :
( ~ ssList(sk3)
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X1
| app(X1,X2) != sk3
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f214]) ).
fof(f240,plain,
! [X2,X3] :
( ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(X2)
| sk3 != app(tl(sk4),X2)
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f239]) ).
fof(f241,plain,
! [X3] :
( ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(cons(X3,nil))
| sk3 != app(tl(sk4),cons(X3,nil))
| ~ ssItem(X3)
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f240]) ).
fof(f242,plain,
( ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk3 != app(tl(sk4),cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f241]) ).
fof(f243,plain,
( ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk3 != app(tl(sk4),cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4) ),
inference(duplicate_literal_removal,[],[f242]) ).
fof(f247,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f250,plain,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk3 != app(tl(sk4),cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4) ),
inference(global_subsumption,[],[f243,f211]) ).
fof(f252,definition,
( spl0_1
<=> neq(nil,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f254,plain,
( ~ neq(nil,sk4)
| spl0_1 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f256,definition,
( spl0_2
<=> ssItem(hd(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f258,plain,
( ~ ssItem(hd(sk4))
| spl0_2 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f260,definition,
( spl0_3
<=> sk3 = app(tl(sk4),cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f262,plain,
( sk3 != app(tl(sk4),cons(hd(sk4),nil))
| spl0_3 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f264,definition,
( spl0_4
<=> ssList(cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f266,plain,
( ~ ssList(cons(hd(sk4),nil))
| spl0_4 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f268,definition,
( spl0_5
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f269,plain,
( ssList(tl(sk4))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f270,plain,
( ~ ssList(tl(sk4))
| spl0_5 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f271,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f250,f268,f264,f260,f256,f252]) ).
fof(f276,definition,
( spl0_7
<=> ! [X0] : ~ ssItem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f277,plain,
( ! [X0] : ~ ssItem(X0)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f279,definition,
( spl0_8
<=> ! [X1] : ~ neq(X1,X1) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f280,plain,
( ! [X1] : ~ neq(X1,X1)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f282,definition,
( spl0_9
<=> ! [X1] : ~ ssList(X1) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f283,plain,
( ! [X1] : ~ ssList(X1)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f282]) ).
fof(f284,plain,
( $false
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f202,f283]) ).
fof(f285,plain,
~ spl0_9,
inference(avatar_contradiction_clause,[],[f284]) ).
fof(f287,definition,
( spl0_10
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f288,plain,
( nil = sk4
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f289,plain,
( nil != sk4
| spl0_10 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f295,plain,
( $false
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f9,f277]) ).
fof(f296,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f295]) ).
fof(f404,definition,
( spl0_39
<=> ! [X1] : ssItem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_39])],[avatar_definition]) ).
fof(f405,plain,
( ! [X1] : ssItem(X1)
| ~ spl0_39 ),
inference(avatar_component_clause,[],[f404]) ).
fof(f410,definition,
( spl0_41
<=> ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_41])],[avatar_definition]) ).
fof(f411,plain,
( ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) )
| ~ spl0_41 ),
inference(avatar_component_clause,[],[f410]) ).
fof(f412,plain,
( spl0_39
| spl0_41 ),
inference(avatar_split_clause,[],[f72,f410,f404]) ).
fof(f893,plain,
! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(cons(X1,X3))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(X3) ),
inference(resolution,[],[f85,f232]) ).
fof(f1248,plain,
! [X2,X3,X0,X1] :
( ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(X3) ),
inference(forward_subsumption_resolution,[],[f893,f86]) ).
fof(f1275,definition,
( spl0_59
<=> ! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ) ),
introduced(definition,[new_symbols(definition,[spl0_59])],[avatar_definition]) ).
fof(f1276,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) )
| ~ spl0_59 ),
inference(avatar_component_clause,[],[f1275]) ).
fof(f1278,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(cons(X0,X2)) )
| ~ spl0_59 ),
inference(resolution,[],[f1276,f85]) ).
fof(f1279,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(cons(X0,X2)) )
| ~ spl0_59 ),
inference(duplicate_literal_removal,[],[f1278]) ).
fof(f1280,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2) )
| ~ spl0_59 ),
inference(forward_subsumption_resolution,[],[f1279,f86]) ).
fof(f1281,plain,
( spl0_9
| spl0_9
| spl0_7
| ~ spl0_59 ),
inference(avatar_split_clause,[],[f1280,f1275,f276,f282,f282]) ).
fof(f1311,plain,
( ! [X0,X1] :
( duplicatefreeP(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl0_41 ),
inference(resolution,[],[f411,f85]) ).
fof(f1320,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(cons(X1,X3))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(X3) )
| ~ spl0_41 ),
inference(resolution,[],[f1311,f1248]) ).
fof(f1371,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(cons(X1,X3))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(X3) )
| ~ spl0_41 ),
inference(duplicate_literal_removal,[],[f1320]) ).
fof(f1372,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(X3) )
| ~ spl0_41 ),
inference(forward_subsumption_resolution,[],[f1371,f86]) ).
fof(f1386,plain,
( spl0_9
| spl0_59
| ~ spl0_41 ),
inference(avatar_split_clause,[],[f1372,f410,f1275,f282]) ).
fof(f1630,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| nil = sk4
| spl0_1 ),
inference(resolution,[],[f102,f254]) ).
fof(f1635,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f1630,f8]) ).
fof(f1636,plain,
( nil = sk4
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f1635,f203]) ).
fof(f1637,plain,
( $false
| spl0_1
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f1636,f289]) ).
fof(f1638,plain,
( spl0_1
| spl0_10 ),
inference(avatar_contradiction_clause,[],[f1637]) ).
fof(f1639,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_5 ),
inference(resolution,[],[f270,f75]) ).
fof(f1640,plain,
( nil = sk4
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f1639,f203]) ).
fof(f1641,plain,
( $false
| spl0_5
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f1640,f289]) ).
fof(f1642,plain,
( spl0_5
| spl0_10 ),
inference(avatar_contradiction_clause,[],[f1641]) ).
fof(f1645,plain,
( $false
| spl0_2
| ~ spl0_39 ),
inference(forward_subsumption_resolution,[],[f258,f405]) ).
fof(f1646,plain,
( spl0_2
| ~ spl0_39 ),
inference(avatar_contradiction_clause,[],[f1645]) ).
fof(f2880,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| nil = sk4 ),
inference(resolution,[],[f107,f203]) ).
fof(f2982,plain,
( neq(nil,nil)
| ~ spl0_10 ),
inference(superposition,[],[f213,f288]) ).
fof(f3000,plain,
( $false
| ~ spl0_8
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f2982,f280]) ).
fof(f3001,plain,
( ~ spl0_8
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f3000]) ).
fof(f3006,plain,
( ! [X1] : ~ neq(X1,X1)
| ~ spl0_39 ),
inference(forward_subsumption_resolution,[],[f247,f405]) ).
fof(f3007,plain,
( spl0_8
| ~ spl0_39 ),
inference(avatar_split_clause,[],[f3006,f404,f279]) ).
fof(f3016,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f2880,f289]) ).
fof(f6035,plain,
( ! [X0,X1] :
( ~ ssList(X1)
| cons(X0,X1) = app(cons(X0,nil),X1) )
| ~ spl0_39 ),
inference(forward_subsumption_resolution,[],[f126,f405]) ).
fof(f6073,plain,
( ! [X0] : cons(X0,tl(sk4)) = app(cons(X0,nil),tl(sk4))
| ~ spl0_5
| ~ spl0_39 ),
inference(resolution,[],[f6035,f269]) ).
fof(f7182,plain,
( ! [X0] :
( sk4 != cons(X0,tl(sk4))
| ~ ssList(tl(sk4))
| sk3 = app(tl(sk4),cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl0_5
| ~ spl0_39 ),
inference(superposition,[],[f209,f6073]) ).
fof(f7189,plain,
( ! [X0] :
( sk4 != cons(X0,tl(sk4))
| sk3 = app(tl(sk4),cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl0_5
| ~ spl0_39 ),
inference(forward_subsumption_resolution,[],[f7182,f269]) ).
fof(f7194,plain,
( ! [X0] :
( sk4 != cons(X0,tl(sk4))
| sk3 = app(tl(sk4),cons(X0,nil)) )
| ~ spl0_5
| ~ spl0_39 ),
inference(forward_subsumption_resolution,[],[f7189,f405]) ).
fof(f8242,plain,
( sk4 != sk4
| sk3 = app(tl(sk4),cons(hd(sk4),nil))
| ~ spl0_5
| spl0_10
| ~ spl0_39 ),
inference(superposition,[],[f7194,f3016]) ).
fof(f8243,plain,
( sk3 = app(tl(sk4),cons(hd(sk4),nil))
| ~ spl0_5
| spl0_10
| ~ spl0_39 ),
inference(trivial_inequality_removal,[],[f8242]) ).
fof(f8244,plain,
( $false
| spl0_3
| ~ spl0_5
| spl0_10
| ~ spl0_39 ),
inference(forward_subsumption_resolution,[],[f8243,f262]) ).
fof(f8245,plain,
( spl0_3
| ~ spl0_5
| spl0_10
| ~ spl0_39 ),
inference(avatar_contradiction_clause,[],[f8244]) ).
fof(f8246,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk4))
| spl0_4 ),
inference(resolution,[],[f266,f86]) ).
fof(f8247,plain,
( ~ ssItem(hd(sk4))
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f8246,f8]) ).
fof(f8248,plain,
( $false
| spl0_4
| ~ spl0_39 ),
inference(forward_subsumption_resolution,[],[f8247,f405]) ).
fof(f8249,plain,
( spl0_4
| ~ spl0_39 ),
inference(avatar_contradiction_clause,[],[f8248]) ).
cnf(s198,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f271]) ).
cnf(s212,plain,
~ spl0_9,
inference(sat_conversion,[],[f285]) ).
cnf(s229,plain,
~ spl0_7,
inference(sat_conversion,[],[f296]) ).
cnf(s381,plain,
( spl0_39
| spl0_41 ),
inference(sat_conversion,[],[f412]) ).
cnf(s946,plain,
( spl0_9
| spl0_7
| spl0_9
| ~ spl0_59 ),
inference(sat_conversion,[],[f1281]) ).
cnf(s947,plain,
( spl0_7
| spl0_9
| ~ spl0_59 ),
inference(rat,[],[s946]) ).
cnf(s1037,plain,
( spl0_9
| ~ spl0_41
| spl0_59 ),
inference(sat_conversion,[],[f1386]) ).
cnf(s1227,plain,
( spl0_1
| spl0_10 ),
inference(sat_conversion,[],[f1638]) ).
cnf(s1233,plain,
( spl0_5
| spl0_10 ),
inference(sat_conversion,[],[f1642]) ).
cnf(s1236,plain,
( spl0_2
| ~ spl0_39 ),
inference(sat_conversion,[],[f1646]) ).
cnf(s1810,plain,
( ~ spl0_8
| ~ spl0_10 ),
inference(sat_conversion,[],[f3001]) ).
cnf(s1820,plain,
( spl0_8
| ~ spl0_39 ),
inference(sat_conversion,[],[f3007]) ).
cnf(s4106,plain,
( spl0_3
| ~ spl0_5
| spl0_10
| ~ spl0_39 ),
inference(sat_conversion,[],[f8245]) ).
cnf(s4113,plain,
( spl0_4
| ~ spl0_39 ),
inference(sat_conversion,[],[f8249]) ).
cnf(s4117,plain,
~ spl0_59,
inference(rat,[],[s947,s229,s212]) ).
cnf(s4122,plain,
~ spl0_41,
inference(rat,[],[s1037,s212,s4117]) ).
cnf(s4124,plain,
spl0_39,
inference(rat,[],[s381,s4122]) ).
cnf(s4125,plain,
spl0_4,
inference(rat,[],[s4113,s4124]) ).
cnf(s4131,plain,
spl0_8,
inference(rat,[],[s1820,s4124]) ).
cnf(s4135,plain,
spl0_2,
inference(rat,[],[s1236,s4124]) ).
cnf(s4138,plain,
~ spl0_10,
inference(rat,[],[s1810,s4131]) ).
cnf(s4144,plain,
spl0_5,
inference(rat,[],[s1233,s4138]) ).
cnf(s4145,plain,
spl0_1,
inference(rat,[],[s1227,s4138]) ).
cnf(s4147,plain,
spl0_3,
inference(rat,[],[s4106,s4124,s4138,s4144]) ).
cnf(s4148,plain,
$false,
inference(rat,[],[s198,s4144,s4125,s4147,s4135,s4145]) ).
fof(f8250,plain,
$false,
inference(avatar_sat_refutation,[],[s4148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC308-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.19 % Computer : n005.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 09:00:02 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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
% 1.75/0.51 % (652527)Will run a generic schedule for satisfiability detection.
% 1.75/0.51 % (652535)dis+10_1_sil=32000:sp=arity:random_seed=3514469091:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.75/0.51 % (652533)% WARNING: option uhcvi not known.
% 1.75/0.51 % (652534)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2202540139:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.75/0.51 % (652532)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3102121276_2999 on theBenchmark for (2999ds/0Mi)
% 1.75/0.51 % (652533)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1752206183:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.75/0.51 % (652536)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=717622617:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.75/0.51 % (652538)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3990484964:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.75/0.51 % (652537)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=284288274:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.75/0.51 % TRYING [1]
% 1.75/0.51 % TRYING [2]
% 1.75/0.51 % TRYING [3]
% 1.75/0.51 % (652535)Instruction limit reached!
% 1.75/0.51 % (652535)------------------------------
% 1.75/0.51 % (652535)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.75/0.51 % (652535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/0.51 % (652535)CaDiCaL version: 2.1.3
% 1.75/0.51 % (652535)Termination reason: Instruction limit
% 1.75/0.51 % (652535)Termination phase: Saturation
% 1.75/0.51 % (652535)Time elapsed: 0.033 s
% 1.75/0.51 % (652535)Peak memory usage: 13 MB
% 1.75/0.51 % (652535)Instructions burned: 105 (million)
% 1.75/0.51 % (652546)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2232367530:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.75/0.51 % TRYING [4]
% 1.75/0.51 % TRYING [1]
% 1.75/0.51 % TRYING [2]
% 1.75/0.51 % TRYING [3]
% 1.75/0.51 % TRYING [4]
% 1.75/0.51 % (652536)Instruction limit reached!
% 1.75/0.51 % (652536)------------------------------
% 1.75/0.51 % (652536)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.75/0.51 % (652536)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/0.51 % (652536)CaDiCaL version: 2.1.3
% 1.75/0.51 % (652536)Termination reason: Instruction limit
% 1.75/0.51 % (652536)Termination phase: Saturation
% 1.75/0.51 % (652536)Time elapsed: 0.060 s
% 1.75/0.51 % (652536)Peak memory usage: 13 MB
% 1.75/0.51 % (652536)Instructions burned: 116 (million)
% 1.75/0.51 % (652537)Instruction limit reached!
% 1.75/0.51 % (652537)------------------------------
% 1.75/0.51 % (652537)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.75/0.51 % (652537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/0.51 % (652537)CaDiCaL version: 2.1.3
% 1.75/0.51 % (652537)Termination reason: Instruction limit
% 1.75/0.51 % (652537)Termination phase: Saturation
% 1.75/0.51 % (652537)Time elapsed: 0.066 s
% 1.75/0.51 % (652537)Peak memory usage: 13 MB
% 1.75/0.51 % (652537)Instructions burned: 137 (million)
% 1.75/0.51 % (652548)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3666213665:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.75/0.51 % (652549)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=2476044394:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.75/0.51 % TRYING [5]
% 1.75/0.51 % (652538)Instruction limit reached!
% 1.75/0.51 % (652538)------------------------------
% 1.75/0.51 % (652538)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.75/0.51 % (652538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/0.51 % (652538)CaDiCaL version: 2.1.3
% 1.75/0.51 % (652538)Termination reason: Instruction limit
% 1.75/0.51 % (652538)Termination phase: Saturation
% 1.75/0.51 % (652538)Time elapsed: 0.090 s
% 1.75/0.51 % (652538)Peak memory usage: 14 MB
% 1.75/0.51 % (652538)Instructions burned: 159 (million)
% 1.75/0.51 % TRYING [5]
% 1.75/0.51 % (652552)ott-21_1_sil=16000:fs=off:random_seed=1940152925:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.75/0.51 % (652548)Instruction limit reached!
% 1.75/0.51 % (652548)------------------------------
% 1.75/0.51 % (652548)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.75/0.51 % (652548)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/0.51 % (652548)CaDiCaL version: 2.1.3
% 1.75/0.51 % (652548)Termination reason: Instruction limit
% 1.75/0.51 % (652548)Termination phase: Saturation
% 1.75/0.51 % (652548)Time elapsed: 0.070 s
% 1.75/0.51 % (652548)Peak memory usage: 13 MB
% 1.75/0.51 % (652548)Instructions burned: 132 (million)
% 1.75/0.51 % (652554)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4220146339:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.75/0.51 % TRYING [6]
% 1.75/0.51 % (652546)Instruction limit reached!
% 1.75/0.51 % (652546)------------------------------
% 1.75/0.51 % (652546)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.75/0.51 % (652546)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/0.51 % (652546)CaDiCaL version: 2.1.3
% 1.75/0.51 % (652546)Termination reason: Instruction limit
% 1.75/0.51 % (652546)Termination phase: Finite model building constraint generation
% 1.75/0.51 % (652546)Time elapsed: 0.154 s
% 1.75/0.51 % (652546)Peak memory usage: 36 MB
% 1.75/0.51 % (652546)Instructions burned: 745 (million)
% 1.75/0.51 % (652552)Instruction limit reached!
% 1.75/0.51 % (652552)------------------------------
% 1.75/0.51 % (652552)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.75/0.51 % (652552)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/0.51 % (652552)CaDiCaL version: 2.1.3
% 1.75/0.51 % (652552)Termination reason: Instruction limit
% 1.75/0.51 % (652552)Termination phase: Saturation
% 1.75/0.51 % (652552)Time elapsed: 0.090 s
% 1.75/0.51 % (652552)Peak memory usage: 13 MB
% 1.75/0.51 % (652552)Instructions burned: 180 (million)
% 1.75/0.51 % (652556)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2229552532:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.75/0.51 % TRYING [1]
% 1.75/0.51 % TRYING [2]
% 1.75/0.51 % TRYING [3]
% 1.75/0.51 % (652557)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3754964595:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.75/0.51 % TRYING [4]
% 1.75/0.51 % (652534) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-652527-652534"...
% 1.75/0.51 % (652534)...printing done.
% 1.75/0.51 % (652534)Refutation found. Thanks to Tanya!
% 1.75/0.51 % SZS status Unsatisfiable for theBenchmark
% 1.75/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 1.75/0.51 % (652534)------------------------------
% 1.75/0.51 % (652534)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.75/0.51 % (652534)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/0.51 % (652534)CaDiCaL version: 2.1.3
% 1.75/0.51 % (652534)Termination reason: Refutation
% 1.75/0.51 % (652534)Time elapsed: 0.240 s
% 1.75/0.51 % (652534)Peak memory usage: 17 MB
% 1.75/0.51 % (652534)Instructions burned: 375 (million)
% 1.75/0.51 % (652527)Success in time 0.28 s
% 1.75/0.51 % Vampire exiting
%------------------------------------------------------------------------------