%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC253-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:03:09 PM UTC 2026
% Result : Unsatisfiable 1.61s 1.48s
% Output : Refutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 35
% Syntax : Number of formulae : 152 ( 24 unt; 15 def)
% Number of atoms : 412 ( 83 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 480 ( 220 ~; 245 |; 0 &)
% ( 15 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 21 ( 19 usr; 16 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause74) ).
fof(f75,axiom,
! [X0] :
( ssList(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause75) ).
fof(f76,axiom,
! [X0] :
( ssItem(hd(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause76) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).
fof(f100,axiom,
! [X0,X1] :
( cons(X0,X1) != X1
| ~ ssItem(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause99) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f107,axiom,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause104) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause115) ).
fof(f119,axiom,
! [X0,X1] :
( cons(X0,nil) != X1
| ~ ssItem(X0)
| ~ ssList(X1)
| singletonP(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause116) ).
fof(f129,axiom,
! [X0,X1] :
( hd(app(X1,X0)) = hd(X1)
| ~ ssList(X1)
| nil = X1
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause123) ).
fof(f144,axiom,
! [X0,X1] :
( tl(app(X1,X0)) = app(tl(X1),X0)
| ~ ssList(X1)
| nil = X1
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause133) ).
fof(f163,axiom,
! [X2,X0,X1] :
( app(X0,X1) != app(X2,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause151) ).
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)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f210,negated_conjecture,
! [X0,X1] :
( ~ ssList(X0)
| sk4 = X0
| ~ ssList(X1)
| tl(sk4) != X1
| app(sk3,X1) != X0
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( ~ singletonP(sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f214,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f218,plain,
( ~ singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f211,f205]) ).
fof(f221,plain,
! [X0] :
( ~ ssList(X0)
| sk4 = X0
| ~ ssList(tl(sk4))
| app(sk3,tl(sk4)) != X0
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f210]) ).
fof(f222,plain,
( ~ ssList(app(sk3,tl(sk4)))
| sk4 = app(sk3,tl(sk4))
| ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f221]) ).
fof(f226,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f227,plain,
! [X0] :
( singletonP(cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f119]) ).
fof(f234,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f226]) ).
fof(f237,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f214]) ).
fof(f254,definition,
( spl0_5
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f257,definition,
( spl0_6
<=> singletonP(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f258,plain,
( ~ singletonP(sk3)
| spl0_6 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f259,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f218,f257,f254]) ).
fof(f261,definition,
( spl0_7
<=> neq(nil,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f262,plain,
( ~ neq(nil,sk4)
| spl0_7 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f264,definition,
( spl0_8
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f265,plain,
( ~ ssList(tl(sk4))
| spl0_8 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f267,definition,
( spl0_9
<=> sk4 = app(sk3,tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f268,plain,
( sk4 = app(sk3,tl(sk4))
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f270,definition,
( spl0_10
<=> ssList(app(sk3,tl(sk4))) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f271,plain,
( ~ ssList(app(sk3,tl(sk4)))
| spl0_10 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f272,plain,
( ~ spl0_5
| ~ spl0_7
| ~ spl0_8
| spl0_9
| ~ spl0_10 ),
inference(avatar_split_clause,[],[f222,f270,f267,f264,f261,f254]) ).
fof(f273,plain,
( neq(sk4,nil)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f276,plain,
spl0_5,
inference(avatar_split_clause,[],[f237,f254]) ).
fof(f281,plain,
( ~ ssList(sk3)
| ~ ssList(tl(sk4))
| spl0_10 ),
inference(resolution,[],[f85,f271]) ).
fof(f288,plain,
( ~ ssList(tl(sk4))
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f281,f202]) ).
fof(f289,plain,
( ~ spl0_8
| spl0_10 ),
inference(avatar_split_clause,[],[f288,f270,f264]) ).
fof(f290,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_8 ),
inference(resolution,[],[f265,f75]) ).
fof(f291,plain,
( nil = sk4
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f290,f203]) ).
fof(f294,plain,
( neq(nil,nil)
| ~ spl0_5
| spl0_8 ),
inference(superposition,[],[f273,f291]) ).
fof(f298,plain,
( ~ ssList(nil)
| ~ spl0_5
| spl0_8 ),
inference(resolution,[],[f294,f234]) ).
fof(f299,plain,
( $false
| ~ spl0_5
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f298,f8]) ).
fof(f300,plain,
( ~ spl0_5
| spl0_8 ),
inference(avatar_contradiction_clause,[],[f299]) ).
fof(f305,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| nil = sk4
| spl0_7 ),
inference(resolution,[],[f102,f262]) ).
fof(f308,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f305,f8]) ).
fof(f309,plain,
( nil = sk4
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f308,f203]) ).
fof(f310,plain,
( ~ neq(nil,nil)
| spl0_7 ),
inference(superposition,[],[f262,f309]) ).
fof(f311,plain,
( neq(nil,nil)
| ~ spl0_5
| spl0_7 ),
inference(superposition,[],[f273,f309]) ).
fof(f322,plain,
( $false
| ~ spl0_5
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f311,f310]) ).
fof(f323,plain,
( ~ spl0_5
| spl0_7 ),
inference(avatar_contradiction_clause,[],[f322]) ).
fof(f329,plain,
! [X0] :
( tl(X0) != X0
| ~ ssItem(hd(X0))
| ~ ssList(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
inference(superposition,[],[f100,f107]) ).
fof(f332,plain,
! [X0] :
( tl(X0) != X0
| ~ ssList(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
inference(forward_subsumption_resolution,[],[f329,f76]) ).
fof(f335,plain,
! [X0] :
( tl(X0) != X0
| ~ ssList(X0)
| nil = X0 ),
inference(forward_subsumption_resolution,[],[f332,f75]) ).
fof(f343,definition,
( spl0_11
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f344,plain,
( nil = sk3
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f343]) ).
fof(f346,definition,
( spl0_12
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f380,plain,
( hd(sk3) = hd(sk4)
| ~ ssList(sk3)
| nil = sk3
| ~ ssList(tl(sk4))
| ~ spl0_9 ),
inference(superposition,[],[f129,f268]) ).
fof(f385,plain,
( hd(sk3) = hd(sk4)
| nil = sk3
| ~ ssList(tl(sk4))
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f380,f202]) ).
fof(f389,definition,
( spl0_13
<=> hd(sk3) = hd(sk4) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f390,plain,
( hd(sk3) = hd(sk4)
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f389]) ).
fof(f391,plain,
( ~ spl0_8
| spl0_11
| spl0_13
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f385,f267,f389,f343,f264]) ).
fof(f399,plain,
( sk3 = cons(hd(sk4),tl(sk3))
| ~ ssList(sk3)
| nil = sk3
| ~ spl0_13 ),
inference(superposition,[],[f107,f390]) ).
fof(f400,plain,
( ssItem(hd(sk4))
| ~ ssList(sk3)
| nil = sk3
| ~ spl0_13 ),
inference(superposition,[],[f76,f390]) ).
fof(f401,plain,
( ssItem(hd(sk4))
| nil = sk3
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f400,f202]) ).
fof(f402,plain,
( sk3 = cons(hd(sk4),tl(sk3))
| nil = sk3
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f399,f202]) ).
fof(f404,definition,
( spl0_16
<=> ssItem(hd(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
fof(f405,plain,
( ssItem(hd(sk4))
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f404]) ).
fof(f406,plain,
( spl0_11
| spl0_16
| ~ spl0_13 ),
inference(avatar_split_clause,[],[f401,f389,f404,f343]) ).
fof(f408,definition,
( spl0_17
<=> sk3 = cons(hd(sk4),tl(sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
fof(f409,plain,
( sk3 = cons(hd(sk4),tl(sk3))
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f408]) ).
fof(f410,plain,
( spl0_11
| spl0_17
| ~ spl0_13 ),
inference(avatar_split_clause,[],[f402,f389,f408,f343]) ).
fof(f433,plain,
( sk4 = app(nil,tl(sk4))
| ~ spl0_9
| ~ spl0_11 ),
inference(superposition,[],[f268,f344]) ).
fof(f470,plain,
( sk4 = tl(sk4)
| ~ ssList(tl(sk4))
| ~ spl0_9
| ~ spl0_11 ),
inference(superposition,[],[f433,f74]) ).
fof(f475,definition,
( spl0_19
<=> sk4 = tl(sk4) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f476,plain,
( sk4 = tl(sk4)
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f478,plain,
( ~ spl0_8
| spl0_19
| ~ spl0_9
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f470,f343,f267,f475,f264]) ).
fof(f483,plain,
( sk4 != sk4
| ~ ssList(sk4)
| nil = sk4
| ~ spl0_19 ),
inference(superposition,[],[f335,f476]) ).
fof(f486,plain,
( ~ ssList(sk4)
| nil = sk4
| ~ spl0_19 ),
inference(trivial_inequality_removal,[],[f483]) ).
fof(f488,plain,
( nil = sk4
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f486,f203]) ).
fof(f493,plain,
( nil = sk4
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f346]) ).
fof(f515,plain,
( spl0_12
| ~ spl0_19 ),
inference(avatar_split_clause,[],[f488,f475,f346]) ).
fof(f523,plain,
( tl(sk4) = app(tl(sk3),tl(sk4))
| ~ ssList(sk3)
| nil = sk3
| ~ ssList(tl(sk4))
| ~ spl0_9 ),
inference(superposition,[],[f144,f268]) ).
fof(f540,plain,
( neq(nil,nil)
| ~ spl0_5
| ~ spl0_12 ),
inference(superposition,[],[f273,f493]) ).
fof(f590,plain,
( ~ ssList(nil)
| ~ spl0_5
| ~ spl0_12 ),
inference(resolution,[],[f540,f234]) ).
fof(f591,plain,
( $false
| ~ spl0_5
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[],[f590,f8]) ).
fof(f592,plain,
( ~ spl0_5
| ~ spl0_12 ),
inference(avatar_contradiction_clause,[],[f591]) ).
fof(f594,plain,
( tl(sk4) = app(tl(sk3),tl(sk4))
| nil = sk3
| ~ ssList(tl(sk4))
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f523,f202]) ).
fof(f600,definition,
( spl0_29
<=> tl(sk4) = app(tl(sk3),tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_29])],[avatar_definition]) ).
fof(f601,plain,
( tl(sk4) = app(tl(sk3),tl(sk4))
| ~ spl0_29 ),
inference(avatar_component_clause,[],[f600]) ).
fof(f602,plain,
( ~ spl0_8
| spl0_11
| spl0_29
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f594,f267,f600,f343,f264]) ).
fof(f608,plain,
! [X0,X1] :
( app(X1,X0) != X0
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(nil)
| nil = X1
| ~ ssList(X0) ),
inference(superposition,[],[f163,f74]) ).
fof(f618,plain,
! [X0,X1] :
( app(X1,X0) != X0
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(nil)
| nil = X1 ),
inference(duplicate_literal_removal,[],[f608]) ).
fof(f625,plain,
! [X0,X1] :
( app(X1,X0) != X0
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X1 ),
inference(forward_subsumption_resolution,[],[f618,f8]) ).
fof(f864,definition,
( spl0_37
<=> ssList(tl(sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_37])],[avatar_definition]) ).
fof(f865,plain,
( ~ ssList(tl(sk3))
| spl0_37 ),
inference(avatar_component_clause,[],[f864]) ).
fof(f913,plain,
( ~ ssList(sk3)
| nil = sk3
| spl0_37 ),
inference(resolution,[],[f865,f75]) ).
fof(f914,plain,
( nil = sk3
| spl0_37 ),
inference(forward_subsumption_resolution,[],[f913,f202]) ).
fof(f915,plain,
( spl0_11
| spl0_37 ),
inference(avatar_split_clause,[],[f914,f864,f343]) ).
fof(f1011,definition,
( spl0_50
<=> nil = tl(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_50])],[avatar_definition]) ).
fof(f1012,plain,
( nil = tl(sk3)
| ~ spl0_50 ),
inference(avatar_component_clause,[],[f1011]) ).
fof(f1025,plain,
( sk3 = cons(hd(sk4),nil)
| ~ spl0_17
| ~ spl0_50 ),
inference(superposition,[],[f409,f1012]) ).
fof(f1102,plain,
( ssList(cons(hd(sk4),nil))
| ~ spl0_17
| ~ spl0_50 ),
inference(superposition,[],[f202,f1025]) ).
fof(f1103,plain,
( ~ singletonP(cons(hd(sk4),nil))
| spl0_6
| ~ spl0_17
| ~ spl0_50 ),
inference(superposition,[],[f258,f1025]) ).
fof(f1166,plain,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| spl0_6
| ~ spl0_17
| ~ spl0_50 ),
inference(resolution,[],[f1103,f227]) ).
fof(f1167,plain,
( ~ ssItem(hd(sk4))
| spl0_6
| ~ spl0_17
| ~ spl0_50 ),
inference(forward_subsumption_resolution,[],[f1166,f1102]) ).
fof(f1168,plain,
( $false
| spl0_6
| ~ spl0_16
| ~ spl0_17
| ~ spl0_50 ),
inference(forward_subsumption_resolution,[],[f1167,f405]) ).
fof(f1169,plain,
( spl0_6
| ~ spl0_16
| ~ spl0_17
| ~ spl0_50 ),
inference(avatar_contradiction_clause,[],[f1168]) ).
fof(f1252,plain,
( tl(sk4) != tl(sk4)
| ~ ssList(tl(sk3))
| ~ ssList(tl(sk4))
| nil = tl(sk3)
| ~ spl0_29 ),
inference(superposition,[],[f625,f601]) ).
fof(f1253,plain,
( ~ ssList(tl(sk3))
| ~ ssList(tl(sk4))
| nil = tl(sk3)
| ~ spl0_29 ),
inference(trivial_inequality_removal,[],[f1252]) ).
fof(f1258,plain,
( spl0_50
| ~ spl0_8
| ~ spl0_37
| ~ spl0_29 ),
inference(avatar_split_clause,[],[f1253,f600,f864,f264,f1011]) ).
cnf(s4,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f259]) ).
cnf(s5,plain,
( ~ spl0_5
| ~ spl0_7
| ~ spl0_8
| spl0_9
| ~ spl0_10 ),
inference(sat_conversion,[],[f272]) ).
cnf(s8,plain,
spl0_5,
inference(sat_conversion,[],[f276]) ).
cnf(s12,plain,
( ~ spl0_8
| spl0_10 ),
inference(sat_conversion,[],[f289]) ).
cnf(s13,plain,
( ~ spl0_5
| spl0_8 ),
inference(sat_conversion,[],[f300]) ).
cnf(s14,plain,
( ~ spl0_5
| spl0_7 ),
inference(sat_conversion,[],[f323]) ).
cnf(s16,plain,
( ~ spl0_8
| ~ spl0_9
| spl0_11
| spl0_13 ),
inference(sat_conversion,[],[f391]) ).
cnf(s18,plain,
( spl0_11
| ~ spl0_13
| spl0_16 ),
inference(sat_conversion,[],[f406]) ).
cnf(s19,plain,
( spl0_11
| ~ spl0_13
| spl0_17 ),
inference(sat_conversion,[],[f410]) ).
cnf(s22,plain,
( ~ spl0_8
| ~ spl0_9
| ~ spl0_11
| spl0_19 ),
inference(sat_conversion,[],[f478]) ).
cnf(s29,plain,
( spl0_12
| ~ spl0_19 ),
inference(sat_conversion,[],[f515]) ).
cnf(s36,plain,
( ~ spl0_5
| ~ spl0_12 ),
inference(sat_conversion,[],[f592]) ).
cnf(s38,plain,
( ~ spl0_8
| ~ spl0_9
| spl0_11
| spl0_29 ),
inference(sat_conversion,[],[f602]) ).
cnf(s54,plain,
( spl0_11
| spl0_37 ),
inference(sat_conversion,[],[f915]) ).
cnf(s78,plain,
( spl0_6
| ~ spl0_16
| ~ spl0_17
| ~ spl0_50 ),
inference(sat_conversion,[],[f1169]) ).
cnf(s89,plain,
( ~ spl0_8
| ~ spl0_29
| ~ spl0_37
| spl0_50 ),
inference(sat_conversion,[],[f1258]) ).
cnf(s91,plain,
~ spl0_12,
inference(rat,[],[s36,s8]) ).
cnf(s92,plain,
spl0_7,
inference(rat,[],[s14,s8]) ).
cnf(s93,plain,
spl0_8,
inference(rat,[],[s13,s8]) ).
cnf(s94,plain,
~ spl0_19,
inference(rat,[],[s29,s91]) ).
cnf(s95,plain,
spl0_10,
inference(rat,[],[s12,s93]) ).
cnf(s96,plain,
spl0_9,
inference(rat,[],[s5,s95,s93,s92,s8]) ).
cnf(s100,plain,
~ spl0_11,
inference(rat,[],[s22,s94,s93,s96]) ).
cnf(s105,plain,
spl0_37,
inference(rat,[],[s54,s100]) ).
cnf(s106,plain,
spl0_29,
inference(rat,[],[s38,s96,s93,s100]) ).
cnf(s107,plain,
spl0_13,
inference(rat,[],[s16,s96,s93,s100]) ).
cnf(s108,plain,
spl0_50,
inference(rat,[],[s89,s105,s93,s106]) ).
cnf(s115,plain,
spl0_17,
inference(rat,[],[s19,s100,s107]) ).
cnf(s116,plain,
spl0_16,
inference(rat,[],[s18,s100,s107]) ).
cnf(s117,plain,
spl0_6,
inference(rat,[],[s78,s108,s115,s116]) ).
cnf(s126,plain,
$false,
inference(rat,[],[s4,s117,s8]) ).
fof(f1264,plain,
$false,
inference(avatar_sat_refutation,[],[s126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC253-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.27 % Computer : n010.cluster.edu
% 0.13/0.27 % Model : x86_64 x86_64
% 0.13/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.27 % Memory : 8046.5625MB
% 0.13/0.27 % OS : Linux 6.8.0-71-generic
% 0.13/0.27 % CPULimit : 300
% 0.13/0.27 % WCLimit : 300
% 0.13/0.27 % DateTime : Mon Sep 28 08:43:52 UTC 2026
% 0.13/0.27 % CPUTime :
% 0.13/0.27 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.31 Running first-order theorem proving
% 0.26/0.31 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.61/1.48 % (1778101)Input is clausal, will run a generic CNF schedule.
% 1.61/1.48 % (1778121)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3689111114:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 1.61/1.48 % (1778122)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3742931006:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 1.61/1.48 % (1778121)First to succeed.
% 1.61/1.48 % (1778121)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1778101"
% 1.61/1.48 % (1778119)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2997959397:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 1.61/1.48 % (1778118)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2673422912:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 1.61/1.48 % (1778117)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2482369050:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 1.61/1.48 % (1778120)lrs+10_1_sil=8000:sp=occurrence:random_seed=2876166990:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 1.61/1.48 % (1778123)dis-21_1_sil=8000:lcm=predicate:random_seed=3709649595:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 1.61/1.48 % (1778122)Also succeeded, but the first one will report.
% 1.61/1.48 % (1778120)Instruction limit reached!
% 1.61/1.48 % (1778120)------------------------------
% 1.61/1.48 % (1778120)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.61/1.48 % (1778120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/1.48 % (1778120)CaDiCaL version: 2.1.3
% 1.61/1.48 % (1778120)Termination reason: Instruction limit
% 1.61/1.48 % (1778120)Termination phase: Saturation
% 1.61/1.48 % (1778120)Time elapsed: 0.102 s
% 1.61/1.48 % (1778120)Peak memory usage: 89 MB
% 1.61/1.48 % (1778120)Instructions burned: 107 (million)
% 1.61/1.48 % (1778123)Instruction limit reached!
% 1.61/1.48 % (1778123)------------------------------
% 1.61/1.48 % (1778123)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.61/1.48 % (1778123)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.61/1.48 % (1778123)CaDiCaL version: 2.1.3
% 1.61/1.48 % (1778123)Termination reason: Instruction limit
% 1.61/1.48 % (1778123)Termination phase: Saturation
% 1.61/1.48 % (1778123)Time elapsed: 0.085 s
% 1.61/1.48 % (1778123)Peak memory usage: 89 MB
% 1.61/1.48 % (1778123)Instructions burned: 118 (million)
% 1.61/1.48 % (1778121)Refutation found. Thanks to Tanya!
% 1.61/1.48 % SZS status Unsatisfiable for theBenchmark
% 1.61/1.48 % SZS output start Proof for theBenchmark
% See solution above
% 4.10/1.64 % (1778121)------------------------------
% 4.10/1.64 % (1778121)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.10/1.64 % (1778121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.10/1.64 % (1778121)CaDiCaL version: 2.1.3
% 4.10/1.64 % (1778121)Termination reason: Refutation
% 4.10/1.64 % (1778121)Time elapsed: 0.035 s
% 4.10/1.64 % (1778121)Peak memory usage: 90 MB
% 4.10/1.64 % (1778121)Instructions burned: 64 (million)
% 4.10/1.64 % (1778121)------------------------------
% 4.10/1.64 % (1778121)------------------------------
% 4.10/1.64 % (1778101)Success in time 0.443 s
% 4.10/1.64 % Vampire exiting
%------------------------------------------------------------------------------