%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC029+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:02:06 PM UTC 2026
% Result : Theorem 2.93s 1.25s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 24
% Syntax : Number of formulae : 136 ( 25 unt; 18 def)
% Number of atoms : 425 ( 117 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 499 ( 210 ~; 201 |; 52 &)
% ( 16 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 23 ( 21 usr; 13 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn 50 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) != X2 ) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) != X2 ) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) = X2
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) = X2
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
( sK1 = sK3
& sK0 = sK2
& ( nil = sK2
| nil != sK3 )
& ( ( sK3 = app(cons(sK4,nil),sK5)
& sK2 = app(sK5,cons(sK4,nil))
& ssList(sK5)
& ssItem(sK4) )
| ~ neq(sK3,nil) )
& ( ( nil = sK1
& nil != sK0 )
| ( nil = sK0
& nil != sK1 ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f99]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f123]) ).
fof(f125,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f128,plain,
ssList(sK1),
inference(cnf_transformation,[],[f120]) ).
fof(f131,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f120]) ).
fof(f134,plain,
( nil = sK1
| nil = sK0 ),
inference(cnf_transformation,[],[f120]) ).
fof(f135,plain,
( ssItem(sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f120]) ).
fof(f136,plain,
( ssList(sK5)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f120]) ).
fof(f137,plain,
( sK2 = app(sK5,cons(sK4,nil))
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f120]) ).
fof(f139,plain,
( nil = sK2
| nil != sK3 ),
inference(cnf_transformation,[],[f120]) ).
fof(f140,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f120]) ).
fof(f141,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f120]) ).
fof(f145,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f152,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f154,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f155,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f165,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f168,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f169,plain,
( nil = sK3
| nil = sK2 ),
inference(definition_unfolding,[],[f134,f141,f140]) ).
fof(f172,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f131,f140,f141]) ).
fof(f173,plain,
ssList(sK3),
inference(definition_unfolding,[],[f128,f141]) ).
fof(f175,definition,
~ sP10(nil),
introduced(definition,[new_symbols(definition,[sP10])],[inequality_splitting_name_introduction]) ).
fof(f176,plain,
( nil = sK2
| sP10(sK3) ),
inference(inequality_splitting,[],[f139,f175]) ).
fof(f181,definition,
~ sP13(nil),
introduced(definition,[new_symbols(definition,[sP13])],[inequality_splitting_name_introduction]) ).
fof(f182,definition,
~ sP14(nil),
introduced(definition,[new_symbols(definition,[sP14])],[inequality_splitting_name_introduction]) ).
fof(f183,plain,
( sP13(sK2)
| sP14(sK3) ),
inference(inequality_splitting,[],[f172,f182,f181]) ).
fof(f186,definition,
~ sP16(nil),
introduced(definition,[new_symbols(definition,[sP16])],[inequality_splitting_name_introduction]) ).
fof(f187,plain,
! [X0,X1] :
( sP16(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(inequality_splitting,[],[f145,f186]) ).
fof(f191,definition,
~ sP19(nil),
introduced(definition,[new_symbols(definition,[sP19])],[inequality_splitting_name_introduction]) ).
fof(f192,plain,
! [X0,X1] :
( sP19(app(X0,X1))
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(inequality_splitting,[],[f155,f191]) ).
fof(f193,definition,
~ sP20(nil),
introduced(definition,[new_symbols(definition,[sP20])],[inequality_splitting_name_introduction]) ).
fof(f194,plain,
! [X0,X1] :
( sP20(app(X0,X1))
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(inequality_splitting,[],[f154,f193]) ).
fof(f198,definition,
( spl21_1
<=> sP14(sK3) ),
introduced(definition,[new_symbols(definition,[spl21_1])],[avatar_definition]) ).
fof(f200,plain,
( sP14(sK3)
| ~ spl21_1 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f202,definition,
( spl21_2
<=> sP13(sK2) ),
introduced(definition,[new_symbols(definition,[spl21_2])],[avatar_definition]) ).
fof(f204,plain,
( sP13(sK2)
| ~ spl21_2 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f205,plain,
( spl21_1
| spl21_2 ),
inference(avatar_split_clause,[],[f183,f202,f198]) ).
fof(f207,definition,
( spl21_3
<=> nil = sK2 ),
introduced(definition,[new_symbols(definition,[spl21_3])],[avatar_definition]) ).
fof(f209,plain,
( nil = sK2
| ~ spl21_3 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f220,definition,
( spl21_6
<=> nil = sK3 ),
introduced(definition,[new_symbols(definition,[spl21_6])],[avatar_definition]) ).
fof(f222,plain,
( nil = sK3
| ~ spl21_6 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f224,plain,
( spl21_3
| spl21_6 ),
inference(avatar_split_clause,[],[f169,f220,f207]) ).
fof(f226,definition,
( spl21_7
<=> neq(sK3,nil) ),
introduced(definition,[new_symbols(definition,[spl21_7])],[avatar_definition]) ).
fof(f228,plain,
( ~ neq(sK3,nil)
| spl21_7 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f230,definition,
( spl21_8
<=> ssItem(sK4) ),
introduced(definition,[new_symbols(definition,[spl21_8])],[avatar_definition]) ).
fof(f232,plain,
( ssItem(sK4)
| ~ spl21_8 ),
inference(avatar_component_clause,[],[f230]) ).
fof(f233,plain,
( ~ spl21_7
| spl21_8 ),
inference(avatar_split_clause,[],[f135,f230,f226]) ).
fof(f235,definition,
( spl21_9
<=> ssList(sK5) ),
introduced(definition,[new_symbols(definition,[spl21_9])],[avatar_definition]) ).
fof(f237,plain,
( ssList(sK5)
| ~ spl21_9 ),
inference(avatar_component_clause,[],[f235]) ).
fof(f238,plain,
( ~ spl21_7
| spl21_9 ),
inference(avatar_split_clause,[],[f136,f235,f226]) ).
fof(f240,definition,
( spl21_10
<=> sK2 = app(sK5,cons(sK4,nil)) ),
introduced(definition,[new_symbols(definition,[spl21_10])],[avatar_definition]) ).
fof(f242,plain,
( sK2 = app(sK5,cons(sK4,nil))
| ~ spl21_10 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f243,plain,
( ~ spl21_7
| spl21_10 ),
inference(avatar_split_clause,[],[f137,f240,f226]) ).
fof(f250,definition,
( spl21_12
<=> sP10(sK3) ),
introduced(definition,[new_symbols(definition,[spl21_12])],[avatar_definition]) ).
fof(f252,plain,
( sP10(sK3)
| ~ spl21_12 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f253,plain,
( spl21_12
| spl21_3 ),
inference(avatar_split_clause,[],[f176,f207,f250]) ).
fof(f259,plain,
( sP13(nil)
| ~ spl21_2
| ~ spl21_3 ),
inference(superposition,[],[f204,f209]) ).
fof(f261,plain,
( $false
| ~ spl21_2
| ~ spl21_3 ),
inference(forward_subsumption_resolution,[],[f259,f181]) ).
fof(f262,plain,
( ~ spl21_2
| ~ spl21_3 ),
inference(avatar_contradiction_clause,[],[f261]) ).
fof(f265,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| spl21_7 ),
inference(resolution,[],[f228,f165]) ).
fof(f267,plain,
( nil = sK3
| ~ ssList(sK3)
| spl21_7 ),
inference(forward_subsumption_resolution,[],[f265,f168]) ).
fof(f277,plain,
( nil = sK3
| spl21_7 ),
inference(forward_subsumption_resolution,[],[f267,f173]) ).
fof(f278,plain,
( spl21_6
| spl21_7 ),
inference(avatar_split_clause,[],[f277,f226,f220]) ).
fof(f280,plain,
( sP14(nil)
| ~ spl21_1
| ~ spl21_6 ),
inference(superposition,[],[f200,f222]) ).
fof(f285,plain,
( $false
| ~ spl21_1
| ~ spl21_6 ),
inference(forward_subsumption_resolution,[],[f280,f182]) ).
fof(f286,plain,
( ~ spl21_1
| ~ spl21_6 ),
inference(avatar_contradiction_clause,[],[f285]) ).
fof(f289,plain,
( sP10(nil)
| ~ spl21_6
| ~ spl21_12 ),
inference(forward_demodulation,[],[f252,f222]) ).
fof(f290,plain,
( $false
| ~ spl21_6
| ~ spl21_12 ),
inference(forward_subsumption_resolution,[],[f289,f175]) ).
fof(f291,plain,
( ~ spl21_6
| ~ spl21_12 ),
inference(avatar_contradiction_clause,[],[f290]) ).
fof(f292,plain,
( nil = app(sK5,cons(sK4,nil))
| ~ spl21_3
| ~ spl21_10 ),
inference(forward_demodulation,[],[f242,f209]) ).
fof(f314,plain,
( sP19(nil)
| nil = cons(sK4,nil)
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl21_3
| ~ spl21_10 ),
inference(superposition,[],[f192,f292]) ).
fof(f315,plain,
( sP20(nil)
| nil = sK5
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl21_3
| ~ spl21_10 ),
inference(superposition,[],[f194,f292]) ).
fof(f316,plain,
( nil = sK5
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl21_3
| ~ spl21_10 ),
inference(forward_subsumption_resolution,[],[f315,f193]) ).
fof(f317,plain,
( nil = cons(sK4,nil)
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl21_3
| ~ spl21_10 ),
inference(forward_subsumption_resolution,[],[f314,f191]) ).
fof(f324,plain,
( nil = sK5
| ~ ssList(cons(sK4,nil))
| ~ spl21_3
| ~ spl21_9
| ~ spl21_10 ),
inference(forward_subsumption_resolution,[],[f316,f237]) ).
fof(f325,plain,
( nil = cons(sK4,nil)
| ~ ssList(cons(sK4,nil))
| ~ spl21_3
| ~ spl21_9
| ~ spl21_10 ),
inference(forward_subsumption_resolution,[],[f317,f237]) ).
fof(f327,definition,
( spl21_15
<=> ssList(cons(sK4,nil)) ),
introduced(definition,[new_symbols(definition,[spl21_15])],[avatar_definition]) ).
fof(f329,plain,
( ~ ssList(cons(sK4,nil))
| spl21_15 ),
inference(avatar_component_clause,[],[f327]) ).
fof(f349,definition,
( spl21_20
<=> nil = sK5 ),
introduced(definition,[new_symbols(definition,[spl21_20])],[avatar_definition]) ).
fof(f351,plain,
( nil = sK5
| ~ spl21_20 ),
inference(avatar_component_clause,[],[f349]) ).
fof(f352,plain,
( ~ spl21_15
| spl21_20
| ~ spl21_3
| ~ spl21_9
| ~ spl21_10 ),
inference(avatar_split_clause,[],[f324,f240,f235,f207,f349,f327]) ).
fof(f354,definition,
( spl21_21
<=> nil = cons(sK4,nil) ),
introduced(definition,[new_symbols(definition,[spl21_21])],[avatar_definition]) ).
fof(f356,plain,
( nil = cons(sK4,nil)
| ~ spl21_21 ),
inference(avatar_component_clause,[],[f354]) ).
fof(f357,plain,
( ~ spl21_15
| spl21_21
| ~ spl21_3
| ~ spl21_9
| ~ spl21_10 ),
inference(avatar_split_clause,[],[f325,f240,f235,f207,f354,f327]) ).
fof(f358,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| spl21_15 ),
inference(resolution,[],[f329,f152]) ).
fof(f360,plain,
( ~ ssList(nil)
| ~ spl21_8
| spl21_15 ),
inference(forward_subsumption_resolution,[],[f358,f232]) ).
fof(f361,plain,
( $false
| ~ spl21_8
| spl21_15 ),
inference(forward_subsumption_resolution,[],[f360,f168]) ).
fof(f362,plain,
( ~ spl21_8
| spl21_15 ),
inference(avatar_contradiction_clause,[],[f361]) ).
fof(f363,plain,
( sK5 = cons(sK4,sK5)
| ~ spl21_20
| ~ spl21_21 ),
inference(forward_demodulation,[],[f356,f351]) ).
fof(f374,plain,
( ~ sP16(sK5)
| ~ spl21_20 ),
inference(superposition,[],[f186,f351]) ).
fof(f396,plain,
( sP16(sK5)
| ~ ssItem(sK4)
| ~ ssList(sK5)
| ~ spl21_20
| ~ spl21_21 ),
inference(superposition,[],[f187,f363]) ).
fof(f398,plain,
( ~ ssItem(sK4)
| ~ ssList(sK5)
| ~ spl21_20
| ~ spl21_21 ),
inference(forward_subsumption_resolution,[],[f396,f374]) ).
fof(f404,plain,
( ~ ssList(sK5)
| ~ spl21_8
| ~ spl21_20
| ~ spl21_21 ),
inference(forward_subsumption_resolution,[],[f398,f232]) ).
fof(f411,plain,
( $false
| ~ spl21_8
| ~ spl21_9
| ~ spl21_20
| ~ spl21_21 ),
inference(forward_subsumption_resolution,[],[f404,f237]) ).
fof(f412,plain,
( ~ spl21_8
| ~ spl21_9
| ~ spl21_20
| ~ spl21_21 ),
inference(avatar_contradiction_clause,[],[f411]) ).
cnf(s1,plain,
( spl21_1
| spl21_2 ),
inference(sat_conversion,[],[f205]) ).
cnf(s4,plain,
( spl21_3
| spl21_6 ),
inference(sat_conversion,[],[f224]) ).
cnf(s5,plain,
( ~ spl21_7
| spl21_8 ),
inference(sat_conversion,[],[f233]) ).
cnf(s6,plain,
( ~ spl21_7
| spl21_9 ),
inference(sat_conversion,[],[f238]) ).
cnf(s7,plain,
( ~ spl21_7
| spl21_10 ),
inference(sat_conversion,[],[f243]) ).
cnf(s9,plain,
( spl21_3
| spl21_12 ),
inference(sat_conversion,[],[f253]) ).
cnf(s10,plain,
( ~ spl21_2
| ~ spl21_3 ),
inference(sat_conversion,[],[f262]) ).
cnf(s12,plain,
( spl21_6
| spl21_7 ),
inference(sat_conversion,[],[f278]) ).
cnf(s14,plain,
( ~ spl21_1
| ~ spl21_6 ),
inference(sat_conversion,[],[f286]) ).
cnf(s15,plain,
( ~ spl21_6
| ~ spl21_12 ),
inference(sat_conversion,[],[f291]) ).
cnf(s23,plain,
( ~ spl21_3
| ~ spl21_9
| ~ spl21_10
| ~ spl21_15
| spl21_20 ),
inference(sat_conversion,[],[f352]) ).
cnf(s24,plain,
( ~ spl21_3
| ~ spl21_9
| ~ spl21_10
| ~ spl21_15
| spl21_21 ),
inference(sat_conversion,[],[f357]) ).
cnf(s25,plain,
( ~ spl21_8
| spl21_15 ),
inference(sat_conversion,[],[f362]) ).
cnf(s27,plain,
( ~ spl21_8
| ~ spl21_9
| ~ spl21_20
| ~ spl21_21 ),
inference(sat_conversion,[],[f412]) ).
cnf(s28,plain,
spl21_3,
inference(rat,[],[s15,s4,s9]) ).
cnf(s30,plain,
~ spl21_2,
inference(rat,[],[s10,s28]) ).
cnf(s31,plain,
spl21_1,
inference(rat,[],[s1,s30]) ).
cnf(s32,plain,
~ spl21_6,
inference(rat,[],[s14,s31]) ).
cnf(s33,plain,
spl21_7,
inference(rat,[],[s12,s32]) ).
cnf(s36,plain,
spl21_10,
inference(rat,[],[s7,s33]) ).
cnf(s37,plain,
spl21_9,
inference(rat,[],[s6,s33]) ).
cnf(s38,plain,
spl21_8,
inference(rat,[],[s5,s33]) ).
cnf(s39,plain,
spl21_15,
inference(rat,[],[s25,s38]) ).
cnf(s40,plain,
spl21_21,
inference(rat,[],[s24,s37,s28,s36,s39]) ).
cnf(s41,plain,
spl21_20,
inference(rat,[],[s23,s37,s28,s36,s39]) ).
cnf(s46,plain,
$false,
inference(rat,[],[s27,s38,s37,s40,s41]) ).
fof(f413,plain,
$false,
inference(avatar_sat_refutation,[],[s46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC029+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:31:32 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.25 % (1740987)Detected formulas, will run a generic FOF schedule.
% 2.93/1.25 % (1740998)dis-21_1_sil=8000:lcm=predicate:random_seed=222836179:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.93/1.25 % (1740997)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=706306932:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.93/1.25 % (1740992)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=3627811852:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.93/1.25 % (1740995)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3807679234:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.93/1.25 % (1740993)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=760033388:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.93/1.25 % (1740994)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3574608460:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.93/1.25 % (1740998)Instruction limit reached!
% 2.93/1.25 % (1740998)------------------------------
% 2.93/1.25 % (1740998)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.93/1.25 % (1740998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.93/1.25 % (1740998)CaDiCaL version: 2.1.3
% 2.93/1.25 % (1740998)Termination reason: Instruction limit
% 2.93/1.25 % (1740998)Termination phase: Saturation
% 2.93/1.25 % (1740998)Time elapsed: 0.043 s
% 2.93/1.25 % (1740998)Peak memory usage: 90 MB
% 2.93/1.25 % (1740998)Instructions burned: 130 (million)
% 2.93/1.25 % (1740995)First to succeed.
% 2.93/1.25 % (1740996)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1562426087:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.93/1.25 % (1740995)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1740987"
% 2.93/1.25 % (1740997)Also succeeded, but the first one will report.
% 2.93/1.25 % (1740996)Also succeeded, but the first one will report.
% 2.93/1.25 % (1741006)lrs+10_1_sil=8000:sp=occurrence:random_seed=2364858193:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.93/1.25 % (1741006)Also succeeded, but the first one will report.
% 2.93/1.25 % (1740995)Refutation found. Thanks to Tanya!
% 2.93/1.25 % SZS status Theorem for theBenchmark
% 2.93/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.44 % (1740995)------------------------------
% 3.48/1.44 % (1740995)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.44 % (1740995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.44 % (1740995)CaDiCaL version: 2.1.3
% 3.48/1.44 % (1740995)Termination reason: Refutation
% 3.48/1.44 % (1740995)Time elapsed: 0.008 s
% 3.48/1.44 % (1740995)Peak memory usage: 89 MB
% 3.48/1.44 % (1740995)Instructions burned: 9 (million)
% 3.48/1.44 % (1740995)------------------------------
% 3.48/1.44 % (1740995)------------------------------
% 3.48/1.44 % (1740987)Success in time 0.41 s
% 3.48/1.44 % Vampire exiting
%------------------------------------------------------------------------------