%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC211-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 : n017.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:07 PM UTC 2026
% Result : Unsatisfiable 1.46s 0.76s
% Output : Refutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 31
% Syntax : Number of formulae : 137 ( 27 unt; 10 def)
% Number of atoms : 442 ( 56 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 595 ( 290 ~; 295 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 11 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 100 !; 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(f65,axiom,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause65) ).
fof(f72,axiom,
! [X0,X1] :
( ~ ssList(X0)
| duplicatefreeP(X0)
| ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
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(f121,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
fof(f122,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
inference(reorient_equations,[],[f121]) ).
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,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| app(X1,cons(X0,nil)) = sk3
| app(cons(X0,nil),X1) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
! [X0,X1] :
( app(cons(X0,nil),X1) != sk4
| ~ ssList(X1)
| sk3 = app(X1,cons(X0,nil))
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f207]) ).
fof(f209,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f213,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f214,plain,
~ neq(sk3,nil),
inference(definition_unfolding,[],[f209,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(f242,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f249,definition,
( spl0_2
<=> ! [X0] : ~ ssItem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f250,plain,
( ! [X0] : ~ ssItem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f252,definition,
( spl0_3
<=> ! [X1] : ~ neq(X1,X1) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f253,plain,
( ! [X1] : ~ neq(X1,X1)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f255,definition,
( spl0_4
<=> ! [X1] : ~ ssList(X1) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f256,plain,
( ! [X1] : ~ ssList(X1)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f257,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f202,f256]) ).
fof(f258,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f257]) ).
fof(f260,definition,
( spl0_5
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f261,plain,
( nil = sk4
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( nil != sk4
| spl0_5 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f264,definition,
( spl0_6
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f265,plain,
( nil != sk3
| spl0_6 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f266,plain,
( nil = sk3
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f268,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f9,f250]) ).
fof(f269,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f268]) ).
fof(f377,definition,
( spl0_34
<=> ! [X1] : ssItem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_34])],[avatar_definition]) ).
fof(f378,plain,
( ! [X1] : ssItem(X1)
| ~ spl0_34 ),
inference(avatar_component_clause,[],[f377]) ).
fof(f383,definition,
( spl0_36
<=> ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_36])],[avatar_definition]) ).
fof(f384,plain,
( ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) )
| ~ spl0_36 ),
inference(avatar_component_clause,[],[f383]) ).
fof(f385,plain,
( spl0_34
| spl0_36 ),
inference(avatar_split_clause,[],[f72,f383,f377]) ).
fof(f459,plain,
sk4 = app(nil,sk4),
inference(resolution,[],[f74,f203]) ).
fof(f1091,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(f1457,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,[],[f1091,f86]) ).
fof(f1488,definition,
( spl0_66
<=> ! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ) ),
introduced(definition,[new_symbols(definition,[spl0_66])],[avatar_definition]) ).
fof(f1489,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) )
| ~ spl0_66 ),
inference(avatar_component_clause,[],[f1488]) ).
fof(f1491,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(cons(X0,X2)) )
| ~ spl0_66 ),
inference(resolution,[],[f1489,f85]) ).
fof(f1492,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(cons(X0,X2)) )
| ~ spl0_66 ),
inference(duplicate_literal_removal,[],[f1491]) ).
fof(f1493,plain,
( ! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2) )
| ~ spl0_66 ),
inference(forward_subsumption_resolution,[],[f1492,f86]) ).
fof(f1494,plain,
( spl0_4
| spl0_4
| spl0_2
| ~ spl0_66 ),
inference(avatar_split_clause,[],[f1493,f1488,f249,f255,f255]) ).
fof(f1524,plain,
( ! [X0,X1] :
( duplicatefreeP(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl0_36 ),
inference(resolution,[],[f384,f85]) ).
fof(f1533,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_36 ),
inference(resolution,[],[f1524,f1457]) ).
fof(f1584,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(cons(X1,X3))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(X3) )
| ~ spl0_36 ),
inference(duplicate_literal_removal,[],[f1533]) ).
fof(f1585,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssList(X3) )
| ~ spl0_36 ),
inference(forward_subsumption_resolution,[],[f1584,f86]) ).
fof(f1599,plain,
( spl0_4
| spl0_66
| ~ spl0_36 ),
inference(avatar_split_clause,[],[f1585,f383,f1488,f255]) ).
fof(f3593,plain,
( neq(nil,nil)
| ~ spl0_5 ),
inference(superposition,[],[f213,f261]) ).
fof(f3595,plain,
( $false
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f3593,f253]) ).
fof(f3596,plain,
( ~ spl0_3
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f3595]) ).
fof(f3641,plain,
( ~ ssList(sk3)
| ~ ssList(nil)
| nil = sk3 ),
inference(resolution,[],[f102,f214]) ).
fof(f4596,definition,
( spl0_100
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_100])],[avatar_definition]) ).
fof(f4597,plain,
( ssList(tl(sk4))
| ~ spl0_100 ),
inference(avatar_component_clause,[],[f4596]) ).
fof(f4598,plain,
( ~ ssList(tl(sk4))
| spl0_100 ),
inference(avatar_component_clause,[],[f4596]) ).
fof(f4606,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_100 ),
inference(resolution,[],[f4598,f75]) ).
fof(f4607,plain,
( nil = sk4
| spl0_100 ),
inference(forward_subsumption_resolution,[],[f4606,f203]) ).
fof(f4608,plain,
( $false
| spl0_5
| spl0_100 ),
inference(forward_subsumption_resolution,[],[f4607,f262]) ).
fof(f4609,plain,
( spl0_5
| spl0_100 ),
inference(avatar_contradiction_clause,[],[f4608]) ).
fof(f4610,plain,
( ! [X1] : ~ neq(X1,X1)
| ~ spl0_34 ),
inference(forward_subsumption_resolution,[],[f242,f378]) ).
fof(f4617,plain,
( spl0_3
| ~ spl0_34 ),
inference(avatar_split_clause,[],[f4610,f377,f252]) ).
fof(f4901,plain,
( ~ ssList(nil)
| nil = sk3 ),
inference(forward_subsumption_resolution,[],[f3641,f202]) ).
fof(f4902,plain,
nil = sk3,
inference(forward_subsumption_resolution,[],[f4901,f8]) ).
fof(f4903,plain,
( $false
| spl0_6 ),
inference(global_subsumption,[],[f265,f4902]) ).
fof(f4904,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f4903]) ).
fof(f4952,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| nil = sk4 ),
inference(resolution,[],[f107,f203]) ).
fof(f4953,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f4952,f262]) ).
fof(f4968,plain,
( ! [X0,X1] :
( ~ duplicatefreeP(app(app(X0,cons(hd(sk4),X1)),sk4))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(hd(sk4))
| ~ ssList(app(X0,cons(hd(sk4),X1)))
| ~ ssList(tl(sk4)) )
| spl0_5 ),
inference(superposition,[],[f1457,f4953]) ).
fof(f4979,plain,
( ! [X0,X1] :
( ~ duplicatefreeP(app(app(X0,cons(hd(sk4),X1)),sk4))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,cons(hd(sk4),X1)))
| ~ ssList(tl(sk4)) )
| spl0_5
| ~ spl0_34 ),
inference(forward_subsumption_resolution,[],[f4968,f378]) ).
fof(f4986,plain,
( ! [X0,X1] :
( ~ duplicatefreeP(app(app(X0,cons(hd(sk4),X1)),sk4))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,cons(hd(sk4),X1))) )
| spl0_5
| ~ spl0_34
| ~ spl0_100 ),
inference(forward_subsumption_resolution,[],[f4979,f4597]) ).
fof(f5031,definition,
( spl0_107
<=> nil = tl(sk4) ),
introduced(definition,[new_symbols(definition,[spl0_107])],[avatar_definition]) ).
fof(f5032,plain,
( nil != tl(sk4)
| spl0_107 ),
inference(avatar_component_clause,[],[f5031]) ).
fof(f5033,plain,
( nil = tl(sk4)
| ~ spl0_107 ),
inference(avatar_component_clause,[],[f5031]) ).
fof(f6495,plain,
( sk4 = cons(hd(sk4),nil)
| spl0_5
| ~ spl0_107 ),
inference(superposition,[],[f4953,f5033]) ).
fof(f6570,plain,
( duplicatefreeP(sk4)
| ~ ssItem(hd(sk4))
| spl0_5
| ~ spl0_107 ),
inference(superposition,[],[f65,f6495]) ).
fof(f6644,plain,
( duplicatefreeP(sk4)
| spl0_5
| ~ spl0_34
| ~ spl0_107 ),
inference(forward_subsumption_resolution,[],[f6570,f378]) ).
fof(f7405,plain,
( ! [X0,X1] :
( ~ ssList(X1)
| cons(X0,X1) = app(cons(X0,nil),X1) )
| ~ spl0_34 ),
inference(forward_subsumption_resolution,[],[f126,f378]) ).
fof(f7441,plain,
( ! [X0] : cons(X0,tl(sk4)) = app(cons(X0,nil),tl(sk4))
| ~ spl0_34
| ~ spl0_100 ),
inference(resolution,[],[f7405,f4597]) ).
fof(f7758,plain,
( ! [X0] :
( sk4 != cons(X0,tl(sk4))
| ~ ssList(tl(sk4))
| sk3 = app(tl(sk4),cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl0_34
| ~ spl0_100 ),
inference(superposition,[],[f208,f7441]) ).
fof(f7765,plain,
( ! [X0] :
( sk4 != cons(X0,tl(sk4))
| sk3 = app(tl(sk4),cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl0_34
| ~ spl0_100 ),
inference(forward_subsumption_resolution,[],[f7758,f4597]) ).
fof(f7773,plain,
( ! [X0] :
( sk4 != cons(X0,tl(sk4))
| sk3 = app(tl(sk4),cons(X0,nil)) )
| ~ spl0_34
| ~ spl0_100 ),
inference(forward_subsumption_resolution,[],[f7765,f378]) ).
fof(f7774,plain,
( ! [X0] :
( sk4 != cons(X0,tl(sk4))
| nil = app(tl(sk4),cons(X0,nil)) )
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(forward_demodulation,[],[f7773,f266]) ).
fof(f9008,plain,
( sk4 != sk4
| nil = app(tl(sk4),cons(hd(sk4),nil))
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(superposition,[],[f7774,f4953]) ).
fof(f9010,plain,
( nil = app(tl(sk4),cons(hd(sk4),nil))
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(trivial_inequality_removal,[],[f9008]) ).
fof(f9151,plain,
( ~ duplicatefreeP(app(nil,sk4))
| ~ ssList(nil)
| ~ ssList(tl(sk4))
| ~ ssList(nil)
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(superposition,[],[f4986,f9010]) ).
fof(f9168,plain,
( nil != nil
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4))
| nil = tl(sk4)
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(superposition,[],[f122,f9010]) ).
fof(f9170,plain,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4))
| nil = tl(sk4)
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(trivial_inequality_removal,[],[f9168]) ).
fof(f9176,plain,
( ~ duplicatefreeP(app(nil,sk4))
| ~ ssList(nil)
| ~ ssList(tl(sk4))
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(duplicate_literal_removal,[],[f9151]) ).
fof(f9177,plain,
( ~ ssList(cons(hd(sk4),nil))
| nil = tl(sk4)
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(forward_subsumption_resolution,[],[f9170,f4597]) ).
fof(f9193,plain,
( ~ duplicatefreeP(app(nil,sk4))
| ~ ssList(tl(sk4))
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(forward_subsumption_resolution,[],[f9176,f8]) ).
fof(f9195,plain,
( ~ ssList(cons(hd(sk4),nil))
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100
| spl0_107 ),
inference(forward_subsumption_resolution,[],[f9177,f5032]) ).
fof(f9205,plain,
( ~ duplicatefreeP(app(nil,sk4))
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(forward_subsumption_resolution,[],[f9193,f4597]) ).
fof(f9212,plain,
( ~ duplicatefreeP(sk4)
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100 ),
inference(forward_demodulation,[],[f9205,f459]) ).
fof(f9407,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk4))
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100
| spl0_107 ),
inference(resolution,[],[f9195,f86]) ).
fof(f9408,plain,
( ~ ssItem(hd(sk4))
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100
| spl0_107 ),
inference(forward_subsumption_resolution,[],[f9407,f8]) ).
fof(f9409,plain,
( $false
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100
| spl0_107 ),
inference(forward_subsumption_resolution,[],[f9408,f378]) ).
fof(f9410,plain,
( spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100
| spl0_107 ),
inference(avatar_contradiction_clause,[],[f9409]) ).
fof(f9567,plain,
( $false
| spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100
| ~ spl0_107 ),
inference(global_subsumption,[],[f9212,f6644]) ).
fof(f9568,plain,
( spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100
| ~ spl0_107 ),
inference(avatar_contradiction_clause,[],[f9567]) ).
cnf(s207,plain,
~ spl0_4,
inference(sat_conversion,[],[f258]) ).
cnf(s224,plain,
~ spl0_2,
inference(sat_conversion,[],[f269]) ).
cnf(s376,plain,
( spl0_34
| spl0_36 ),
inference(sat_conversion,[],[f385]) ).
cnf(s1074,plain,
( spl0_4
| spl0_2
| spl0_4
| ~ spl0_66 ),
inference(sat_conversion,[],[f1494]) ).
cnf(s1075,plain,
( spl0_2
| spl0_4
| ~ spl0_66 ),
inference(rat,[],[s1074]) ).
cnf(s1163,plain,
( spl0_4
| ~ spl0_36
| spl0_66 ),
inference(sat_conversion,[],[f1599]) ).
cnf(s2072,plain,
( ~ spl0_3
| ~ spl0_5 ),
inference(sat_conversion,[],[f3596]) ).
cnf(s2518,plain,
( spl0_5
| spl0_100 ),
inference(sat_conversion,[],[f4609]) ).
cnf(s2531,plain,
( spl0_3
| ~ spl0_34 ),
inference(sat_conversion,[],[f4617]) ).
cnf(s2699,plain,
spl0_6,
inference(sat_conversion,[],[f4904]) ).
cnf(s5015,plain,
( spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100
| spl0_107 ),
inference(sat_conversion,[],[f9410]) ).
cnf(s5158,plain,
( spl0_5
| ~ spl0_6
| ~ spl0_34
| ~ spl0_100
| ~ spl0_107 ),
inference(sat_conversion,[],[f9568]) ).
cnf(s5217,plain,
~ spl0_66,
inference(rat,[],[s1075,s224,s207]) ).
cnf(s5224,plain,
~ spl0_36,
inference(rat,[],[s1163,s207,s5217]) ).
cnf(s5226,plain,
spl0_34,
inference(rat,[],[s376,s5224]) ).
cnf(s5234,plain,
spl0_3,
inference(rat,[],[s2531,s5226]) ).
cnf(s5246,plain,
~ spl0_5,
inference(rat,[],[s2072,s5234]) ).
cnf(s5250,plain,
spl0_100,
inference(rat,[],[s2518,s5246]) ).
cnf(s5255,plain,
~ spl0_107,
inference(rat,[],[s5158,s5246,s5226,s2699,s5250]) ).
cnf(s5256,plain,
$false,
inference(rat,[],[s5015,s5246,s5226,s2699,s5255,s5250]) ).
fof(f9610,plain,
$false,
inference(avatar_sat_refutation,[],[s5256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC211-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n017.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Sep 28 08:23:37 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.46 Running first-order model finding
% 0.12/0.46 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.46/0.76 % (3397446)Will run a generic schedule for satisfiability detection.
% 1.46/0.76 % (3397453)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=664948820:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.46/0.76 % (3397454)dis+10_1_sil=32000:sp=arity:random_seed=3024506576:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.46/0.76 % (3397452)% WARNING: option uhcvi not known.
% 1.46/0.76 % (3397451)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=596472340_2999 on theBenchmark for (2999ds/0Mi)
% 1.46/0.76 % (3397452)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1618803912:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.46/0.76 % (3397455)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=728723423:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.46/0.76 % (3397456)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2988881706:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.46/0.76 % (3397457)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2422214662:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.46/0.76 % TRYING [1]
% 1.46/0.76 % TRYING [2]
% 1.46/0.76 % TRYING [3]
% 1.46/0.76 % TRYING [4]
% 1.46/0.76 % (3397454)Instruction limit reached!
% 1.46/0.76 % (3397454)------------------------------
% 1.46/0.76 % (3397454)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.46/0.76 % (3397454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.46/0.76 % (3397454)CaDiCaL version: 2.1.3
% 1.46/0.76 % (3397454)Termination reason: Instruction limit
% 1.46/0.76 % (3397454)Termination phase: Saturation
% 1.46/0.76 % (3397454)Time elapsed: 0.090 s
% 1.46/0.76 % (3397454)Peak memory usage: 13 MB
% 1.46/0.76 % (3397454)Instructions burned: 103 (million)
% 1.46/0.76 % (3397455)Instruction limit reached!
% 1.46/0.76 % (3397455)------------------------------
% 1.46/0.76 % (3397455)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.46/0.76 % (3397455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.46/0.76 % (3397455)CaDiCaL version: 2.1.3
% 1.46/0.76 % (3397455)Termination reason: Instruction limit
% 1.46/0.76 % (3397455)Termination phase: Saturation
% 1.46/0.76 % (3397455)Time elapsed: 0.103 s
% 1.46/0.76 % (3397455)Peak memory usage: 13 MB
% 1.46/0.76 % (3397455)Instructions burned: 116 (million)
% 1.46/0.76 % (3397465)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1024928099:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.46/0.76 % TRYING [1]
% 1.46/0.76 % TRYING [2]
% 1.46/0.76 % (3397456)Instruction limit reached!
% 1.46/0.76 % (3397456)------------------------------
% 1.46/0.76 % (3397456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.46/0.76 % (3397456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.46/0.76 % (3397456)CaDiCaL version: 2.1.3
% 1.46/0.76 % (3397456)Termination reason: Instruction limit
% 1.46/0.76 % (3397456)Termination phase: Saturation
% 1.46/0.76 % (3397456)Time elapsed: 0.121 s
% 1.46/0.76 % (3397456)Peak memory usage: 13 MB
% 1.46/0.76 % (3397456)Instructions burned: 132 (million)
% 1.46/0.76 % TRYING [3]
% 1.46/0.76 % (3397467)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1755496146:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.46/0.76 % (3397468)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=2158977083:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.46/0.76 % (3397457)Instruction limit reached!
% 1.46/0.76 % (3397457)------------------------------
% 1.46/0.76 % (3397457)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.46/0.76 % (3397457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.46/0.76 % (3397457)CaDiCaL version: 2.1.3
% 1.46/0.76 % (3397457)Termination reason: Instruction limit
% 1.46/0.76 % (3397457)Termination phase: Saturation
% 1.46/0.76 % (3397457)Time elapsed: 0.157 s
% 1.46/0.76 % (3397457)Peak memory usage: 14 MB
% 1.46/0.76 % (3397457)Instructions burned: 160 (million)
% 1.46/0.76 % TRYING [4]
% 1.46/0.76 % TRYING [5]
% 1.46/0.76 % (3397471)ott-21_1_sil=16000:fs=off:random_seed=135344081:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.46/0.76 % (3397453) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3397446-3397453"...
% 1.46/0.76 % (3397453)...printing done.
% 1.46/0.76 % (3397453)Refutation found. Thanks to Tanya!
% 1.46/0.76 % SZS status Unsatisfiable for theBenchmark
% 1.46/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 1.46/0.76 % (3397453)------------------------------
% 1.46/0.76 % (3397453)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.46/0.76 % (3397453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.46/0.76 % (3397453)CaDiCaL version: 2.1.3
% 1.46/0.76 % (3397453)Termination reason: Refutation
% 1.46/0.76 % (3397453)Time elapsed: 0.252 s
% 1.46/0.76 % (3397453)Peak memory usage: 19 MB
% 1.46/0.76 % (3397453)Instructions burned: 506 (million)
% 1.46/0.76 % (3397446)Success in time 0.289 s
% 1.46/0.76 % Vampire exiting
%------------------------------------------------------------------------------