%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC384+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:48 PM UTC 2026
% Result : Theorem 0.19s 0.31s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of formulae : 117 ( 27 unt; 10 def)
% Number of atoms : 372 ( 58 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 409 ( 154 ~; 170 |; 48 &)
% ( 16 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 11 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 55 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) ) )
& ( nil != X3
| nil != X2 ) )
| ( singletonP(X0)
& segmentP(X1,X0) ) ) ) ) ) ),
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] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) ) )
& ( nil != X3
| nil != X2 ) )
| ( singletonP(X0)
& segmentP(X1,X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& 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] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f234,plain,
! [X0,X1] :
( ~ ssList(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| singletonP(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f307,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != X0 ),
inference(cnf_transformation,[],[f120]) ).
fof(f417,plain,
( nil = sK50
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( nil = sK49
| ssList(sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( nil = sK49
| sK50 = app(app(sK52,sK49),sK53) ),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
( nil = sK50
| ssList(sK52) ),
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
( nil = sK50
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
( ~ segmentP(sK48,sK47)
| ~ singletonP(sK47) ),
inference(cnf_transformation,[],[f222]) ).
fof(f427,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f428,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f429,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f431,plain,
ssList(sK48),
inference(cnf_transformation,[],[f222]) ).
fof(f432,plain,
ssList(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f433,plain,
ssList(sK49),
inference(definition_unfolding,[],[f432,f428]) ).
fof(f434,plain,
ssList(sK50),
inference(definition_unfolding,[],[f431,f429]) ).
fof(f435,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f427,f429]) ).
fof(f436,plain,
( ~ segmentP(sK50,sK49)
| ~ singletonP(sK49) ),
inference(definition_unfolding,[],[f425,f429,f428,f428]) ).
fof(f439,plain,
! [X1] :
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(equality_resolution,[],[f234]) ).
fof(f442,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f241]) ).
fof(f451,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f468,plain,
! [X1] :
( ~ singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(consistent_polarity_flipping,[],[f439]) ).
fof(f480,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ssList(X1)
| ssList(X3)
| ssList(X2)
| ssList(app(app(X2,X1),X3)) ),
inference(consistent_polarity_flipping,[],[f442]) ).
fof(f539,plain,
! [X1] :
( ssList(X1)
| ssList(X1)
| neq(X1,X1) ),
inference(consistent_polarity_flipping,[],[f451]) ).
fof(f542,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f306]) ).
fof(f543,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f307]) ).
fof(f627,plain,
~ ssList(sK49),
inference(consistent_polarity_flipping,[],[f433]) ).
fof(f628,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f434]) ).
fof(f630,plain,
~ neq(sK50,nil),
inference(consistent_polarity_flipping,[],[f435]) ).
fof(f632,plain,
( ~ segmentP(sK50,sK49)
| singletonP(sK49) ),
inference(consistent_polarity_flipping,[],[f436]) ).
fof(f633,plain,
( nil = sK50
| ~ ssList(sK52) ),
inference(consistent_polarity_flipping,[],[f422]) ).
fof(f635,plain,
( nil = sK49
| ~ ssList(sK53) ),
inference(consistent_polarity_flipping,[],[f418]) ).
fof(f645,plain,
! [X1] :
( neq(X1,X1)
| ssList(X1) ),
inference(duplicate_literal_removal,[],[f539]) ).
fof(f652,definition,
( spl54_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl54_2])],[avatar_definition]) ).
fof(f654,plain,
( nil = sK49
| ~ spl54_2 ),
inference(avatar_component_clause,[],[f652]) ).
fof(f657,definition,
( spl54_3
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl54_3])],[avatar_definition]) ).
fof(f659,plain,
( nil = sK50
| ~ spl54_3 ),
inference(avatar_component_clause,[],[f657]) ).
fof(f667,definition,
( spl54_5
<=> ssList(sK53) ),
introduced(definition,[new_symbols(definition,[spl54_5])],[avatar_definition]) ).
fof(f669,plain,
( ~ ssList(sK53)
| spl54_5 ),
inference(avatar_component_clause,[],[f667]) ).
fof(f672,definition,
( spl54_6
<=> sK50 = app(app(sK52,sK49),sK53) ),
introduced(definition,[new_symbols(definition,[spl54_6])],[avatar_definition]) ).
fof(f674,plain,
( sK50 = app(app(sK52,sK49),sK53)
| ~ spl54_6 ),
inference(avatar_component_clause,[],[f672]) ).
fof(f677,definition,
( spl54_7
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl54_7])],[avatar_definition]) ).
fof(f679,plain,
( sK49 = cons(sK51,nil)
| ~ spl54_7 ),
inference(avatar_component_clause,[],[f677]) ).
fof(f680,plain,
( spl54_7
| spl54_3 ),
inference(avatar_split_clause,[],[f417,f657,f677]) ).
fof(f681,plain,
( ~ spl54_5
| spl54_2 ),
inference(avatar_split_clause,[],[f635,f652,f667]) ).
fof(f682,plain,
( spl54_6
| spl54_2 ),
inference(avatar_split_clause,[],[f419,f652,f672]) ).
fof(f685,definition,
( spl54_8
<=> ssList(sK52) ),
introduced(definition,[new_symbols(definition,[spl54_8])],[avatar_definition]) ).
fof(f687,plain,
( ~ ssList(sK52)
| spl54_8 ),
inference(avatar_component_clause,[],[f685]) ).
fof(f689,plain,
( ~ spl54_8
| spl54_3 ),
inference(avatar_split_clause,[],[f633,f657,f685]) ).
fof(f691,definition,
( spl54_9
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl54_9])],[avatar_definition]) ).
fof(f693,plain,
( ssItem(sK51)
| ~ spl54_9 ),
inference(avatar_component_clause,[],[f691]) ).
fof(f694,plain,
( spl54_9
| spl54_3 ),
inference(avatar_split_clause,[],[f423,f657,f691]) ).
fof(f697,definition,
( spl54_10
<=> singletonP(sK49) ),
introduced(definition,[new_symbols(definition,[spl54_10])],[avatar_definition]) ).
fof(f701,definition,
( spl54_11
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl54_11])],[avatar_definition]) ).
fof(f703,plain,
( ~ segmentP(sK50,sK49)
| spl54_11 ),
inference(avatar_component_clause,[],[f701]) ).
fof(f704,plain,
( spl54_10
| ~ spl54_11 ),
inference(avatar_split_clause,[],[f632,f701,f697]) ).
fof(f710,definition,
( spl54_13
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl54_13])],[avatar_definition]) ).
fof(f711,plain,
( ~ ssList(nil)
| spl54_13 ),
inference(avatar_component_clause,[],[f710]) ).
fof(f739,plain,
~ spl54_13,
inference(avatar_split_clause,[],[f542,f710]) ).
fof(f742,plain,
( ~ neq(nil,nil)
| ~ spl54_3 ),
inference(superposition,[],[f630,f659]) ).
fof(f752,plain,
( ssList(nil)
| ~ spl54_3 ),
inference(resolution,[],[f645,f742]) ).
fof(f753,plain,
( $false
| ~ spl54_3
| spl54_13 ),
inference(forward_subsumption_resolution,[],[f752,f711]) ).
fof(f754,plain,
( ~ spl54_3
| spl54_13 ),
inference(avatar_contradiction_clause,[],[f753]) ).
fof(f756,plain,
( nil = cons(sK51,nil)
| ~ spl54_2
| ~ spl54_7 ),
inference(forward_demodulation,[],[f679,f654]) ).
fof(f853,plain,
( nil != nil
| ~ ssItem(sK51)
| ssList(nil)
| ~ spl54_2
| ~ spl54_7 ),
inference(superposition,[],[f543,f756]) ).
fof(f854,plain,
( ~ ssItem(sK51)
| ssList(nil)
| ~ spl54_2
| ~ spl54_7 ),
inference(trivial_inequality_removal,[],[f853]) ).
fof(f855,plain,
( ssList(nil)
| ~ spl54_2
| ~ spl54_7
| ~ spl54_9 ),
inference(forward_subsumption_resolution,[],[f854,f693]) ).
fof(f856,plain,
( $false
| ~ spl54_2
| ~ spl54_7
| ~ spl54_9
| spl54_13 ),
inference(forward_subsumption_resolution,[],[f855,f711]) ).
fof(f857,plain,
( ~ spl54_2
| ~ spl54_7
| ~ spl54_9
| spl54_13 ),
inference(avatar_contradiction_clause,[],[f856]) ).
fof(f887,plain,
( ~ singletonP(sK49)
| ~ ssItem(sK51)
| ssList(sK49)
| ~ spl54_7 ),
inference(superposition,[],[f468,f679]) ).
fof(f892,plain,
( ~ singletonP(sK49)
| ssList(sK49)
| ~ spl54_7
| ~ spl54_9 ),
inference(forward_subsumption_resolution,[],[f887,f693]) ).
fof(f893,plain,
( ~ singletonP(sK49)
| ~ spl54_7
| ~ spl54_9 ),
inference(forward_subsumption_resolution,[],[f892,f627]) ).
fof(f894,plain,
( ~ spl54_10
| ~ spl54_7
| ~ spl54_9 ),
inference(avatar_split_clause,[],[f893,f691,f677,f697]) ).
fof(f2300,plain,
( segmentP(sK50,sK49)
| ssList(sK49)
| ssList(sK53)
| ssList(sK52)
| ssList(sK50)
| ~ spl54_6 ),
inference(superposition,[],[f480,f674]) ).
fof(f2308,plain,
( ssList(sK49)
| ssList(sK53)
| ssList(sK52)
| ssList(sK50)
| ~ spl54_6
| spl54_11 ),
inference(forward_subsumption_resolution,[],[f2300,f703]) ).
fof(f2314,plain,
( ssList(sK53)
| ssList(sK52)
| ssList(sK50)
| ~ spl54_6
| spl54_11 ),
inference(forward_subsumption_resolution,[],[f2308,f627]) ).
fof(f2320,plain,
( ssList(sK52)
| ssList(sK50)
| spl54_5
| ~ spl54_6
| spl54_11 ),
inference(forward_subsumption_resolution,[],[f2314,f669]) ).
fof(f2323,plain,
( ssList(sK50)
| spl54_5
| ~ spl54_6
| spl54_8
| spl54_11 ),
inference(forward_subsumption_resolution,[],[f2320,f687]) ).
fof(f2325,plain,
( $false
| spl54_5
| ~ spl54_6
| spl54_8
| spl54_11 ),
inference(forward_subsumption_resolution,[],[f2323,f628]) ).
fof(f2326,plain,
( spl54_5
| ~ spl54_6
| spl54_8
| spl54_11 ),
inference(avatar_contradiction_clause,[],[f2325]) ).
cnf(s7,plain,
( spl54_3
| spl54_7 ),
inference(sat_conversion,[],[f680]) ).
cnf(s8,plain,
( spl54_2
| ~ spl54_5 ),
inference(sat_conversion,[],[f681]) ).
cnf(s9,plain,
( spl54_2
| spl54_6 ),
inference(sat_conversion,[],[f682]) ).
cnf(s12,plain,
( spl54_3
| ~ spl54_8 ),
inference(sat_conversion,[],[f689]) ).
cnf(s13,plain,
( spl54_3
| spl54_9 ),
inference(sat_conversion,[],[f694]) ).
cnf(s15,plain,
( spl54_10
| ~ spl54_11 ),
inference(sat_conversion,[],[f704]) ).
cnf(s24,plain,
~ spl54_13,
inference(sat_conversion,[],[f739]) ).
cnf(s29,plain,
( ~ spl54_3
| spl54_13 ),
inference(sat_conversion,[],[f754]) ).
cnf(s30,plain,
( ~ spl54_2
| ~ spl54_7
| ~ spl54_9
| spl54_13 ),
inference(sat_conversion,[],[f857]) ).
cnf(s32,plain,
( ~ spl54_7
| ~ spl54_9
| ~ spl54_10 ),
inference(sat_conversion,[],[f894]) ).
cnf(s71,plain,
( spl54_5
| ~ spl54_6
| spl54_8
| spl54_11 ),
inference(sat_conversion,[],[f2326]) ).
cnf(s72,plain,
~ spl54_3,
inference(rat,[],[s29,s24]) ).
cnf(s78,plain,
spl54_9,
inference(rat,[],[s13,s72]) ).
cnf(s79,plain,
~ spl54_8,
inference(rat,[],[s12,s72]) ).
cnf(s81,plain,
spl54_7,
inference(rat,[],[s7,s72]) ).
cnf(s82,plain,
~ spl54_10,
inference(rat,[],[s32,s78,s81]) ).
cnf(s83,plain,
~ spl54_2,
inference(rat,[],[s30,s24,s78,s81]) ).
cnf(s85,plain,
~ spl54_11,
inference(rat,[],[s15,s82]) ).
cnf(s87,plain,
spl54_6,
inference(rat,[],[s9,s83]) ).
cnf(s88,plain,
~ spl54_5,
inference(rat,[],[s8,s83]) ).
cnf(s95,plain,
$false,
inference(rat,[],[s71,s85,s79,s87,s88]) ).
fof(f2327,plain,
$false,
inference(avatar_sat_refutation,[],[s95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC384+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n001.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 09:30:02 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/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.19/0.31 % (242001)Will run a generic schedule for satisfiability detection.
% 0.19/0.31 % (242010)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3056337923:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.31 % (242007)% WARNING: option uhcvi not known.
% 0.19/0.31 % (242006)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2446498535_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.31 % (242007)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=692224678:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.31 % (242008)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3812965963:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.31 % (242011)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=175632485:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.31 % (242009)dis+10_1_sil=32000:sp=arity:random_seed=2435459972:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.31 % (242012)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1363204865:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.31 % TRYING [1]
% 0.19/0.31 % TRYING [2]
% 0.19/0.31 % TRYING [3]
% 0.19/0.31 % (242010)Instruction limit reached!
% 0.19/0.31 % (242010)------------------------------
% 0.19/0.31 % (242010)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.31 % (242010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.31 % (242010)CaDiCaL version: 2.1.3
% 0.19/0.31 % (242010)Termination reason: Instruction limit
% 0.19/0.31 % (242010)Termination phase: Saturation
% 0.19/0.31 % (242010)Time elapsed: 0.039 s
% 0.19/0.31 % (242010)Peak memory usage: 13 MB
% 0.19/0.31 % (242010)Instructions burned: 119 (million)
% 0.19/0.31 % TRYING [4]
% 0.19/0.31 % (242020)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3479405759:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.31 % (242007) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-242001-242007"...
% 0.19/0.31 % (242007)...printing done.
% 0.19/0.31 % (242007)Refutation found. Thanks to Tanya!
% 0.19/0.31 % SZS status Theorem for theBenchmark
% 0.19/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.31 % (242007)------------------------------
% 0.19/0.31 % (242007)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.31 % (242007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.31 % (242007)CaDiCaL version: 2.1.3
% 0.19/0.31 % (242007)Termination reason: Refutation
% 0.19/0.31 % (242007)Time elapsed: 0.045 s
% 0.19/0.31 % (242007)Peak memory usage: 14 MB
% 0.19/0.31 % (242007)Instructions burned: 73 (million)
% 0.19/0.31 % (242001)Success in time 0.083 s
% 0.19/0.31 % Vampire exiting
%------------------------------------------------------------------------------