TSTP Solution File: SWC046+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC046+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.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:35:48 EDT 2024
% Result : Theorem 0.54s 0.76s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 10 unt; 0 def)
% Number of atoms : 365 ( 94 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 460 ( 148 ~; 139 |; 144 &)
% ( 2 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 130 ( 79 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f416,plain,
$false,
inference(subsumption_resolution,[],[f415,f164]) ).
fof(f164,plain,
ssList(sK2),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(sK3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(sK3,X4) )
| ~ memberP(sK2,X4) )
& ( ~ memberP(sK3,X4)
| ( segmentP(sK3,app(app(cons(X4,nil),sK4(X4)),cons(X4,nil)))
& ssList(sK4(X4)) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f137,f136,f135,f134,f133]) ).
fof(f133,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(sK2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(sK2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
=> ( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(sK3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(sK3,X4) )
| ~ memberP(sK2,X4) )
& ( ~ memberP(sK3,X4)
| ? [X6] :
( segmentP(sK3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
! [X4] :
( ? [X6] :
( segmentP(sK3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
=> ( segmentP(sK3,app(app(cons(X4,nil),sK4(X4)),cons(X4,nil)))
& ssList(sK4(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f415,plain,
~ ssList(sK2),
inference(subsumption_resolution,[],[f414,f222]) ).
fof(f222,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f169,f219,f168]) ).
fof(f168,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f138]) ).
fof(f219,plain,
nil = sK3,
inference(definition_unfolding,[],[f166,f167]) ).
fof(f167,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f138]) ).
fof(f166,plain,
nil = sK1,
inference(cnf_transformation,[],[f138]) ).
fof(f169,plain,
nil != sK0,
inference(cnf_transformation,[],[f138]) ).
fof(f414,plain,
( sK2 = sK3
| ~ ssList(sK2) ),
inference(resolution,[],[f413,f227]) ).
fof(f227,plain,
! [X0] :
( ssItem(sK8(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f179,f219]) ).
fof(f179,plain,
! [X0] :
( ssItem(sK8(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ( cons(sK8(X0),sK7(X0)) = X0
& ssItem(sK8(X0))
& ssList(sK7(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f103,f143,f142]) ).
fof(f142,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK7(X0)) = X0
& ssItem(X2) )
& ssList(sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK7(X0)) = X0
& ssItem(X2) )
=> ( cons(sK8(X0),sK7(X0)) = X0
& ssItem(sK8(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f413,plain,
~ ssItem(sK8(sK2)),
inference(subsumption_resolution,[],[f412,f164]) ).
fof(f412,plain,
( ~ ssList(sK2)
| ~ ssItem(sK8(sK2)) ),
inference(subsumption_resolution,[],[f406,f222]) ).
fof(f406,plain,
( sK2 = sK3
| ~ ssList(sK2)
| ~ ssItem(sK8(sK2)) ),
inference(resolution,[],[f392,f326]) ).
fof(f326,plain,
! [X0] :
( ~ memberP(sK2,X0)
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f325]) ).
fof(f325,plain,
! [X0] :
( ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssItem(X0) ),
inference(resolution,[],[f172,f236]) ).
fof(f236,plain,
! [X0] :
( ~ memberP(sK3,X0)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f197,f219]) ).
fof(f197,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f172,plain,
! [X4] :
( memberP(sK3,X4)
| ~ memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f392,plain,
! [X0] :
( memberP(X0,sK8(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f391,f228]) ).
fof(f228,plain,
! [X0] :
( ssList(sK7(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f178,f219]) ).
fof(f178,plain,
! [X0] :
( ssList(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f391,plain,
! [X0] :
( memberP(X0,sK8(X0))
| ~ ssList(sK7(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f377,f227]) ).
fof(f377,plain,
! [X0] :
( memberP(X0,sK8(X0))
| ~ ssList(sK7(X0))
| ~ ssItem(sK8(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(superposition,[],[f246,f226]) ).
fof(f226,plain,
! [X0] :
( cons(sK8(X0),sK7(X0)) = X0
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f180,f219]) ).
fof(f180,plain,
! [X0] :
( cons(sK8(X0),sK7(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f246,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f242]) ).
fof(f242,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f199]) ).
fof(f199,plain,
! [X2,X0,X1] :
( memberP(cons(X1,X2),X0)
| X0 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f147]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax37) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC046+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 02:50:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.75 % (22428)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.54/0.75 % (22421)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.54/0.75 % (22422)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.54/0.75 % (22424)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.54/0.75 % (22423)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.75 % (22425)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.54/0.75 % (22426)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.54/0.75 % (22427)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.54/0.76 % (22426)First to succeed.
% 0.54/0.76 % (22426)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22335"
% 0.54/0.76 % (22424)Also succeeded, but the first one will report.
% 0.54/0.76 % (22426)Refutation found. Thanks to Tanya!
% 0.54/0.76 % SZS status Theorem for theBenchmark
% 0.54/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.76 % (22426)------------------------------
% 0.54/0.76 % (22426)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.76 % (22426)Termination reason: Refutation
% 0.54/0.76
% 0.54/0.76 % (22426)Memory used [KB]: 1192
% 0.54/0.76 % (22426)Time elapsed: 0.009 s
% 0.54/0.76 % (22426)Instructions burned: 14 (million)
% 0.54/0.76 % (22335)Success in time 0.42 s
% 0.54/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------