%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC366+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 : n004.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:44 PM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of formulae : 112 ( 22 unt; 9 def)
% Number of atoms : 370 ( 58 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 449 ( 191 ~; 191 |; 36 &)
% ( 13 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 10 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn 62 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X3 != X4
& ? [X5] :
( ssList(X5)
& app(X5,X2) = X4
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X3) = X6
& neq(nil,X3) ) ) )
| rearsegP(X1,X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X3 != X4
& ? [X5] :
( ssList(X5)
& app(X5,X2) = X4
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X3) = X6
& neq(nil,X3) ) ) )
| rearsegP(X1,X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ~ ssList(X5)
| app(X5,X2) != X4
| ! [X6] :
( ~ ssItem(X6)
| cons(X6,nil) != X5
| hd(X3) != X6
| ~ neq(nil,X3) ) ) )
& ~ rearsegP(X1,X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ~ ssList(X5)
| app(X5,X2) != X4
| ! [X6] :
( ~ ssItem(X6)
| cons(X6,nil) != X5
| hd(X3) != X6
| ~ neq(nil,X3) ) ) )
& ~ rearsegP(X1,X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f240,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X2,X1) != X0
| ~ ssList(X2)
| rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f305,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f314,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f318,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f411,plain,
! [X6,X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| hd(sK50) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6)
| app(X5,sK49) != X4
| ~ ssList(X5)
| sK50 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( ~ neq(sK50,nil)
| ~ rearsegP(sK48,sK47) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
( ~ neq(sK50,nil)
| ~ rearsegP(sK50,sK49) ),
inference(definition_unfolding,[],[f415,f419,f418]) ).
fof(f427,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f414,f419]) ).
fof(f434,plain,
! [X2,X1] :
( ~ ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X2,X1),X1) ),
inference(equality_resolution,[],[f240]) ).
fof(f444,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f458,plain,
! [X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| cons(hd(sK50),nil) != X5
| ~ ssItem(hd(sK50))
| app(X5,sK49) != X4
| ~ ssList(X5)
| sK50 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f411]) ).
fof(f459,plain,
! [X4] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| app(cons(hd(sK50),nil),sK49) != X4
| ~ ssList(cons(hd(sK50),nil))
| sK50 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f458]) ).
fof(f460,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| ~ ssList(cons(hd(sK50),nil))
| sK50 = app(cons(hd(sK50),nil),sK49)
| ~ ssList(app(cons(hd(sK50),nil),sK49)) ),
inference(equality_resolution,[],[f459]) ).
fof(f466,plain,
! [X2,X1] :
( ~ ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(app(X2,X1),X1) ),
inference(consistent_polarity_flipping,[],[f434]) ).
fof(f515,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| neq(X1,X1) ),
inference(consistent_polarity_flipping,[],[f444]) ).
fof(f516,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f548,plain,
( neq(sK50,nil)
| rearsegP(sK50,sK49) ),
inference(consistent_polarity_flipping,[],[f426]) ).
fof(f549,plain,
~ neq(sK50,nil),
inference(consistent_polarity_flipping,[],[f427]) ).
fof(f552,plain,
( neq(sK50,nil)
| neq(nil,sK50)
| ~ ssItem(hd(sK50))
| ~ ssList(cons(hd(sK50),nil))
| sK50 = app(cons(hd(sK50),nil),sK49)
| ~ ssList(app(cons(hd(sK50),nil),sK49)) ),
inference(consistent_polarity_flipping,[],[f460]) ).
fof(f557,plain,
! [X1] :
( neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f515]) ).
fof(f561,definition,
( spl51_1
<=> ssList(app(cons(hd(sK50),nil),sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f563,plain,
( ~ ssList(app(cons(hd(sK50),nil),sK49))
| spl51_1 ),
inference(avatar_component_clause,[],[f561]) ).
fof(f565,definition,
( spl51_2
<=> sK50 = app(cons(hd(sK50),nil),sK49) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f567,plain,
( sK50 = app(cons(hd(sK50),nil),sK49)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f565]) ).
fof(f569,definition,
( spl51_3
<=> ssList(cons(hd(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f570,plain,
( ssList(cons(hd(sK50),nil))
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f571,plain,
( ~ ssList(cons(hd(sK50),nil))
| spl51_3 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f573,definition,
( spl51_4
<=> ssItem(hd(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f575,plain,
( ~ ssItem(hd(sK50))
| spl51_4 ),
inference(avatar_component_clause,[],[f573]) ).
fof(f577,definition,
( spl51_5
<=> neq(nil,sK50) ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f579,plain,
( neq(nil,sK50)
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f581,definition,
( spl51_6
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f582,plain,
( ~ neq(sK50,nil)
| spl51_6 ),
inference(avatar_component_clause,[],[f581]) ).
fof(f584,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3
| ~ spl51_4
| spl51_5
| spl51_6 ),
inference(avatar_split_clause,[],[f552,f581,f577,f573,f569,f565,f561]) ).
fof(f587,definition,
( spl51_7
<=> rearsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_7])],[avatar_definition]) ).
fof(f589,plain,
( rearsegP(sK50,sK49)
| ~ spl51_7 ),
inference(avatar_component_clause,[],[f587]) ).
fof(f591,plain,
~ spl51_6,
inference(avatar_split_clause,[],[f549,f581]) ).
fof(f592,plain,
( spl51_7
| spl51_6 ),
inference(avatar_split_clause,[],[f548,f581,f587]) ).
fof(f598,definition,
( spl51_9
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_9])],[avatar_definition]) ).
fof(f599,plain,
( ssList(nil)
| ~ spl51_9 ),
inference(avatar_component_clause,[],[f598]) ).
fof(f627,plain,
spl51_9,
inference(avatar_split_clause,[],[f306,f598]) ).
fof(f652,plain,
( ~ ssList(sK49)
| ~ ssList(cons(hd(sK50),nil))
| spl51_1 ),
inference(resolution,[],[f318,f563]) ).
fof(f661,plain,
( ~ ssList(cons(hd(sK50),nil))
| spl51_1 ),
inference(forward_subsumption_resolution,[],[f652,f420]) ).
fof(f662,plain,
( ~ spl51_3
| spl51_1 ),
inference(avatar_split_clause,[],[f661,f561,f569]) ).
fof(f663,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(nil)
| spl51_3 ),
inference(resolution,[],[f571,f305]) ).
fof(f664,plain,
( ~ ssItem(hd(sK50))
| spl51_3
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f663,f599]) ).
fof(f665,plain,
( ~ spl51_4
| spl51_3
| ~ spl51_9 ),
inference(avatar_split_clause,[],[f664,f598,f569,f573]) ).
fof(f666,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_4 ),
inference(resolution,[],[f575,f314]) ).
fof(f667,plain,
( nil = sK50
| spl51_4 ),
inference(forward_subsumption_resolution,[],[f666,f417]) ).
fof(f677,plain,
( ~ neq(nil,nil)
| spl51_4
| spl51_6 ),
inference(superposition,[],[f582,f667]) ).
fof(f690,plain,
( ~ ssList(nil)
| spl51_4
| spl51_6 ),
inference(resolution,[],[f677,f557]) ).
fof(f691,plain,
( $false
| spl51_4
| spl51_6
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f690,f599]) ).
fof(f692,plain,
( spl51_4
| spl51_6
| ~ spl51_9 ),
inference(avatar_contradiction_clause,[],[f691]) ).
fof(f805,definition,
( spl51_16
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_16])],[avatar_definition]) ).
fof(f807,plain,
( nil = sK50
| ~ spl51_16 ),
inference(avatar_component_clause,[],[f805]) ).
fof(f880,plain,
( neq(nil,nil)
| ~ spl51_5
| ~ spl51_16 ),
inference(superposition,[],[f579,f807]) ).
fof(f881,plain,
( ~ neq(nil,nil)
| spl51_6
| ~ spl51_16 ),
inference(superposition,[],[f582,f807]) ).
fof(f923,plain,
( ~ ssList(sK50)
| nil = sK50
| ~ ssList(nil)
| ~ spl51_5 ),
inference(resolution,[],[f516,f579]) ).
fof(f926,plain,
( nil = sK50
| ~ ssList(nil)
| ~ spl51_5 ),
inference(forward_subsumption_resolution,[],[f923,f417]) ).
fof(f931,plain,
( nil = sK50
| ~ spl51_5
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f926,f599]) ).
fof(f932,plain,
( spl51_16
| ~ spl51_5
| ~ spl51_9 ),
inference(avatar_split_clause,[],[f931,f598,f577,f805]) ).
fof(f963,plain,
( $false
| ~ spl51_5
| spl51_6
| ~ spl51_16 ),
inference(forward_subsumption_resolution,[],[f881,f880]) ).
fof(f964,plain,
( ~ spl51_5
| spl51_6
| ~ spl51_16 ),
inference(avatar_contradiction_clause,[],[f963]) ).
fof(f1187,plain,
! [X2,X1] :
( ~ rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f466,f318]) ).
fof(f1204,plain,
( ~ rearsegP(sK50,sK49)
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(sK49)
| ~ spl51_2 ),
inference(superposition,[],[f1187,f567]) ).
fof(f1214,plain,
( ~ ssList(cons(hd(sK50),nil))
| ~ ssList(sK49)
| ~ spl51_2
| ~ spl51_7 ),
inference(forward_subsumption_resolution,[],[f1204,f589]) ).
fof(f1215,plain,
( ~ ssList(sK49)
| ~ spl51_2
| ~ spl51_3
| ~ spl51_7 ),
inference(forward_subsumption_resolution,[],[f1214,f570]) ).
fof(f1216,plain,
( $false
| ~ spl51_2
| ~ spl51_3
| ~ spl51_7 ),
inference(forward_subsumption_resolution,[],[f1215,f420]) ).
fof(f1217,plain,
( ~ spl51_2
| ~ spl51_3
| ~ spl51_7 ),
inference(avatar_contradiction_clause,[],[f1216]) ).
cnf(s1,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3
| ~ spl51_4
| spl51_5
| spl51_6 ),
inference(sat_conversion,[],[f584]) ).
cnf(s4,plain,
~ spl51_6,
inference(sat_conversion,[],[f591]) ).
cnf(s5,plain,
( spl51_6
| spl51_7 ),
inference(sat_conversion,[],[f592]) ).
cnf(s14,plain,
spl51_9,
inference(sat_conversion,[],[f627]) ).
cnf(s15,plain,
( spl51_1
| ~ spl51_3 ),
inference(sat_conversion,[],[f662]) ).
cnf(s16,plain,
( spl51_3
| ~ spl51_4
| ~ spl51_9 ),
inference(sat_conversion,[],[f665]) ).
cnf(s17,plain,
( spl51_4
| spl51_6
| ~ spl51_9 ),
inference(sat_conversion,[],[f692]) ).
cnf(s30,plain,
( ~ spl51_5
| ~ spl51_9
| spl51_16 ),
inference(sat_conversion,[],[f932]) ).
cnf(s31,plain,
( ~ spl51_5
| spl51_6
| ~ spl51_16 ),
inference(sat_conversion,[],[f964]) ).
cnf(s42,plain,
( ~ spl51_2
| ~ spl51_3
| ~ spl51_7 ),
inference(sat_conversion,[],[f1217]) ).
cnf(s47,plain,
spl51_4,
inference(rat,[],[s17,s14,s4]) ).
cnf(s48,plain,
spl51_7,
inference(rat,[],[s5,s4]) ).
cnf(s50,plain,
spl51_3,
inference(rat,[],[s16,s14,s47]) ).
cnf(s51,plain,
~ spl51_2,
inference(rat,[],[s42,s48,s50]) ).
cnf(s56,plain,
spl51_1,
inference(rat,[],[s15,s50]) ).
cnf(s57,plain,
spl51_5,
inference(rat,[],[s1,s4,s47,s50,s51,s56]) ).
cnf(s58,plain,
~ spl51_16,
inference(rat,[],[s31,s4,s57]) ).
cnf(s59,plain,
$false,
inference(rat,[],[s30,s14,s58,s57]) ).
fof(f1218,plain,
$false,
inference(avatar_sat_refutation,[],[s59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC366+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.07/0.19 % Computer : n004.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 09:20:13 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 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
% 0.20/0.27 % (225328)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (225334)% WARNING: option uhcvi not known.
% 0.20/0.27 % (225334)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2993519338:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (225333)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4205484457_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % (225335)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1546648000:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (225336)dis+10_1_sil=32000:sp=arity:random_seed=53235718:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (225338)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=799199400:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (225337)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=398534157:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (225339)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=506763949:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27 % (225334) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-225328-225334"...
% 0.20/0.27 % (225334)...printing done.
% 0.20/0.27 % (225334)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (225334)------------------------------
% 0.20/0.27 % (225334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (225334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (225334)CaDiCaL version: 2.1.3
% 0.20/0.27 % (225334)Termination reason: Refutation
% 0.20/0.27 % (225334)Time elapsed: 0.014 s
% 0.20/0.27 % (225334)Peak memory usage: 13 MB
% 0.20/0.27 % (225334)Instructions burned: 36 (million)
% 0.20/0.27 % (225328)Success in time 0.044 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------