%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC421-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 : n001.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:59 PM UTC 2026
% Result : Unsatisfiable 4.52s 0.98s
% Output : Refutation 4.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 34
% Syntax : Number of formulae : 146 ( 27 unt; 13 def)
% Number of atoms : 455 ( 65 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 617 ( 308 ~; 296 |; 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/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(f73,axiom,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
fof(f74,axiom,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
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(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,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/sandbox/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,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f211,negated_conjecture,
! [X2,X3,X0,X1] :
( ~ neq(sk4,nil)
| ~ ssList(X0)
| sk4 = X0
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk3) != X1
| app(X1,X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk3) != X3
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f214,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f215,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(f224,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f120]) ).
fof(f233,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(f240,plain,
! [X2,X3,X0] :
( ~ neq(sk4,nil)
| ~ ssList(X0)
| sk4 = X0
| ~ ssList(tl(sk3))
| ~ ssList(X2)
| app(tl(sk3),X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk3) != X3
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(equality_resolution,[],[f211]) ).
fof(f241,plain,
! [X2,X3] :
( ~ neq(sk4,nil)
| ~ ssList(app(tl(sk3),X2))
| sk4 = app(tl(sk3),X2)
| ~ ssList(tl(sk3))
| ~ ssList(X2)
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk3) != X3
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(equality_resolution,[],[f240]) ).
fof(f242,plain,
! [X3] :
( ~ neq(sk4,nil)
| ~ ssList(app(tl(sk3),cons(X3,nil)))
| sk4 = app(tl(sk3),cons(X3,nil))
| ~ ssList(tl(sk3))
| ~ ssList(cons(X3,nil))
| ~ ssItem(X3)
| hd(sk3) != X3
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(equality_resolution,[],[f241]) ).
fof(f243,plain,
( ~ neq(sk4,nil)
| ~ ssList(app(tl(sk3),cons(hd(sk3),nil)))
| sk4 = app(tl(sk3),cons(hd(sk3),nil))
| ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(equality_resolution,[],[f242]) ).
fof(f244,plain,
( ~ neq(sk4,nil)
| ~ ssList(app(tl(sk3),cons(hd(sk3),nil)))
| sk4 = app(tl(sk3),cons(hd(sk3),nil))
| ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| ~ neq(nil,sk3) ),
inference(duplicate_literal_removal,[],[f243]) ).
fof(f248,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f224]) ).
fof(f252,definition,
( spl0_1
<=> ! [X0] : ~ ssItem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f253,plain,
( ! [X0] : ~ ssItem(X0)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f255,definition,
( spl0_2
<=> ! [X1] : ~ ssList(X1) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f256,plain,
( ! [X1] : ~ ssList(X1)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f263,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f202,f256]) ).
fof(f264,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f263]) ).
fof(f266,definition,
( spl0_5
<=> ! [X1] : ~ neq(X1,X1) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f267,plain,
( ! [X1] : ~ neq(X1,X1)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f273,definition,
( spl0_7
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f274,plain,
( nil != sk3
| spl0_7 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f275,plain,
( nil = sk3
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f277,plain,
neq(sk3,nil),
inference(forward_subsumption_resolution,[],[f210,f214]) ).
fof(f278,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f9,f253]) ).
fof(f279,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f278]) ).
fof(f280,plain,
( ~ ssList(app(tl(sk3),cons(hd(sk3),nil)))
| sk4 = app(tl(sk3),cons(hd(sk3),nil))
| ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| ~ neq(nil,sk3) ),
inference(forward_subsumption_resolution,[],[f244,f214]) ).
fof(f315,definition,
( spl0_19
<=> neq(nil,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f317,plain,
( ~ neq(nil,sk3)
| spl0_19 ),
inference(avatar_component_clause,[],[f315]) ).
fof(f319,definition,
( spl0_20
<=> ssItem(hd(sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f321,plain,
( ~ ssItem(hd(sk3))
| spl0_20 ),
inference(avatar_component_clause,[],[f319]) ).
fof(f323,definition,
( spl0_21
<=> ssList(cons(hd(sk3),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_21])],[avatar_definition]) ).
fof(f324,plain,
( ssList(cons(hd(sk3),nil))
| ~ spl0_21 ),
inference(avatar_component_clause,[],[f323]) ).
fof(f325,plain,
( ~ ssList(cons(hd(sk3),nil))
| spl0_21 ),
inference(avatar_component_clause,[],[f323]) ).
fof(f327,definition,
( spl0_22
<=> ssList(tl(sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
fof(f328,plain,
( ssList(tl(sk3))
| ~ spl0_22 ),
inference(avatar_component_clause,[],[f327]) ).
fof(f329,plain,
( ~ ssList(tl(sk3))
| spl0_22 ),
inference(avatar_component_clause,[],[f327]) ).
fof(f331,definition,
( spl0_23
<=> sk4 = app(tl(sk3),cons(hd(sk3),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f333,plain,
( sk4 = app(tl(sk3),cons(hd(sk3),nil))
| ~ spl0_23 ),
inference(avatar_component_clause,[],[f331]) ).
fof(f335,definition,
( spl0_24
<=> ssList(app(tl(sk3),cons(hd(sk3),nil))) ),
introduced(definition,[new_symbols(definition,[spl0_24])],[avatar_definition]) ).
fof(f337,plain,
( ~ ssList(app(tl(sk3),cons(hd(sk3),nil)))
| spl0_24 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f338,plain,
( ~ spl0_19
| ~ spl0_20
| ~ spl0_21
| ~ spl0_22
| spl0_23
| ~ spl0_24 ),
inference(avatar_split_clause,[],[f280,f335,f331,f327,f323,f319,f315]) ).
fof(f387,definition,
( spl0_40
<=> ! [X1] : ssItem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_40])],[avatar_definition]) ).
fof(f388,plain,
( ! [X1] : ssItem(X1)
| ~ spl0_40 ),
inference(avatar_component_clause,[],[f387]) ).
fof(f393,definition,
( spl0_42
<=> ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_42])],[avatar_definition]) ).
fof(f394,plain,
( ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) )
| ~ spl0_42 ),
inference(avatar_component_clause,[],[f393]) ).
fof(f395,plain,
( spl0_40
| spl0_42 ),
inference(avatar_split_clause,[],[f72,f393,f387]) ).
fof(f430,plain,
sk4 = app(sk4,nil),
inference(resolution,[],[f73,f203]) ).
fof(f952,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,f233]) ).
fof(f1312,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,[],[f952,f86]) ).
fof(f1339,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(f1340,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) )
| ~ spl0_59 ),
inference(avatar_component_clause,[],[f1339]) ).
fof(f1342,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(cons(X0,X2)) )
| ~ spl0_59 ),
inference(resolution,[],[f1340,f85]) ).
fof(f1343,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(cons(X0,X2)) )
| ~ spl0_59 ),
inference(duplicate_literal_removal,[],[f1342]) ).
fof(f1344,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2) )
| ~ spl0_59 ),
inference(forward_subsumption_resolution,[],[f1343,f86]) ).
fof(f1345,plain,
( spl0_2
| spl0_2
| spl0_1
| ~ spl0_59 ),
inference(avatar_split_clause,[],[f1344,f1339,f252,f255,f255]) ).
fof(f1375,plain,
( ! [X0,X1] :
( duplicatefreeP(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl0_42 ),
inference(resolution,[],[f394,f85]) ).
fof(f1384,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,[],[f1375,f1312]) ).
fof(f1435,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,[],[f1384]) ).
fof(f1436,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,[],[f1435,f86]) ).
fof(f1450,plain,
( spl0_2
| spl0_59
| ~ spl0_42 ),
inference(avatar_split_clause,[],[f1436,f393,f1339,f255]) ).
fof(f1702,plain,
( ~ ssList(nil)
| ~ ssList(sk3)
| nil = sk3
| spl0_19 ),
inference(resolution,[],[f102,f317]) ).
fof(f1705,plain,
( ~ ssList(sk3)
| nil = sk3
| spl0_19 ),
inference(forward_subsumption_resolution,[],[f1702,f8]) ).
fof(f1706,plain,
( nil = sk3
| spl0_19 ),
inference(forward_subsumption_resolution,[],[f1705,f202]) ).
fof(f1707,plain,
( spl0_7
| spl0_19 ),
inference(avatar_split_clause,[],[f1706,f315,f273]) ).
fof(f1709,plain,
( neq(nil,nil)
| ~ spl0_7 ),
inference(superposition,[],[f277,f275]) ).
fof(f1715,plain,
( $false
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f1709,f267]) ).
fof(f1716,plain,
( ~ spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f1715]) ).
fof(f1717,plain,
( ! [X1] : ~ neq(X1,X1)
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f248,f388]) ).
fof(f1742,plain,
( ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| spl0_24 ),
inference(resolution,[],[f337,f85]) ).
fof(f1743,plain,
( ~ spl0_21
| ~ spl0_22
| spl0_24 ),
inference(avatar_split_clause,[],[f1742,f335,f327,f323]) ).
fof(f1744,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk3))
| spl0_21 ),
inference(resolution,[],[f325,f86]) ).
fof(f1745,plain,
( ~ ssItem(hd(sk3))
| spl0_21 ),
inference(forward_subsumption_resolution,[],[f1744,f8]) ).
fof(f1746,plain,
( $false
| spl0_21
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f1745,f388]) ).
fof(f1747,plain,
( spl0_21
| ~ spl0_40 ),
inference(avatar_contradiction_clause,[],[f1746]) ).
fof(f1748,plain,
( ~ ssList(sk3)
| nil = sk3
| spl0_22 ),
inference(resolution,[],[f329,f75]) ).
fof(f1749,plain,
( nil = sk3
| spl0_22 ),
inference(forward_subsumption_resolution,[],[f1748,f202]) ).
fof(f1750,plain,
( $false
| spl0_7
| spl0_22 ),
inference(forward_subsumption_resolution,[],[f1749,f274]) ).
fof(f1751,plain,
( spl0_7
| spl0_22 ),
inference(avatar_contradiction_clause,[],[f1750]) ).
fof(f1752,plain,
( $false
| spl0_20
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f321,f388]) ).
fof(f1753,plain,
( spl0_20
| ~ spl0_40 ),
inference(avatar_contradiction_clause,[],[f1752]) ).
fof(f1756,plain,
( spl0_5
| ~ spl0_40 ),
inference(avatar_split_clause,[],[f1717,f387,f266]) ).
fof(f1766,plain,
( cons(hd(sk3),nil) = app(nil,cons(hd(sk3),nil))
| ~ spl0_21 ),
inference(resolution,[],[f324,f74]) ).
fof(f1780,plain,
( ! [X0] :
( sk4 != app(sk4,X0)
| ~ ssList(tl(sk3))
| ~ ssList(X0)
| ~ ssItem(hd(sk3))
| sk3 != app(app(X0,cons(hd(sk3),nil)),tl(sk3)) )
| ~ spl0_23 ),
inference(superposition,[],[f215,f333]) ).
fof(f3441,plain,
( sk3 = cons(hd(sk3),tl(sk3))
| nil = sk3 ),
inference(resolution,[],[f107,f202]) ).
fof(f3444,plain,
( sk3 = cons(hd(sk3),tl(sk3))
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f3441,f274]) ).
fof(f3705,plain,
( ! [X0] :
( sk4 != app(sk4,X0)
| ~ ssList(X0)
| ~ ssItem(hd(sk3))
| sk3 != app(app(X0,cons(hd(sk3),nil)),tl(sk3)) )
| ~ spl0_22
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[],[f1780,f328]) ).
fof(f3710,plain,
( ! [X0] :
( sk3 != app(app(X0,cons(hd(sk3),nil)),tl(sk3))
| ~ ssList(X0)
| sk4 != app(sk4,X0) )
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f3705,f388]) ).
fof(f15239,plain,
( ! [X0,X1] :
( ~ ssList(X1)
| cons(X0,X1) = app(cons(X0,nil),X1) )
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f126,f388]) ).
fof(f15526,plain,
( ! [X0] : cons(X0,tl(sk3)) = app(cons(X0,nil),tl(sk3))
| ~ spl0_22
| ~ spl0_40 ),
inference(resolution,[],[f15239,f328]) ).
fof(f23077,plain,
( sk3 != app(cons(hd(sk3),nil),tl(sk3))
| ~ ssList(nil)
| sk4 != app(sk4,nil)
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(superposition,[],[f3710,f1766]) ).
fof(f23122,plain,
( sk3 != app(cons(hd(sk3),nil),tl(sk3))
| sk4 != app(sk4,nil)
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f23077,f8]) ).
fof(f23130,plain,
( sk3 != app(cons(hd(sk3),nil),tl(sk3))
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f23122,f430]) ).
fof(f23135,plain,
( sk3 != cons(hd(sk3),tl(sk3))
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(forward_demodulation,[],[f23130,f15526]) ).
fof(f23137,plain,
( $false
| spl0_7
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(forward_subsumption_resolution,[],[f23135,f3444]) ).
fof(f23138,plain,
( spl0_7
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(avatar_contradiction_clause,[],[f23137]) ).
cnf(s206,plain,
~ spl0_2,
inference(sat_conversion,[],[f264]) ).
cnf(s229,plain,
~ spl0_1,
inference(sat_conversion,[],[f279]) ).
cnf(s273,plain,
( ~ spl0_19
| ~ spl0_20
| ~ spl0_21
| ~ spl0_22
| spl0_23
| ~ spl0_24 ),
inference(sat_conversion,[],[f338]) ).
cnf(s369,plain,
( spl0_40
| spl0_42 ),
inference(sat_conversion,[],[f395]) ).
cnf(s955,plain,
( spl0_2
| spl0_1
| spl0_2
| ~ spl0_59 ),
inference(sat_conversion,[],[f1345]) ).
cnf(s956,plain,
( spl0_1
| spl0_2
| ~ spl0_59 ),
inference(rat,[],[s955]) ).
cnf(s1046,plain,
( spl0_2
| ~ spl0_42
| spl0_59 ),
inference(sat_conversion,[],[f1450]) ).
cnf(s1249,plain,
( spl0_7
| spl0_19 ),
inference(sat_conversion,[],[f1707]) ).
cnf(s1252,plain,
( ~ spl0_5
| ~ spl0_7 ),
inference(sat_conversion,[],[f1716]) ).
cnf(s1280,plain,
( ~ spl0_21
| ~ spl0_22
| spl0_24 ),
inference(sat_conversion,[],[f1743]) ).
cnf(s1283,plain,
( spl0_21
| ~ spl0_40 ),
inference(sat_conversion,[],[f1747]) ).
cnf(s1287,plain,
( spl0_7
| spl0_22 ),
inference(sat_conversion,[],[f1751]) ).
cnf(s1288,plain,
( spl0_20
| ~ spl0_40 ),
inference(sat_conversion,[],[f1753]) ).
cnf(s1294,plain,
( spl0_5
| ~ spl0_40 ),
inference(sat_conversion,[],[f1756]) ).
cnf(s11785,plain,
( spl0_7
| ~ spl0_21
| ~ spl0_22
| ~ spl0_23
| ~ spl0_40 ),
inference(sat_conversion,[],[f23138]) ).
cnf(s11789,plain,
~ spl0_59,
inference(rat,[],[s956,s229,s206]) ).
cnf(s11794,plain,
~ spl0_42,
inference(rat,[],[s1046,s206,s11789]) ).
cnf(s11796,plain,
spl0_40,
inference(rat,[],[s369,s11794]) ).
cnf(s11825,plain,
spl0_5,
inference(rat,[],[s1294,s11796]) ).
cnf(s11826,plain,
spl0_20,
inference(rat,[],[s1288,s11796]) ).
cnf(s11827,plain,
spl0_21,
inference(rat,[],[s1283,s11796]) ).
cnf(s11832,plain,
~ spl0_7,
inference(rat,[],[s1252,s11825]) ).
cnf(s11845,plain,
spl0_22,
inference(rat,[],[s1287,s11832]) ).
cnf(s11846,plain,
spl0_19,
inference(rat,[],[s1249,s11832]) ).
cnf(s11854,plain,
spl0_24,
inference(rat,[],[s1280,s11827,s11845]) ).
cnf(s11855,plain,
~ spl0_23,
inference(rat,[],[s11785,s11796,s11832,s11827,s11845]) ).
cnf(s11856,plain,
$false,
inference(rat,[],[s273,s11854,s11845,s11826,s11827,s11855,s11846]) ).
fof(f23139,plain,
$false,
inference(avatar_sat_refutation,[],[s11856]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC421-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.10/0.17 % Computer : n001.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 09:42:03 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 Running first-order model finding
% 0.10/0.20 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
% 4.52/0.98 % (246735)Will run a generic schedule for satisfiability detection.
% 4.52/0.98 % (246743)dis+10_1_sil=32000:sp=arity:random_seed=1945089648:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.52/0.98 % (246741)% WARNING: option uhcvi not known.
% 4.52/0.98 % (246740)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=852304130_2999 on theBenchmark for (2999ds/0Mi)
% 4.52/0.98 % (246742)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4082285645:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.52/0.98 % (246744)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3078481471:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.52/0.98 % (246745)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2150812559:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.52/0.98 % (246746)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3940508923:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.52/0.98 % (246741)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2882257731:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.52/0.98 % TRYING [1]
% 4.52/0.98 % TRYING [2]
% 4.52/0.98 % TRYING [3]
% 4.52/0.98 % (246743)Instruction limit reached!
% 4.52/0.98 % (246743)------------------------------
% 4.52/0.98 % (246743)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246743)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246743)Termination reason: Instruction limit
% 4.52/0.98 % (246743)Termination phase: Saturation
% 4.52/0.98 % (246743)Time elapsed: 0.032 s
% 4.52/0.98 % (246743)Peak memory usage: 13 MB
% 4.52/0.98 % (246743)Instructions burned: 105 (million)
% 4.52/0.98 % (246754)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=383652855:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.52/0.98 % TRYING [4]
% 4.52/0.98 % TRYING [1]
% 4.52/0.98 % TRYING [2]
% 4.52/0.98 % TRYING [3]
% 4.52/0.98 % TRYING [4]
% 4.52/0.98 % (246744)Instruction limit reached!
% 4.52/0.98 % (246744)------------------------------
% 4.52/0.98 % (246744)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246744)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246744)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246744)Termination reason: Instruction limit
% 4.52/0.98 % (246744)Termination phase: Saturation
% 4.52/0.98 % (246744)Time elapsed: 0.062 s
% 4.52/0.98 % (246744)Peak memory usage: 13 MB
% 4.52/0.98 % (246744)Instructions burned: 116 (million)
% 4.52/0.98 % (246745)Instruction limit reached!
% 4.52/0.98 % (246745)------------------------------
% 4.52/0.98 % (246745)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246745)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246745)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246745)Termination reason: Instruction limit
% 4.52/0.98 % (246745)Termination phase: Saturation
% 4.52/0.98 % (246745)Time elapsed: 0.065 s
% 4.52/0.98 % (246745)Peak memory usage: 13 MB
% 4.52/0.98 % (246745)Instructions burned: 132 (million)
% 4.52/0.98 % (246756)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2678864957:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.52/0.98 % (246757)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=1856293215:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 4.52/0.98 % (246746)Instruction limit reached!
% 4.52/0.98 % (246746)------------------------------
% 4.52/0.98 % (246746)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246746)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246746)Termination reason: Instruction limit
% 4.52/0.98 % (246746)Termination phase: Saturation
% 4.52/0.98 % (246746)Time elapsed: 0.090 s
% 4.52/0.98 % (246746)Peak memory usage: 13 MB
% 4.52/0.98 % (246746)Instructions burned: 159 (million)
% 4.52/0.98 % TRYING [5]
% 4.52/0.98 % TRYING [5]
% 4.52/0.98 % (246760)ott-21_1_sil=16000:fs=off:random_seed=3471788551:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.52/0.98 % (246756)Instruction limit reached!
% 4.52/0.98 % (246756)------------------------------
% 4.52/0.98 % (246756)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246756)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246756)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246756)Termination reason: Instruction limit
% 4.52/0.98 % (246756)Termination phase: Saturation
% 4.52/0.98 % (246756)Time elapsed: 0.069 s
% 4.52/0.98 % (246756)Peak memory usage: 13 MB
% 4.52/0.98 % (246756)Instructions burned: 133 (million)
% 4.52/0.98 % (246762)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4216755360:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 4.52/0.98 % (246754)Instruction limit reached!
% 4.52/0.98 % (246754)------------------------------
% 4.52/0.98 % (246754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246754)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246754)Termination reason: Instruction limit
% 4.52/0.98 % (246754)Termination phase: Finite model building constraint generation
% 4.52/0.98 % (246754)Time elapsed: 0.155 s
% 4.52/0.98 % (246754)Peak memory usage: 37 MB
% 4.52/0.98 % (246754)Instructions burned: 716 (million)
% 4.52/0.98 % (246764)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1244568938:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 4.52/0.98 % TRYING [1]
% 4.52/0.98 % TRYING [2]
% 4.52/0.98 % (246760)Instruction limit reached!
% 4.52/0.98 % (246760)------------------------------
% 4.52/0.98 % (246760)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246760)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246760)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246760)Termination reason: Instruction limit
% 4.52/0.98 % (246760)Termination phase: Saturation
% 4.52/0.98 % (246760)Time elapsed: 0.098 s
% 4.52/0.98 % (246760)Peak memory usage: 13 MB
% 4.52/0.98 % (246760)Instructions burned: 188 (million)
% 4.52/0.98 % TRYING [3]
% 4.52/0.98 % (246766)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1371093243:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 4.52/0.98 % TRYING [4]
% 4.52/0.98 % TRYING [6]
% 4.52/0.98 % TRYING [5]
% 4.52/0.98 % (246764)Instruction limit reached!
% 4.52/0.98 % (246764)------------------------------
% 4.52/0.98 % (246764)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246764)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246764)Termination reason: Instruction limit
% 4.52/0.98 % (246764)Termination phase: Finite model building SAT solving
% 4.52/0.98 % (246764)Time elapsed: 0.178 s
% 4.52/0.98 % (246764)Peak memory usage: 23 MB
% 4.52/0.98 % (246764)Instructions burned: 869 (million)
% 4.52/0.98 % (246768)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=34425487:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 4.52/0.98 % TRYING [14]
% 4.52/0.98 % (246762)Instruction limit reached!
% 4.52/0.98 % (246762)------------------------------
% 4.52/0.98 % (246762)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246762)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246762)Termination reason: Instruction limit
% 4.52/0.98 % (246762)Termination phase: Saturation
% 4.52/0.98 % (246762)Time elapsed: 0.302 s
% 4.52/0.98 % (246762)Peak memory usage: 15 MB
% 4.52/0.98 % (246762)Instructions burned: 478 (million)
% 4.52/0.98 % (246770)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=723586326: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)
% 4.52/0.98 % (246757)Instruction limit reached!
% 4.52/0.98 % (246757)------------------------------
% 4.52/0.98 % (246757)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246757)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246757)Termination reason: Instruction limit
% 4.52/0.98 % (246757)Termination phase: Saturation
% 4.52/0.98 % (246757)Time elapsed: 0.440 s
% 4.52/0.98 % (246757)Peak memory usage: 20 MB
% 4.52/0.98 % (246757)Instructions burned: 684 (million)
% 4.52/0.98 % (246772)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3493722962:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 4.52/0.98 % (246768)Instruction limit reached!
% 4.52/0.98 % (246768)------------------------------
% 4.52/0.98 % (246768)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246768)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246768)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246768)Termination reason: Instruction limit
% 4.52/0.98 % (246768)Termination phase: Finite model building constraint generation
% 4.52/0.98 % (246768)Time elapsed: 0.183 s
% 4.52/0.98 % (246768)Peak memory usage: 77 MB
% 4.52/0.98 % (246768)Instructions burned: 893 (million)
% 4.52/0.98 % (246774)fmb+10_1_sil=64000:random_seed=2051452864:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 4.52/0.98 % TRYING [1]
% 4.52/0.98 % TRYING [2]
% 4.52/0.98 % TRYING [3]
% 4.52/0.98 % TRYING [4]
% 4.52/0.98 % TRYING [5]
% 4.52/0.98 % (246742) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-246735-246742"...
% 4.52/0.98 % (246742)...printing done.
% 4.52/0.98 % (246742)Refutation found. Thanks to Tanya!
% 4.52/0.98 % SZS status Unsatisfiable for theBenchmark
% 4.52/0.98 % SZS output start Proof for theBenchmark
% See solution above
% 4.52/0.98 % (246742)------------------------------
% 4.52/0.98 % (246742)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.52/0.98 % (246742)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/0.98 % (246742)CaDiCaL version: 2.1.3
% 4.52/0.98 % (246742)Termination reason: Refutation
% 4.52/0.98 % (246742)Time elapsed: 0.727 s
% 4.52/0.98 % (246742)Peak memory usage: 24 MB
% 4.52/0.98 % (246742)Instructions burned: 1221 (million)
% 4.52/0.98 % (246735)Success in time 0.773 s
% 4.52/0.98 % Vampire exiting
%------------------------------------------------------------------------------