TSTP Solution File: SWC122+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC122+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:36:23 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of formulae : 72 ( 10 unt; 0 def)
% Number of atoms : 394 ( 84 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 495 ( 173 ~; 160 |; 133 &)
% ( 9 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 101 ( 60 !; 41 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f604,plain,
$false,
inference(avatar_sat_refutation,[],[f248,f253,f258,f268,f436,f603]) ).
fof(f603,plain,
( ~ spl11_2
| spl11_4
| ~ spl11_15 ),
inference(avatar_contradiction_clause,[],[f602]) ).
fof(f602,plain,
( $false
| ~ spl11_2
| spl11_4
| ~ spl11_15 ),
inference(subsumption_resolution,[],[f601,f257]) ).
fof(f257,plain,
( ~ segmentP(sK3,sK2)
| spl11_4 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f255,plain,
( spl11_4
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f601,plain,
( segmentP(sK3,sK2)
| ~ spl11_2
| ~ spl11_15 ),
inference(subsumption_resolution,[],[f600,f181]) ).
fof(f181,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f600,plain,
( ~ ssList(nil)
| segmentP(sK3,sK2)
| ~ spl11_2
| ~ spl11_15 ),
inference(subsumption_resolution,[],[f597,f169]) ).
fof(f169,plain,
ssList(sK3),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
( ( ( rearsegP(sK3,sK2)
& neq(sK2,nil) )
| ~ neq(sK3,nil) )
& ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK3
| nil = sK2 )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f143,f142,f141,f140]) ).
fof(f140,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X3
| nil = X2 )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X3
| nil = X2 )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK2)
& neq(sK2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X3
| nil = sK2 )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK2)
& neq(sK2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != X3
| nil = sK2 )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK3,sK2)
& neq(sK2,nil) )
| ~ neq(sK3,nil) )
& ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK3
| nil = sK2 )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( segmentP(X1,X0)
& neq(X0,nil) )
| ( nil = X3
& nil != X2 )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( segmentP(X1,X0)
& neq(X0,nil) )
| ( nil = X3
& nil != X2 )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f597,plain,
( ~ ssList(sK3)
| ~ ssList(nil)
| segmentP(sK3,sK2)
| ~ spl11_2
| ~ spl11_15 ),
inference(duplicate_literal_removal,[],[f596]) ).
fof(f596,plain,
( ~ ssList(sK3)
| ~ ssList(nil)
| segmentP(sK3,sK2)
| ~ ssList(sK3)
| ~ spl11_2
| ~ spl11_15 ),
inference(superposition,[],[f581,f206]) ).
fof(f206,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f581,plain,
( ! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| segmentP(app(sK3,X0),sK2) )
| ~ spl11_2
| ~ spl11_15 ),
inference(subsumption_resolution,[],[f580,f168]) ).
fof(f168,plain,
ssList(sK2),
inference(cnf_transformation,[],[f144]) ).
fof(f580,plain,
( ! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| ~ ssList(sK2)
| segmentP(app(sK3,X0),sK2) )
| ~ spl11_2
| ~ spl11_15 ),
inference(subsumption_resolution,[],[f572,f416]) ).
fof(f416,plain,
( ssList(sK4(sK3,sK2))
| ~ spl11_15 ),
inference(avatar_component_clause,[],[f415]) ).
fof(f415,plain,
( spl11_15
<=> ssList(sK4(sK3,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_15])]) ).
fof(f572,plain,
( ! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| ~ ssList(sK4(sK3,sK2))
| ~ ssList(sK2)
| segmentP(app(sK3,X0),sK2) )
| ~ spl11_2 ),
inference(superposition,[],[f234,f407]) ).
fof(f407,plain,
( sK3 = app(sK4(sK3,sK2),sK2)
| ~ spl11_2 ),
inference(subsumption_resolution,[],[f406,f169]) ).
fof(f406,plain,
( sK3 = app(sK4(sK3,sK2),sK2)
| ~ ssList(sK3)
| ~ spl11_2 ),
inference(subsumption_resolution,[],[f399,f168]) ).
fof(f399,plain,
( sK3 = app(sK4(sK3,sK2),sK2)
| ~ ssList(sK2)
| ~ ssList(sK3)
| ~ spl11_2 ),
inference(resolution,[],[f190,f247]) ).
fof(f247,plain,
( rearsegP(sK3,sK2)
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f245,plain,
( spl11_2
<=> rearsegP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f190,plain,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| app(sK4(X0,X1),X1) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ( app(sK4(X0,X1),X1) = X0
& ssList(sK4(X0,X1)) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f149,f150]) ).
fof(f150,plain,
! [X0,X1] :
( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
=> ( app(sK4(X0,X1),X1) = X0
& ssList(sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X2,X1) = X0
& ssList(X2) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
fof(f234,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f202]) ).
fof(f202,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK5(X0,X1),X1),sK6(X0,X1)) = X0
& ssList(sK6(X0,X1))
& ssList(sK5(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f154,f156,f155]) ).
fof(f155,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK5(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK5(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK5(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK5(X0,X1),X1),sK6(X0,X1)) = X0
& ssList(sK6(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f153]) ).
fof(f153,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f436,plain,
( ~ spl11_2
| spl11_15 ),
inference(avatar_contradiction_clause,[],[f435]) ).
fof(f435,plain,
( $false
| ~ spl11_2
| spl11_15 ),
inference(subsumption_resolution,[],[f434,f169]) ).
fof(f434,plain,
( ~ ssList(sK3)
| ~ spl11_2
| spl11_15 ),
inference(subsumption_resolution,[],[f433,f168]) ).
fof(f433,plain,
( ~ ssList(sK2)
| ~ ssList(sK3)
| ~ spl11_2
| spl11_15 ),
inference(subsumption_resolution,[],[f432,f247]) ).
fof(f432,plain,
( ~ rearsegP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK3)
| spl11_15 ),
inference(resolution,[],[f417,f189]) ).
fof(f189,plain,
! [X0,X1] :
( ssList(sK4(X0,X1))
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f417,plain,
( ~ ssList(sK4(sK3,sK2))
| spl11_15 ),
inference(avatar_component_clause,[],[f415]) ).
fof(f268,plain,
spl11_1,
inference(avatar_split_clause,[],[f226,f241]) ).
fof(f241,plain,
( spl11_1
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f226,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f172,f170]) ).
fof(f170,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f144]) ).
fof(f172,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f144]) ).
fof(f258,plain,
( ~ spl11_3
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f225,f255,f250]) ).
fof(f250,plain,
( spl11_3
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f225,plain,
( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(definition_unfolding,[],[f174,f170,f171,f171]) ).
fof(f171,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f144]) ).
fof(f174,plain,
( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f253,plain,
( ~ spl11_1
| spl11_3 ),
inference(avatar_split_clause,[],[f175,f250,f241]) ).
fof(f175,plain,
( neq(sK2,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f248,plain,
( ~ spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f176,f245,f241]) ).
fof(f176,plain,
( rearsegP(sK3,sK2)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC122+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:53:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.58/0.74 % (31332)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.58/0.74 % (31325)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.58/0.74 % (31327)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.74 % (31326)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.58/0.74 % (31329)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.58/0.74 % (31328)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.58/0.74 % (31330)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.58/0.74 % (31331)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.58/0.75 % (31327)First to succeed.
% 0.58/0.76 % (31327)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31324"
% 0.58/0.76 % (31327)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for theBenchmark
% 0.58/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.76 % (31327)------------------------------
% 0.58/0.76 % (31327)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (31327)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (31327)Memory used [KB]: 1312
% 0.58/0.76 % (31327)Time elapsed: 0.016 s
% 0.58/0.76 % (31327)Instructions burned: 23 (million)
% 0.58/0.76 % (31324)Success in time 0.384 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------