%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC418-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:58 PM UTC 2026
% Result : Unsatisfiable 1.83s 0.57s
% Output : Refutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 33
% Syntax : Number of formulae : 145 ( 26 unt; 13 def)
% Number of atoms : 451 ( 64 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 609 ( 303 ~; 293 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 14 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn 104 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f9,axiom,
ssItem(skac3),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause9) ).
fof(f72,axiom,
! [X0,X1] :
( ~ ssList(X0)
| duplicatefreeP(X0)
| ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
fof(f73,axiom,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
fof(f74,axiom,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f75,axiom,
! [X0] :
( ssList(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
fof(f120,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk2
| app(app(X2,cons(X0,nil)),X1) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk2 != app(app(X1,cons(X0,nil)),X2)
| sk1 != app(app(X2,cons(X0,nil)),X1) ),
inference(reorient_equations,[],[f207]) ).
fof(f210,negated_conjecture,
! [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)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f213,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f214,plain,
! [X2,X0,X1] :
( sk4 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| sk3 != app(app(X2,cons(X0,nil)),X1) ),
inference(definition_unfolding,[],[f208,f204,f205]) ).
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,X0] :
( ~ ssList(X0)
| sk3 = X0
| ~ ssList(tl(sk4))
| ~ ssList(X2)
| app(tl(sk4),X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f210]) ).
fof(f240,plain,
! [X2,X3] :
( ~ ssList(app(tl(sk4),X2))
| sk3 = app(tl(sk4),X2)
| ~ ssList(tl(sk4))
| ~ ssList(X2)
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f239]) ).
fof(f241,plain,
! [X3] :
( ~ ssList(app(tl(sk4),cons(X3,nil)))
| sk3 = app(tl(sk4),cons(X3,nil))
| ~ ssList(tl(sk4))
| ~ ssList(cons(X3,nil))
| ~ ssItem(X3)
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f240]) ).
fof(f242,plain,
( ~ ssList(app(tl(sk4),cons(hd(sk4),nil)))
| sk3 = app(tl(sk4),cons(hd(sk4),nil))
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f241]) ).
fof(f243,plain,
( ~ ssList(app(tl(sk4),cons(hd(sk4),nil)))
| sk3 = app(tl(sk4),cons(hd(sk4),nil))
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(duplicate_literal_removal,[],[f242]) ).
fof(f247,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f251,definition,
( spl0_1
<=> ! [X0] : ~ ssItem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f252,plain,
( ! [X0] : ~ ssItem(X0)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f254,definition,
( spl0_2
<=> ! [X1] : ~ ssList(X1) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f255,plain,
( ! [X1] : ~ ssList(X1)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f262,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f202,f255]) ).
fof(f263,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f262]) ).
fof(f265,definition,
( spl0_5
<=> ! [X1] : ~ neq(X1,X1) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f266,plain,
( ! [X1] : ~ neq(X1,X1)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f268,definition,
( spl0_6
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f269,plain,
( nil = sk4
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f270,plain,
( nil != sk4
| spl0_6 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f276,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f9,f252]) ).
fof(f277,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f276]) ).
fof(f278,plain,
( ~ ssList(app(tl(sk4),cons(hd(sk4),nil)))
| sk3 = app(tl(sk4),cons(hd(sk4),nil))
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4) ),
inference(forward_subsumption_resolution,[],[f243,f213]) ).
fof(f313,definition,
( spl0_19
<=> neq(nil,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f315,plain,
( ~ neq(nil,sk4)
| spl0_19 ),
inference(avatar_component_clause,[],[f313]) ).
fof(f317,definition,
( spl0_20
<=> ssItem(hd(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f319,plain,
( ~ ssItem(hd(sk4))
| spl0_20 ),
inference(avatar_component_clause,[],[f317]) ).
fof(f321,definition,
( spl0_21
<=> ssList(cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_21])],[avatar_definition]) ).
fof(f322,plain,
( ssList(cons(hd(sk4),nil))
| ~ spl0_21 ),
inference(avatar_component_clause,[],[f321]) ).
fof(f323,plain,
( ~ ssList(cons(hd(sk4),nil))
| spl0_21 ),
inference(avatar_component_clause,[],[f321]) ).
fof(f325,definition,
( spl0_22
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
fof(f326,plain,
( ssList(tl(sk4))
| ~ spl0_22 ),
inference(avatar_component_clause,[],[f325]) ).
fof(f327,plain,
( ~ ssList(tl(sk4))
| spl0_22 ),
inference(avatar_component_clause,[],[f325]) ).
fof(f329,definition,
( spl0_23
<=> sk3 = app(tl(sk4),cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f331,plain,
( sk3 = app(tl(sk4),cons(hd(sk4),nil))
| ~ spl0_23 ),
inference(avatar_component_clause,[],[f329]) ).
fof(f333,definition,
( spl0_24
<=> ssList(app(tl(sk4),cons(hd(sk4),nil))) ),
introduced(definition,[new_symbols(definition,[spl0_24])],[avatar_definition]) ).
fof(f335,plain,
( ~ ssList(app(tl(sk4),cons(hd(sk4),nil)))
| spl0_24 ),
inference(avatar_component_clause,[],[f333]) ).
fof(f336,plain,
( ~ spl0_19
| ~ spl0_20
| ~ spl0_21
| ~ spl0_22
| spl0_23
| ~ spl0_24 ),
inference(avatar_split_clause,[],[f278,f333,f329,f325,f321,f317,f313]) ).
fof(f385,definition,
( spl0_40
<=> ! [X1] : ssItem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_40])],[avatar_definition]) ).
fof(f386,plain,
( ! [X1] : ssItem(X1)
| ~ spl0_40 ),
inference(avatar_component_clause,[],[f385]) ).
fof(f391,definition,
( spl0_42
<=> ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_42])],[avatar_definition]) ).
fof(f392,plain,
( ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) )
| ~ spl0_42 ),
inference(avatar_component_clause,[],[f391]) ).
fof(f393,plain,
( spl0_40
| spl0_42 ),
inference(avatar_split_clause,[],[f72,f391,f385]) ).
fof(f427,plain,
sk3 = app(sk3,nil),
inference(resolution,[],[f73,f202]) ).
fof(f945,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(f1305,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,[],[f945,f86]) ).
fof(f1332,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(f1333,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) )
| ~ spl0_59 ),
inference(avatar_component_clause,[],[f1332]) ).
fof(f1335,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(cons(X0,X2)) )
| ~ spl0_59 ),
inference(resolution,[],[f1333,f85]) ).
fof(f1336,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(cons(X0,X2)) )
| ~ spl0_59 ),
inference(duplicate_literal_removal,[],[f1335]) ).
fof(f1337,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2) )
| ~ spl0_59 ),
inference(forward_subsumption_resolution,[],[f1336,f86]) ).
fof(f1338,plain,
( spl0_2
| spl0_2
| spl0_1
| ~ spl0_59 ),
inference(avatar_split_clause,[],[f1337,f1332,f251,f254,f254]) ).
fof(f1368,plain,
( ! [X0,X1] :
( duplicatefreeP(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl0_42 ),
inference(resolution,[],[f392,f85]) ).
fof(f1377,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_42 ),
inference(resolution,[],[f1368,f1305]) ).
fof(f1428,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(cons(X1,X3))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(X3) )
| ~ spl0_42 ),
inference(duplicate_literal_removal,[],[f1377]) ).
fof(f1429,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(X3) )
| ~ spl0_42 ),
inference(forward_subsumption_resolution,[],[f1428,f86]) ).
fof(f1443,plain,
( spl0_2
| spl0_59
| ~ spl0_42 ),
inference(avatar_split_clause,[],[f1429,f391,f1332,f254]) ).
fof(f1695,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| nil = sk4
| spl0_19 ),
inference(resolution,[],[f102,f315]) ).
fof(f1698,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_19 ),
inference(forward_subsumption_resolution,[],[f1695,f8]) ).
fof(f1699,plain,
( nil = sk4
| spl0_19 ),
inference(forward_subsumption_resolution,[],[f1698,f203]) ).
fof(f1700,plain,
( $false
| spl0_6
| spl0_19 ),
inference(forward_subsumption_resolution,[],[f1699,f270]) ).
fof(f1701,plain,
( spl0_6
| spl0_19 ),
inference(avatar_contradiction_clause,[],[f1700]) ).
fof(f1702,plain,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| spl0_24 ),
inference(resolution,[],[f335,f85]) ).
fof(f1703,plain,
( ~ spl0_21
| ~ spl0_22
| spl0_24 ),
inference(avatar_split_clause,[],[f1702,f333,f325,f321]) ).
fof(f1704,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk4))
| spl0_21 ),
inference(resolution,[],[f323,f86]) ).
fof(f1705,plain,
( ~ ssItem(hd(sk4))
| spl0_21 ),
inference(forward_subsumption_resolution,[],[f1704,f8]) ).
fof(f1708,plain,
( $false
| spl0_21
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f1705,f386]) ).
fof(f1709,plain,
( spl0_21
| ~ spl0_40 ),
inference(avatar_contradiction_clause,[],[f1708]) ).
fof(f1710,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_22 ),
inference(resolution,[],[f327,f75]) ).
fof(f1711,plain,
( nil = sk4
| spl0_22 ),
inference(forward_subsumption_resolution,[],[f1710,f203]) ).
fof(f1712,plain,
( $false
| spl0_6
| spl0_22 ),
inference(forward_subsumption_resolution,[],[f1711,f270]) ).
fof(f1713,plain,
( spl0_6
| spl0_22 ),
inference(avatar_contradiction_clause,[],[f1712]) ).
fof(f1715,plain,
( neq(nil,nil)
| ~ spl0_6 ),
inference(superposition,[],[f213,f269]) ).
fof(f1722,plain,
( $false
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f1715,f266]) ).
fof(f1723,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f1722]) ).
fof(f1724,plain,
( ! [X1] : ~ neq(X1,X1)
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f247,f386]) ).
fof(f1727,plain,
( spl0_5
| ~ spl0_40 ),
inference(avatar_split_clause,[],[f1724,f385,f265]) ).
fof(f1728,plain,
( $false
| spl0_20
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f319,f386]) ).
fof(f1729,plain,
( spl0_20
| ~ spl0_40 ),
inference(avatar_contradiction_clause,[],[f1728]) ).
fof(f1746,plain,
( cons(hd(sk4),nil) = app(nil,cons(hd(sk4),nil))
| ~ spl0_21 ),
inference(resolution,[],[f322,f74]) ).
fof(f3231,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| nil = sk4 ),
inference(resolution,[],[f107,f203]) ).
fof(f3232,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f3231,f270]) ).
fof(f9220,plain,
( ! [X0,X1] :
( ~ ssList(X1)
| cons(X0,X1) = app(cons(X0,nil),X1) )
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f126,f386]) ).
fof(f9262,plain,
( ! [X0] : cons(X0,tl(sk4)) = app(cons(X0,nil),tl(sk4))
| ~ spl0_22
| ~ spl0_40 ),
inference(resolution,[],[f9220,f326]) ).
fof(f9847,plain,
( ! [X0] :
( sk4 != app(cons(hd(sk4),nil),X0)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssItem(hd(sk4))
| sk3 != app(app(X0,cons(hd(sk4),nil)),nil) )
| ~ spl0_21 ),
inference(superposition,[],[f214,f1746]) ).
fof(f9873,plain,
( ! [X0] :
( sk4 != app(cons(hd(sk4),nil),X0)
| ~ ssList(X0)
| ~ ssItem(hd(sk4))
| sk3 != app(app(X0,cons(hd(sk4),nil)),nil) )
| ~ spl0_21 ),
inference(forward_subsumption_resolution,[],[f9847,f8]) ).
fof(f9877,plain,
( ! [X0] :
( sk3 != app(app(X0,cons(hd(sk4),nil)),nil)
| ~ ssList(X0)
| sk4 != app(cons(hd(sk4),nil),X0) )
| ~ spl0_21
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f9873,f386]) ).
fof(f9912,plain,
( sk3 != app(sk3,nil)
| ~ ssList(tl(sk4))
| sk4 != app(cons(hd(sk4),nil),tl(sk4))
| ~ spl0_21
| ~ spl0_23
| ~ spl0_40 ),
inference(superposition,[],[f9877,f331]) ).
fof(f9915,plain,
( ~ ssList(tl(sk4))
| sk4 != app(cons(hd(sk4),nil),tl(sk4))
| ~ spl0_21
| ~ spl0_23
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f9912,f427]) ).
fof(f9917,plain,
( sk4 != app(cons(hd(sk4),nil),tl(sk4))
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f9915,f326]) ).
fof(f9919,plain,
( sk4 != cons(hd(sk4),tl(sk4))
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(forward_demodulation,[],[f9917,f9262]) ).
fof(f9920,plain,
( $false
| spl0_6
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f9919,f3232]) ).
fof(f9921,plain,
( spl0_6
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(avatar_contradiction_clause,[],[f9920]) ).
cnf(s205,plain,
~ spl0_2,
inference(sat_conversion,[],[f263]) ).
cnf(s226,plain,
~ spl0_1,
inference(sat_conversion,[],[f277]) ).
cnf(s270,plain,
( ~ spl0_19
| ~ spl0_20
| ~ spl0_21
| ~ spl0_22
| spl0_23
| ~ spl0_24 ),
inference(sat_conversion,[],[f336]) ).
cnf(s366,plain,
( spl0_40
| spl0_42 ),
inference(sat_conversion,[],[f393]) ).
cnf(s951,plain,
( spl0_2
| spl0_1
| spl0_2
| ~ spl0_59 ),
inference(sat_conversion,[],[f1338]) ).
cnf(s952,plain,
( spl0_1
| spl0_2
| ~ spl0_59 ),
inference(rat,[],[s951]) ).
cnf(s1042,plain,
( spl0_2
| ~ spl0_42
| spl0_59 ),
inference(sat_conversion,[],[f1443]) ).
cnf(s1241,plain,
( spl0_6
| spl0_19 ),
inference(sat_conversion,[],[f1701]) ).
cnf(s1249,plain,
( ~ spl0_21
| ~ spl0_22
| spl0_24 ),
inference(sat_conversion,[],[f1703]) ).
cnf(s1253,plain,
( spl0_21
| ~ spl0_40 ),
inference(sat_conversion,[],[f1709]) ).
cnf(s1257,plain,
( spl0_6
| spl0_22 ),
inference(sat_conversion,[],[f1713]) ).
cnf(s1264,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f1723]) ).
cnf(s1270,plain,
( spl0_5
| ~ spl0_40 ),
inference(sat_conversion,[],[f1727]) ).
cnf(s1273,plain,
( spl0_20
| ~ spl0_40 ),
inference(sat_conversion,[],[f1729]) ).
cnf(s5489,plain,
( spl0_6
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(sat_conversion,[],[f9921]) ).
cnf(s5493,plain,
~ spl0_59,
inference(rat,[],[s952,s226,s205]) ).
cnf(s5498,plain,
~ spl0_42,
inference(rat,[],[s1042,s205,s5493]) ).
cnf(s5500,plain,
spl0_40,
inference(rat,[],[s366,s5498]) ).
cnf(s5508,plain,
spl0_20,
inference(rat,[],[s1273,s5500]) ).
cnf(s5509,plain,
spl0_5,
inference(rat,[],[s1270,s5500]) ).
cnf(s5510,plain,
spl0_21,
inference(rat,[],[s1253,s5500]) ).
cnf(s5514,plain,
~ spl0_6,
inference(rat,[],[s1264,s5509]) ).
cnf(s5518,plain,
spl0_22,
inference(rat,[],[s1257,s5514]) ).
cnf(s5519,plain,
spl0_19,
inference(rat,[],[s1241,s5514]) ).
cnf(s5522,plain,
spl0_24,
inference(rat,[],[s1249,s5510,s5518]) ).
cnf(s5523,plain,
~ spl0_23,
inference(rat,[],[s5489,s5500,s5514,s5510,s5518]) ).
cnf(s5524,plain,
$false,
inference(rat,[],[s270,s5522,s5518,s5508,s5510,s5523,s5519]) ).
fof(f9922,plain,
$false,
inference(avatar_sat_refutation,[],[s5524]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC418-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n016.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 09:38:18 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.83/0.57 % (3509995)Will run a generic schedule for satisfiability detection.
% 1.83/0.57 % (3510000)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4144850956_2999 on theBenchmark for (2999ds/0Mi)
% 1.83/0.57 % (3510001)% WARNING: option uhcvi not known.
% 1.83/0.57 % TRYING [1]
% 1.83/0.57 % TRYING [2]
% 1.83/0.57 % (3510001)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=403420931:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.83/0.57 % (3510002)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=706102542:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.83/0.57 % (3510003)dis+10_1_sil=32000:sp=arity:random_seed=3524655308:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.83/0.57 % (3510004)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2046768719:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.83/0.57 % (3510005)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4275964374:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.83/0.57 % (3510006)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3007569076:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.83/0.57 % TRYING [3]
% 1.83/0.57 % TRYING [4]
% 1.83/0.57 % TRYING [5]
% 1.83/0.57 % (3510003)Instruction limit reached!
% 1.83/0.57 % (3510003)------------------------------
% 1.83/0.57 % (3510003)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.57 % (3510003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.57 % (3510003)CaDiCaL version: 2.1.3
% 1.83/0.57 % (3510003)Termination reason: Instruction limit
% 1.83/0.57 % (3510003)Termination phase: Saturation
% 1.83/0.57 % (3510003)Time elapsed: 0.061 s
% 1.83/0.57 % (3510003)Peak memory usage: 13 MB
% 1.83/0.57 % (3510003)Instructions burned: 104 (million)
% 1.83/0.57 % (3510004)Instruction limit reached!
% 1.83/0.57 % (3510004)------------------------------
% 1.83/0.57 % (3510004)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.57 % (3510004)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.57 % (3510004)CaDiCaL version: 2.1.3
% 1.83/0.57 % (3510004)Termination reason: Instruction limit
% 1.83/0.57 % (3510004)Termination phase: Saturation
% 1.83/0.57 % (3510004)Time elapsed: 0.061 s
% 1.83/0.57 % (3510004)Peak memory usage: 13 MB
% 1.83/0.57 % (3510004)Instructions burned: 117 (million)
% 1.83/0.57 % (3510005)Instruction limit reached!
% 1.83/0.57 % (3510005)------------------------------
% 1.83/0.57 % (3510005)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.57 % (3510005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.57 % (3510005)CaDiCaL version: 2.1.3
% 1.83/0.57 % (3510005)Termination reason: Instruction limit
% 1.83/0.57 % (3510005)Termination phase: Saturation
% 1.83/0.57 % (3510005)Time elapsed: 0.069 s
% 1.83/0.57 % (3510005)Peak memory usage: 14 MB
% 1.83/0.57 % (3510005)Instructions burned: 132 (million)
% 1.83/0.57 % (3510015)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2620772679:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.83/0.57 % (3510014)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3346517935:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.83/0.57 % (3510016)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=1598634448:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.83/0.57 % TRYING [1]
% 1.83/0.57 % (3510006)Instruction limit reached!
% 1.83/0.57 % (3510006)------------------------------
% 1.83/0.57 % (3510006)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.57 % (3510006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.57 % (3510006)CaDiCaL version: 2.1.3
% 1.83/0.57 % (3510006)Termination reason: Instruction limit
% 1.83/0.57 % (3510006)Termination phase: Saturation
% 1.83/0.57 % (3510006)Time elapsed: 0.093 s
% 1.83/0.57 % (3510006)Peak memory usage: 14 MB
% 1.83/0.57 % (3510006)Instructions burned: 159 (million)
% 1.83/0.57 % TRYING [2]
% 1.83/0.57 % TRYING [3]
% 1.83/0.57 % (3510020)ott-21_1_sil=16000:fs=off:random_seed=399656972:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.83/0.57 % TRYING [4]
% 1.83/0.57 % TRYING [6]
% 1.83/0.57 % (3510015)Instruction limit reached!
% 1.83/0.57 % (3510015)------------------------------
% 1.83/0.57 % (3510015)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.57 % (3510015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.57 % (3510015)CaDiCaL version: 2.1.3
% 1.83/0.57 % (3510015)Termination reason: Instruction limit
% 1.83/0.57 % (3510015)Termination phase: Saturation
% 1.83/0.57 % (3510015)Time elapsed: 0.072 s
% 1.83/0.57 % (3510015)Peak memory usage: 13 MB
% 1.83/0.57 % (3510015)Instructions burned: 131 (million)
% 1.83/0.57 % (3510022)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3498273410:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.83/0.57 % TRYING [5]
% 1.83/0.57 % (3510020)Instruction limit reached!
% 1.83/0.57 % (3510020)------------------------------
% 1.83/0.57 % (3510020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.57 % (3510020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.57 % (3510020)CaDiCaL version: 2.1.3
% 1.83/0.57 % (3510020)Termination reason: Instruction limit
% 1.83/0.57 % (3510020)Termination phase: Saturation
% 1.83/0.57 % (3510020)Time elapsed: 0.092 s
% 1.83/0.57 % (3510020)Peak memory usage: 13 MB
% 1.83/0.57 % (3510020)Instructions burned: 182 (million)
% 1.83/0.57 % (3510024)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2705874180:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.83/0.57 % TRYING [1]
% 1.83/0.57 % TRYING [2]
% 1.83/0.57 % TRYING [3]
% 1.83/0.57 % TRYING [4]
% 1.83/0.57 % (3510002) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3509995-3510002"...
% 1.83/0.57 % (3510002)...printing done.
% 1.83/0.57 % (3510002)Refutation found. Thanks to Tanya!
% 1.83/0.57 % SZS status Unsatisfiable for theBenchmark
% 1.83/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.83/0.57 % (3510002)------------------------------
% 1.83/0.57 % (3510002)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.83/0.57 % (3510002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.83/0.57 % (3510002)CaDiCaL version: 2.1.3
% 1.83/0.57 % (3510002)Termination reason: Refutation
% 1.83/0.57 % (3510002)Time elapsed: 0.305 s
% 1.83/0.57 % (3510002)Peak memory usage: 19 MB
% 1.83/0.57 % (3510002)Instructions burned: 488 (million)
% 1.83/0.57 % (3509995)Success in time 0.351 s
% 1.83/0.57 % Vampire exiting
%------------------------------------------------------------------------------